First of all, the ring $\,R:=\Bbb Z[x]/(x-1)\,$ is a quotient ring of polynomials , not functions.
You can look at $\,R\,$ as the ring of residues of polynomials modulo $\,x-1\,$ , in a very similar way as $\,\Bbb Z/n\Bbb Z\,$ is the ring of residues modulo an integer $\,n\,$.
How do the element in $\,R\,$ look? Well, using Euclides algorithm, divide with residue any integer polynomial by $\,x-1\,$ :
$$p(x)\in\Bbb Z[x]\,\,,\,\,p(x)=g(x)(x-1)+r(x)\,\,,\,\,\deg r<1\,\,\,or\,\,\,r(x)=0$$
Thus, in the quotient ring, we can write
$$p(x)+(x-1)=\left[g(x)(x-1)+r(x)\right]+(x-1)=r(x)+(x-1)$$
which means $\,p(x)=r(x)\pmod{(x-1)}\,$
But, of course, $\,\deg r<1\Longleftrightarrow r(x)=$constant or $\,r(x)=0\,$, so now it isn't hard to prove that $\,R\cong\Bbb Z\,$ ...