Skip to main content
SpringerLink
Log in

Z-Continuous algebras

  • Conference paper
  • First Online:
Continuous Lattices

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 871))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Adámek. Construction of Free Ordered Algebras. Manuscript, FEL, CVUT, Prague, 1979.

    Google Scholar 

  2. ADJ (= Goguen, Thatcher, Wagner and Wright). Initial Algebra Semantics and Continuous Algebras. J.A.C.M. 24 (1977) 68–95.

    MathSciNet  MATH  Google Scholar 

  3. ADJ. Free Continuous Theories. IBM Research Report RC6906, 1977 Yorktown Heights, N.Y.

    Google Scholar 

  4. ADJ. A Uniform approach to inductive p.o. sets and inductive closure in Mathematical Foundations of Computer Science. LNCS 53, Springer 1977. Also appeared in Theoretical Computer Science, 7 (1978) 57–77.

    Article  Google Scholar 

  5. B. Banaschewski and E. Nelson. Completions of Partially Ordered Sets as Reflections. Comp. Sci. Tech. Rep. 79-CS-6, McMaster University, 1979.

    Google Scholar 

  6. Stephen Bloom. Varieties of Ordered Algebras. Journal of Computer and System Sciences 13 (1976) 200–212.

    Article  MathSciNet  MATH  Google Scholar 

  7. Daniel Lehmann. On the algebra of order. Manscript, Mathematics Department, Hebrew University, Jerusalem 1979.

    Google Scholar 

  8. S. Mac Lane. Categories for the Working Mathematician. Springer 1971.

    Google Scholar 

  9. J. Meseguer. On Order-Complete Universal Algebra and Enriched Functorial Semantics in Fundamentals of Computation Theory, L.N.C.S. 56 Springer 1977 294–301.

    Google Scholar 

  10. J. Meseguer. Ideal Monads and Z-P.o. sets. Manuscript, Mathematics Department, University of California at Berkeley.

    Google Scholar 

  11. R. Milne and C. Strachey. A Theory of Programming Language Semantics. Chapman and Hall, London, 1976.

    MATH  Google Scholar 

  12. G. Plotkin. A Powerdomain Construction. SIAM J. Comput. 5 (1976) 452–487.

    Article  MathSciNet  MATH  Google Scholar 

  13. John Reynolds. Notes on a Lattice — Theoretic Approach to the Theory of Computation. Syracuse University, 1972.

    Google Scholar 

  14. John Reynolds. Semantics of the Domain of Flow Diagrams. JACM 24 (1977) 484–503.

    Article  MathSciNet  MATH  Google Scholar 

  15. D. Scott. Outline of a mathematical theory of computation. Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems, 1969 p.169–176.

    Google Scholar 

  16. D. Scott. Lattice Theory, Data Types and Semantics in Formal Semantics of Programming Languages, Courant Computer Science Symposium 2, Sept. 1970. Ed. R. Rustin, Prentice-Hall 1972. 65–106.

    Google Scholar 

  17. D. Scott. Continuous Lattices, LNM volume 274, Springer 1971, 97–136.

    Google Scholar 

  18. D. Scott. The Lattice of Flow Diagrams in Semantics of Algorithmic Languages, LNM 188, Springer 1971, 311–366.

    Google Scholar 

  19. D. Scott. Data Types as Lattices, SIAM J. Comput. 5 (1976) 522–587.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. McMaster University, L8S 4K1, Hamilton, Ontario, Canada

    Evelyn Nelson

Authors
  1. Evelyn Nelson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Banaschewski Rudolf-Eberhard Hoffmann

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Nelson, E. (1981). Z-Continuous algebras. In: Banaschewski, B., Hoffmann, RE. (eds) Continuous Lattices. Lecture Notes in Mathematics, vol 871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0089915

Download citation

  • DOI: https://doi.org/10.1007/BFb0089915

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10848-1

  • Online ISBN: 978-3-540-38755-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation