Advertisement

A uniform approach to inductive posets and inductive closure

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

Keywords

Complete Lattice Principal Ideal Universal Condition Compact Element Free Monoid 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. (1973) (JAG, JWT, EGW, JBW) J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright "A junction between computer science and category theory: I, Basic definitions and examples," Part 1, IBM Research Report RC 5426, September 1973.Google Scholar
  2. (1975) (JAG, JWT, EGW, JBW) "Initial algebra semantics and continuous algebras," IBM Research Report RC 5701, November 3, 1975. JACM 24 (1977) 68–95.CrossRefGoogle Scholar
  3. (1976) (JAG, JWT, EGW, JBW) J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright "A junction between computer science and category theory: I, Basic definitions and examples," Part 2, IBM Research Report RC 5908, March, 1976.Google Scholar
  4. Birkhoff, G. (1967) Lattice Theory, Amer. Math. Soc. Colloy. Pub. 25, New York (1948). Revised edition (1967).Google Scholar
  5. Bloom, Stephen L. (1976) "Varieties of ordered algebras," J. Comp. Sys. Sci. 13 (1976) 200–212.Google Scholar
  6. Courcelle, Bruno and Nivat, Maurice (1976) "Algebraic families of interpretations," Proceedings 17th Annual IEEE Symposium on Foundations of Computing, Houston, Texas, October, 1976, pp. 137–146.Google Scholar
  7. Egli, H. and Constable, R. L. (1976) "Computability concepts for programming language semantics," Theoretical Computer Science 2 (1976) 133–145.CrossRefGoogle Scholar
  8. Mac Lane, S. (1971) Category Theory for the Working Mathematician, Springer-Verlag, New York (1971).Google Scholar
  9. Markowsky, George (1974) "Categories of chain-complete posets," IBM Research Report RC 5100, October, 1974.Google Scholar
  10. Markowsky, G. and Rosen, B. K. (1976) "Bases for chain complete posets," IBM J. Res. Dev. 20 (1976) 138–147.Google Scholar
  11. Scott, D. (1970) "Outline of a mathematical theory of computation," Proceedings, 4th Ann. Princeton Conference on Information Sciences and Systems (1970) 169–176.Google Scholar
  12. (1971) "Continuous lattices," Oxford University Computing Laboratory Technical Monograph PRG 7. Also, Lecture Notes in Mathematics 274, Springer-Verlag, Berlin (1971) 97–136.Google Scholar
  13. (1972) "Data types as lattices", Unpublished notes, Amsterdam (1972).Google Scholar
  14. Tiuryn, Jerzy (1976) "Regular Algebras", (Extended Abstract). Manuscript, Warsaw University (1976).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • J. B. Wright
    • 1
  • E. G. Wagner
    • 1
  • J. W. Thatcher
    • 1
  1. 1.Mathematical Sciences DepartmentIBM Thomas J. Watson Research CenterYorktown Heights

Personalised recommendations