Cartesian Closed Categories of Effective Domains

  • G. Hamrin
  • V. Stoltenberg-Hansen
Part of the NATO Science Series book series (NAII, volume 62)

Abstract

Perhaps the most important and striking fact of domain theory is that important categories of domains are cartesian closed. This means that the category has a terminal object, finite products, and exponents. The only problematic part for domains is the exponent, which in this setting means the space of continuous functions. Cartesian closed categories of domains are well understood and the understanding is in some sense essentially complete by the work of Jung [5], Smyth [11], and others.

Keywords

Nite 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abramsky, Domain theory in logical form, Annals of Pure and Applied Logic 51 (1991), 1 - 77.MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    S. Abramsky and A. Jung, Domain theory, in Handbook of Logic in Computer Science, volume 3, (S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors), Oxford University Press, Oxford, 1995, 1 - 168.Google Scholar
  3. 3.
    J. Blanck, Effective domain representation of ???(X), the space of compact subsets, Theoretical Computer Science 219 (1999), 19 - 48.MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    M. Escardó, PCF extended with real numbers, Theoretical Computer Science 162 (1996), 79 - 115.MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    A. Jung, Cartesian closed categories of algebraic cpo’s, Theoretical Computer Science 70 (1990), 233–250.MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    D. Normann, Computability of the partial continuous functionals, Journal of Symbolic Logic 65 (2000), 1133 - 1142.MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    G. Plotkin, A power domain construction, SIAM Journal on Computing 5 (1976), 452 - 488.MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    G. Plotkin, LCF considered as a programming language, Theoretical Computer Science 5 (1977), 223 - 255.MathSciNetCrossRefGoogle Scholar
  9. 9.
    G. Plotkin, Full abstraction, totality and PCF, Mathematical Structures in Computer Science 9 (1999), 1 - 20.MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    M. B. Smyth, Effectively given domains, Theoretical Computer Science 5 (1977), 257 - 274.MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    M. B. Smyth, The largest cartesian closed category of domains, Theoretical Computer Science 27 (1983), 109 - 119.MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    V. Stoltenberg-Hansen Effective domains and concrete computability: a survey, in F. L. Bauer and R. Steinbrüggen (editors) Foundations of Secure Computation, IOS Press, 2000.Google Scholar
  13. 13.
    V. Stoltenberg-Hansen, I. Lindström and E. R. Griffor, Mathematical Theory of Domains, Cambridge University Press, 1994.MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • G. Hamrin
    • 1
  • V. Stoltenberg-Hansen
    • 1
  1. 1.Department of MathematicsUppsala UniversityUppsalaSweden

Personalised recommendations