Some fundamentals of order-algebraic semantics

  • E. G. Wagner
  • J. B. Wright
  • J. A. Goguen
  • J. W. Thatcher
Invited Lecturers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


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.


Minimum Element Partial Function Category Theory Rational Theory Algebraic Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ADJ (Coauthored by J.A. Goguen, J.W. Thatcher, E.G. Wagner and J.B. Wright.) (1975) "Initial algebra semantics and continuous algebras," IBM Research Report RC 5701, November 3, 1975. To appear, JACM.Google Scholar
  2. ADJ (Coauthored by J.A. Goguen, J.W. Thatcher, E.G. Wagner and J.B. Wright.) (1976) "A junction between computer science and category theory: I, Basic definitions and examples," Part 1, IBM Research Report RC 4526 (September 1973); Part 2, IBM Research Report 5908 (March 1976); Part 3 to appear.Google Scholar
  3. ADJ (Coauthored by J.A. Goguen, J.W. Thatcher, E.G. Wagner and J.B. Wright.) (1976a) "Rational algebraic theories and fixed-point solutions," submitted for presentation; IBM Research Report to appear.Google Scholar
  4. Arden, D.N. (1961) "Delayed-logic and finite-state machines," Course Notes 6.531, E.E.Dept., MIT, Summer, 1961.Google Scholar
  5. Bekic, H. (1969) "Definable operations in general algebra, and the theory of automata and flowcharts," Report IBM Laboratory Vienna, (1969).Google Scholar
  6. Berry, G. (1975) "Bottom up computation of recursive programs," IRIA Research Report 133, September 1975.Google Scholar
  7. Birkhoff, G. (1967) Lattice Theory, Amer. Math. Soc. Colloq. Pub. 25 New York (1948). (revised edition) (1967).Google Scholar
  8. Blikle, A. (1971) "Nets, complete lattices with a composition," Bulletin de l'Academie Polonaise des Sciences, Serie des Sciences Math. Astr., et Phys. 19 (1971) 1123–1127.Google Scholar
  9. Blikle, A. (1973) "Equations in nets, complete oriented lattices," CCPAS Report No. 99, Warsaw (1973).Google Scholar
  10. Blikle, A. (1974) "An extended approach to mathematical analysis of programs," CCPAS Report No. 169, Warsaw (1974).Google Scholar
  11. Bloom, S.L. and Elgot, C.C. (1974) "The existence and construction of free iterative theories," IBM Research Report RC-4937 (1974). To appear JCSS.Google Scholar
  12. Burstall, R.M. and Thatcher, J.W. "The algebraic theory of recursive program schemes," Proceedings AAAS Symposium on Category Theory Applied to Computation and Control, Univ. of Mass. Press, Amherst (1974); Lecture Notes in Computer Science 25 (1975) 126–131.Google Scholar
  13. de Bakker, J.W. and Scott, D. (1969) "A theory of programs," unpublished notes, IBM Seminar, Vienna (1969).Google Scholar
  14. de Roever, W.P. (1974) "Operational, mathematical and axiomatized semantics for recursive procedures and data structures," Mathematical Centre Report ID 1/74 (1974).Google Scholar
  15. Eilenberg, S. and Wright, J. (1967) "Automata in general algebras," Information and Control 11 (1967) 52–70.CrossRefGoogle Scholar
  16. Elgot, C.C. (1970) "The common algebraic structure of exit-automta and machines," Computing 6 (1970) 349–370.Google Scholar
  17. Elgot, C.C. (1971) "Algebraic theories and program schemes," Symp. on Semantics of Algorithmic Languages, (Ed. E.Engeler), Springer-Verlag (1971) 71–88.Google Scholar
  18. Elgot, C.C. (1972) "Remarks on one-argument program schemes," Formal Semantics of Programming Languages, (Ed. R. Rustin), Prentice-Hall, N.J. (1972) 59–64.Google Scholar
  19. Elgot, C.C. (1973) "Monadic computation and iterative algebraic theories," IBM Research Report RC 4564, October 1973. Proceedings, Logic Colloquium '73, North Holland Publishing Company (1975) 175–230.Google Scholar
  20. Elgot, C.C. (1974) See Bloom and Elgot (1974).Google Scholar
  21. (1975) "Structured programming with and without GO TO statements," IBM Research Report RC 5626 (1975). IEEE Trans.on Software Eng. SE-2 (1976) 41–54.Google Scholar
  22. Englefriet, J. (1974) "Simple program schemes and formal languages," Lecture Notes in Computer Science 20, Springer-Verlag (1974).Google Scholar
  23. Engelfriet, J. and Schmidt, E.M. (1975) "IO and OI," Datalogisk Afdeling Report DAIMI PB-417, Aarhus University, Denmark, July, 1975.Google Scholar
  24. Ginsburg, S. (1966) The Mathematical Theory of Context-Free Languages, McGraw-Hill, N.Y.(1966).Google Scholar
  25. Ginali, S. (1976) Ph.D. Dissertation, University of Chicago, forthcoming.Google Scholar
  26. Goguen, J.A. (1974) "On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs," J. of Comp. and Sys. Sci. 8 (1974) 333–365.Google Scholar
  27. Herrlich, H. and Strecker, C.E. (1973) Category Theory, Allyn and Bacon (1973)Google Scholar
  28. Karp, R.M. (1959) "Some applications of logical syntax to digital computer programming," Harvard University Thesis (1959).Google Scholar
  29. Lawvere, F.W. (1963) "Functional semantics of algebraic theories," Proceedings, Nat'l Acad. Sci. 50 (1963) 869–872.Google Scholar
  30. Mac Lane, S. (1971a) Category Theory for the Working Mathematician, Springer-Verlag (1971).Google Scholar
  31. Mezei, J. and Wright, J.B. (1967) "Algebraic automata and context-free sets," Information and Control 11 (1967) 3–29.CrossRefGoogle Scholar
  32. Mitchell, B. (1965) Theory of Categories, Academic Press, New York (1965).Google Scholar
  33. Pareigis, B. (1970) Categories and Functors, Academic Press, New York (1970).Google Scholar
  34. Park, D.M.R. (1969) "Fixpoint induction and proofs of program properties," Machine Intelligence 5 (Eds. B.Meltzer and D.Michie) Edinburgh Univ.Press (1969) 59–78.Google Scholar
  35. Scott, D. (1970) "Outline of a mathematical theory of computation," Proceedings, 4th Princeton Conf. on Inform. Science and Systems (1970).Google Scholar
  36. Wagner, E.G. (1971) "Languages for defining sets in arbitrary algebras," Proceedings, 12th IEEE Symp. on Switching and Automata Th., E.Lansing, Mich. (1971).Google Scholar
  37. Wagner, E.G. (1971a) "An algebraic theory of recursive definitions and recursive languages," Proceedings, 3rd ACM Symp. on Theory of Comp., Shaker Hghts, Ohio (1971).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • E. G. Wagner
    • 1
  • J. B. Wright
    • 1
  • J. A. Goguen
    • 1
  • J. W. Thatcher
    • 1
  1. 1.Computer Science DepartmentUCLALos Angeles

Personalised recommendations