Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Mathematical Foundations of Programming Semantics

MFPS 1987: Mathematical Foundations of Programming Language Semantics pp 289–302Cite as

Topological completeness in an ideal model for polymorphic types

  • Part III Domain Theory
  • Conference paper
  • First Online:

  • 170 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 298))

Abstract

We have a look at the topological structure underlying the ideal model of recursive polymorphic types proposed by MacQueen, Plotkin and Sethi. We show that their central argument in establishing a well defined semantical function, viz., completeness with respect to a metric obtained from the construction of their domain, is a special case of complete uniformities which arise in a natural way from the study of closeness of ideals on domains. These uniformities are constructed and studied, and a general fixed — point theorem is derived for maps defined on these ideals.

This work has been partially supported by the ESPRIT project SED, project number 1227 (1271), funded in part by the European Community

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Bakker, J. W., Kok, J. N.: Towards a Uniform Topological Treatment of Streams and Functions on Streams. In W. Brauer (Ed.): Proc. 12th ICALP. Lecture Notes in Computer Science 194, Springer — Verlag, 1985, 140–148

    Google Scholar 

  2. Castaing, C., Valadier, M.: Convex Analysis and Measurable Multifunctions. Lecture Notes in Mathematics 580, Springer–Verlag, Berlin, 1977

    Google Scholar 

  3. Hewitt, E., Stromberg, K.: Real and Abstract Analysis. Springer — Verlag, Berlin, 1969

    Google Scholar 

  4. Kelly, J.L.: General Topology. Van Nostrand Reinhold, New York, 1955

    Google Scholar 

  5. Landes, Th.: The Banach Fixed Point Principle in Uniform Spaces. Preprint, Department of Economics, University of Paderborn, Sept. 1986

    Google Scholar 

  6. MacQueen, D., Plotkin, G., Sethi, R.: An Ideal Model for Recursive Polymorphic Types. Expanded Version (presented in condensed form at the 11th Ann. ACM Symp. Princ. Progr. Lang., Salt Lake City, UT, 1984)

    Google Scholar 

  7. Stoy, J. E.: Denotational Semantics: The Scott — Strachey Approach to Programming Language Theory. MIT Press, Cambridge MA, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Hildesheim, D - 3200, Hildesheim, West Germany

    Ernst-Erich Doberkat

Authors
  1. Ernst-Erich Doberkat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Main A. Melton M. Mislove D. Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Doberkat, EE. (1988). Topological completeness in an ideal model for polymorphic types. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Language Semantics. MFPS 1987. Lecture Notes in Computer Science, vol 298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19020-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-19020-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19020-2

  • Online ISBN: 978-3-540-38920-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation