de Bakker, J. W. and Scott, D. (1969) A theory of programs, IBM Seminar, Vienna.

Bekić, H. (1984) Definable operations in general algebras and the theory of automata and flowcharts. Springer-Verlag Lecture Notes in Computer Science 177 30–55.

Bloom, S. L., Elgot, C. C. and Wright, J. B. (1980a) Solutions of the iteration equation and extension of the scalar iteration operation. SIAM J. Computing 9 26–45.

Bloom, S. L., Elgot, C. C. and Wright, J. B. (1980b) Vector iteration in pointed iterative theories. SIAM J. Computing 9 525–540.

Bloom, S. L. and Ésik, Z. (1993) Iteration Theories, Springer-Verlag.

Bloom, S. L. and Ésik, Z. (2003) An extension theorem with an application to formal tree series. J. of Automata, Languages and Combinatorics 8 (2)145–185.

Bloom, S. L. and Ésik, Z. (2009) Axiomatizing rational power series over natural numbers. Information and Computation 207 793–811.

Bloom, S. L., Ginali, S. and Rutledge, J. D. (1977) Scalar and vector iteration. J. Comput. System Sci. 14 251–256.

Elgot, C. C. (1976) Matricial theories. J. Algebra 42 391–421.

Elgot, C. C. (1973) Monadic computation and iterative algebraic theories. Logic Colloquium '73, Studies in Logic and the Foundations of Mathematics **80**, North-Holland175–230.

Ésik, Z. (1980) Identities in iterative and rational algebraic theories. Computational Linguistics and Computer Languages XIV 183–207.

Ésik, Z. (1982) On generalized iterative algebraic theories. Computational Linguistics and Computer Languages XV 95–110.

Ésik, Z. (1997) Completeness of Park induction. Theoret. Comput. Sci. 177 217–283.

Ésik, Z. (1999) Group axioms for iteration. Information and Computation 148 131–180.

Ésik, Z. and Kuich, W. (2003) Formal tree series. J. Autom. Lang. Comb. 8 219–285.

Fokkink, W. (2007) Introduction to Process Algebra, Computer Science – Monograph, Springer-Verlag.

Golan, J. (1999) Semirings and Their Applications, Kluwer Academic Publishers.

Lawvere, F. W. (1963) Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. U.S.A. 50 869–872.

Niwinski, D. (1985) Equational μ-calculus. In: Skowron, A. (ed.) Computation theory – Proceedings, Fifth Symposium, Zaborów, Poland. Springer-Verlag Lecture Notes in Computer Science 208 169–176.

Niwinski, D. (1986) On fixed-point clones (extended abstract). In: Kott, L. (ed.) Automata, languages and programming – Proceedings 13th International Colloquium. Springer-Verlag Lecture Notes in Computer Science 226 464–473.

Park, D. M. R. (1970) Fixed point induction and proofs of program properties. In: Michie, D. and Meltzer, B. (eds.) Machine Intelligence 5, Edinburgh University Press 59–78.

Plotkin, G. (1983) Domains, University of Edinburgh.

Simpson, A. and Plotkin, G. (2000) Complete axioms for categorical fixed-point operators. 15th Annual IEEE Symposium on Logic in Computer Science (Santa Barbara, CA, 2000), IEEE Computer Society Press 30–41.

Wright, J. B., Thatcher, J. W., Wagner, E. G. and Goguen, J. A. (1976) Rational algebraic theories and fixed-point solutions, 17th Annual Symposium on Foundations of Computer Science, IEEE Computer Society 147–158.