Algebras, polynomials and programs (Q802882): Difference between revisions

The paper is directed to an audience of computer scientists with some knowledge of elementary category theory. It presents applications of ideas from universal algebra and category theory to the definition and semantics of programming languages, and to the study of iteration and recursion. Some of the topics covered are: many-sorted universal algebras, formal equations, polynomials, substitution, (many-sorted) Lawvere algebraic theories, flowchart program semantics, recursive program semantics. The paper is written clearly, and accomplishes its stated purpose.