Skip to main content

Metrical and ordered properties of powerdomains

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

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

Included in the following conference series:

  • 112 Accesses

Abstract

Many papers have been devoted to the study of the semantics of nondeterminism and proposed domains inside a powerset P(D) which inherit their properties from the domain D. We try to put together order and metric approaches to powerdomains and prove eventually that both constructions induce in fact the same (metrical) properties in a wide class of SFP structures.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. ARNOLD, M. NIVAT THE METRIC SPACE OF INFINITE TREES; ALGEBRAIC AND TOPOLOGICAL PROPERTIES Annales societatis mathematicae polonae Series IV: Fundamenta Informaticae III-4, 1980, pp. 445–476

    Google Scholar 

  2. S.L. BLOOM, R. TINDELL COMPATIBLE ORDERINGS ON THE METRIC THEORY OF TREES SIAM J. of Computing, Nov. 1980, vol. 9, no 4, pp. 683–691

    Google Scholar 

  3. L. BOASSON, M. NIVAT ADHERENCES OF LANGUAGES JCSS 20, 1980, pp. 285–309

    Google Scholar 

  4. G. COMYN, M. DAUCHET APPROXIMATIONS OF INFINITARY OBJECTS Ninth Colloquium ICALP, Lectures Notes in Computer Science, Springer Verlag, no 140, pp. 116–127

    Google Scholar 

  5. G. COMYN OBJETS INFINIS CALCULABLES Thèse d'Etat, LILLE, Mars 1982

    Google Scholar 

  6. G. GIERZ, K.H. HOFMANN, K. KEIMEL, J.D. LAWSON, M. MISLOVE, D. SCOTT A COMPENDIUM OF CONTINUOUS LATTICES Springer Verlag, 1980.

    Google Scholar 

  7. F. GIRE UNE EXTENSION AUX MOTS INFINIS DE LA NOTION DE TRANSDUCTION RATIONNELLE Colloquium G.I., 1982, pp. 123–139

    Google Scholar 

  8. J.A. GOGUEN, J. THATCHER, E. WAGNER, J. WRIGHT INITIAL ALGEBRA SEMANTICS AND CONTINUOUS ALGEBRAS J.A.C.M., Vol. 24, 1977, pp. 68–95

    Google Scholar 

  9. M. NIVAT INFINITE WORDS, INFINITE TREES, INFINITE COMPUTATIONS Reprint from: Foundations of Computer cience III, Part 2: Languages, logic and semantics. Ed. J.W. BAKKER, J. VAN LEUWEN Mathematical Centre Tract 109 1979, pp. 1–52

    Google Scholar 

  10. G. PLOTKIN Tω AAS A UNIVERSAL DOMAIN JCSS 17, 1978, pp. 209–236

    Google Scholar 

  11. G. PLOTKIN A POWERDOMAIN CONSTRUCTION SIAM J. Comput. 5, Sept. 1976, pp. 452–487

    Article  Google Scholar 

  12. M. SMYTH POWERDOMAINS JCSS 16, 1978, pp. 23–36

    Google Scholar 

  13. M. SMYTH THE LARGEST CARTESIAN CLOSED CATEGORY OF DOMAINS Comp. SCI. Report, Univ. of Edinburgh, March 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tison, S., Dauchet, M., Comyn, G. (1983). Metrical and ordered properties of powerdomains. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_127

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_127

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics