One-point codes are those algebraic-geometry codes for which the associated divisor is a non-negative multiple of a single point. Evaluation codes were defined in order to give an algebraic generalization of both one-point algebraic-geometry codes and Reed–Muller codes. Given an \mathbbF_q{\mathbb{F}}_q-algebra A, an order function r\rho on A and given a surjective \mathbbF_q{\mathbb{F}}_q-morphism of algebras j: A® \mathbbF_qⁿ\varphi: A\rightarrow {\mathbb{F}}_q^{n}, the ith evaluation code with respect to A,r,jA,\rho,\varphi is defined as the code C_i=j({f Î A: r(f) £ i})C_i=\varphi(\{f\in A: \rho(f)\leq i\}) . In this work it is shown that under a certain hypothesis on the \mathbbF_q\mathbb{F}_q-algebra A, not only any evaluation code is a one-point code, but any sequence of evaluation codes is a sequence of one-point codes. This hypothesis on A is that its field of fractions is a function field over \mathbbF_q\mathbb{F}_q and that A is integrally closed. Moreover, we see that a sequence of algebraic-geometry codes G _i with associated divisors G_i\Gamma_i is the sequence of evaluation codes associated to some \mathbbF_q{\mathbb{F}}_q-algebra A, some order function r\rho and some surjective morphism j\varphi with {f Î A: r(f) £ i}=L(G_i)\{f\in A: \rho(f)\leq i\}={\mathcal{L}}(\Gamma_i) if and only if it is a sequence of one-point codes.