Algebras, polynomials and programs

DOI10.1016/0304-3975(90)90150-GzbMath0726.68055MaRDI QIDQ802882

Eric G. Wagner

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

iterationpolynomialsrecursionsubstitutionapplications of ideas from universal algebra and category theory to the definition and semantics of programming languagesflowchart program semanticsformal equationsLawvere algebraic theoriesmany-sorted universal algebrasrecursive program semantics

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Semantics in the theory of computing (68Q55) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (2)

Full abstraction and recursion ⋮ Topology, domain theory and theoretical computer science

Cites Work

• Canonical constraints for parameterized data types
• Recursion and iteration in continuous theories: the M-construction
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebras, polynomials and programs