Abstract
The order-theoretic enrichment of the algebraic approach to theoretical computer science, and to the theory of programming in particular, can be accomplished rather directly and elegantly, and appears to have a wide range of applications. This paper presents mathematical fundamentals of order-algebraic semantics. The principal new results concern free continuous algebraic theories and minimal conditions for solving general "systems of (recursive) equations" in algebraic theories.
Cite
CITATION STYLE
Wagner, E. G., Wright, J. B., Goguen, J. A., & Thatcher, J. W. (1976). Some fundamentals of order-algebraic semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 45 LNCS, pp. 153–168). Springer Verlag. https://doi.org/10.1007/3-540-07854-1_169
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
