Some Fundamentals of Order-Algebraic Semantics

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.

[1]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[2]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[3]  Jesse B. Wright,et al.  Automata in General Algebras , 1967, Inf. Control..

[4]  Stephen L. Bloom,et al.  The Existence and Construction of Free Iterative Theories , 1976, J. Comput. Syst. Sci..

[5]  Bodo Pareigis,et al.  Categories and Functors , 1970 .

[6]  Law Fw.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963 .

[7]  Calvin C. Elgot.  The Common Algebraic Structure of Exit-Automata and Machines , 1970 .

[8]  de W.P. Roever.  Operational, mathematical and axiomatized semantics for recursive procedures and data structures , 1974 .

[9]  Eric G. Wagner.  Languages for Defining Sets in Arbitrary Algebras , 1971, SWAT.

[10]  Eric G. Wagner,et al.  An algebraic theory of recursive definitions and recursive languages , 1971, STOC.

[11]  C. C. Elgot.  Structured Programming With and Without GO TO Statements , 1976, IEEE Trans. Software Eng..

[12]  Gérard Berry.  Bottom-Up Computation of Recursive Programs , 1976, RAIRO Theor. Informatics Appl..

[13]  J. Engelfriet,et al.  IO and OI , 1975 .

[14]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[15]  B. Mitchell,et al.  Theory of categories , 1965 .

[16]  Calvin C. Elgot,et al.  Algebraic theories and program schemes , 1971, Symposium on Semantics of Algorithmic Languages.

[17]  Rod M. Burstall,et al.  The algebraic theory of recursive program schemes , 1974, Category Theory Applied to Computation and Control.

[18]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .

[19]  Dean N. Arden.  Delayed-logic and finite-state machines , 1961, SWCT.

[20]  Joost Engelfriet,et al.  Simple Program Schemes and Formal Languages , 1974, Lecture Notes in Computer Science.

[21]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[22]  Joseph A. Goguen,et al.  Rational algebraic theories and fixed-point solutions , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[23]  Joseph A. Goguen,et al.  On Homomorphisms, Correctness, Termination, Unfoldments, and Equivalence of Flow Diagram Programs , 1974, J. Comput. Syst. Sci..