Skip to main content
SpringerLink
Log in

Approximations of infinitary objects

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1982)

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

Included in the following conference series:

Abstract

We compare metric approximations with ordered ones and define on infinitary CPO's a new metric such that both are bijectively related.

We extend this construction to functional spaces and prove that convergence for our metric implies pointwise convergence and uniform convergence for increasing sequences. Finally we prove that decidable elements in infinitary computable CPO's are effective limits of computable Cauchy sequences in recursive metric spaces.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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. G. BIRKOFF LATTICE THEORY 3rd Ed., NEW YORK, 1967

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  3. G. COMYN OBJETS INFINIS CALCULABLES THESE D'ETAT, LILLE, Mars 1982

    Google Scholar 

  4. G. COMYN, M. DAUCHET OBJETS INFINITAIRES — APPROXIMATIONS DANS LES CPO's, ET DANS LES ESPACES METRIQUES Colloque A.F.C.E.T. “LES MATHEMATIQUES DE L'INFORMATIQUE”, 16–18 Mars 1982, PARIS

    Google Scholar 

  5. P.M. COHN UNIVERSAL ALGEBRA Harper and Row, NEW YORK, 1965

    MATH  Google Scholar 

  6. H. EGLI, R. CONSTABLE COMPUTABILITY CONCEPTS FOR PROGRAMMING LANGUAGES TCS 2, 1976, pp. 98–105

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  8. A. KANDA FULLY EFFECTIVE SOLUTIONS Of RECURSIVE DOMAIN EQUATIONS Math. Foundations of Computer Science, 1979, OLOMOUC, Lecture Notes in Computer Science, nℴ 74, pp. 326–336

    Google Scholar 

  9. D. LACOMBE QUELQUES PROCEDES DE DEFINITION EN TOPOLOGIE RECURSIVE Constructivity in Mathematics, Proc. of the Colloquium Held at AMSTERDAM, 1957 Studies in Logic and the foundations of Mathematics, 1959, pp. 129–158

    Google Scholar 

  10. Y. MOSCHOVAKIS RECURSIVE METRIC SPACES Fundamenta Mathematicae, LV, 1964, pp. 215–238

    Article  MathSciNet  Google Scholar 

  11. M. NIVAT INFINITE WORDS, INFINITE TREES, INFINITE COMPUTATIONS Foundations of Computer Science III Part 2: Languages, Logic, Semantics J.W. De Bakker (Ed.), J. Van Leeuwen (Ed.) Mathematical Centre Tract, 1979, pp. 1–52

    Google Scholar 

  12. G. PLOTKIN Tω AS a UNIVERSAL DOMAIN JCSS 17, 1978, pp. 209–236

    MathSciNet  MATH  Google Scholar 

  13. G. PLOTKIN Personal Comunication, LILLE, Mars 1982

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. E. SCIORE, A. TANG COMPUTABILITY THEORY IN ADMISSIBLE DOMAIN Proc. of the 10 th ACM Symp. on the Theory of Computing SAN DIEGO, California, Mai 1978, pp. 95–104

    Google Scholar 

  16. D. SCOTT LATTICE THEORY, DATA TYPES AND SEMANTICS Symposium on formal Semantics of Programming Languages Ed. by RANDALL RUSTIN, Sept. 1970 Prentice Hall, Inc. ENGLEWOOD CLIFFS, New Jersey

    Google Scholar 

  17. M. SMYTH EFFECTIVELY GIVEN DOMAINS Theoretical Computer Science 5, 1977, pp. 257–274

    Article  MathSciNet  Google Scholar 

  18. K. WEIHRAUCH, U. SCHREIBER METRIC SPACES DEFINED BY WEIGHTED ALGEBRAIC CPO's FCT 79, Math. Research, Akademic Verlag, pp. 516–522

    Google Scholar 

  19. G. WERNER REPRESENTATION OF EFFECTIVELY COMPUTABLE LIMITS Technical Report IT, LILLE-I, nℴ IT-3081

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. U.E.R. D'I.E.E.A. - Informatique, Universite de lille-I, 59655, Villeneuve D'ascq Cédex, France

    G. Comyn & M. Dauchet

Authors
  1. G. Comyn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Dauchet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Comyn, G., Dauchet, M. (1982). Approximations of infinitary objects. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012762

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39308-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation