Advertisement

Comparing categories of domains

  • Carl A. Gunter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 239)

Abstract

We discuss some of the reasons for the proliferation of categories of domains suggested for the mathematical foundations of the Scott-Strachey theory of programming semantics. Five general conditions are presented which such a category should satisfy and they are used to motivate a number of examples. An attempt is made to survey some of the methods whereby these examples may be compared and their relationships expressed. We also ask a few mathematical questions about the examples.

Keywords

Inverse Limit Denotational Semantic Continuous Functor Algebraic Lattice Lambda Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Arbib, M. and Manes, E. G., Structures and Functors: the Categorical Imperative. Academic Press, 1975, 185 pp.Google Scholar
  2. [2]
    Coppo, M., Dezani, M. and Longo, G., Applicative information systems. In: Trees in Algebra and Programming, L'Aquila, edited by G. Ausiello and M. Protasi. Lecture Notes in Computer Science, vol. 159, Springer-Verlag, 1983, pp. 35–64.Google Scholar
  3. [3]
    Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M. and Scott, D. S., A Compendium of Continuous Lattices. Springer-Verlag, 1981, 371 pp.Google Scholar
  4. [4]
    Gunter, C., Profinite Solutions for Recursive Domain Equations. Doctoral Dissertation, University of Wisconsin, Madison, 1985, 181 pp.Google Scholar
  5. [5]
    Herrlich, H. and Strecker, G., Category Theory. Allyn and Bacon Inc., 1973, 400 pp.Google Scholar
  6. [6]
    Kamimura, T. and Tang, A., Finitely continuous posets. To appear in Theoretical Computer Science, 1985.Google Scholar
  7. [7]
    Kanda, A., Fully effective solutions of recursive domain equations. In: MFCS 79, edited by J. Bečvař. Lecture Notes in Computer Science, vol. 74, Springer-Verlag, 1979.Google Scholar
  8. [8]
    Kanda, A., Effective Solutions of Recursive Domain Equations, Doctoral Dissertation, Warwick University, 1980.Google Scholar
  9. [9]
    Koymans, C. P. J., Models of the labda calculus. Information and Control, vol. 52, 1982, pp. 306–332.Google Scholar
  10. [10]
    Lambek J., From lambda-calculus to cartesian closed categories. In: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, edited by J. P. Seldin and R. Hindley. Academic Press, 1980, pp. 375–402.Google Scholar
  11. [11]
    Lehmann, D. J., and Smyth M. B., Algebraic specification of data types: a synthetic approach. Mathematical Systems Theory, vol. 14, 1981, pp. 97–139.Google Scholar
  12. [12]
    Longo, G. and Moggi, E., Cartesian closed categories of enumerations for effective type structures (parts I and II). In: Semantics of Data Types, Sophia-Antipolis, edited by G. Kahn and G. D. Plotkin. Lecture Notes in Computer Science, vol. 173, Springer-Verlag, 1984, pp. 235–256.Google Scholar
  13. [13]
    MacLane, S., Categories for the Working Mathematician. Springer-Verlag, 1971, 262 pp.Google Scholar
  14. [14]
    McCarty, D., Realizability and Recursive Mathematics. Doctoral Dissertation, Merton College, Oxford, 1984, 281 pp.Google Scholar
  15. [15]
    Plotkin, G. D., A powerdomain construction. SIAM Journal of Computing, vol. 5, 1976, pp. 452–487.Google Scholar
  16. [16]
    Plotkin, G. D., The category of complete partial orders: a tool for making meanings. In: Proceedings of the Summer School on foundations of Artificial Intelligence and Computer Science, Instituto di Scienze dell'Informazione, University di Pisa, 1978.Google Scholar
  17. [17]
    Plotkin, G. D., T w as a universal domain. Journal of Computer System Sciences, vol. 17, 1978, pp. 209–236.Google Scholar
  18. [18]
    Scott, D. S., Continuous lattices. In: Toposes, Algebraic Geometry and Logic, edited by F. W. Lawvere. Lecture Notes in Mathematics, vol. 274, Springer-Verlag, 1972, pp. 97–136.Google Scholar
  19. [19]
    Scott, D.S., Data types as lattices. SIAM Journal of Computing, vol. 5, 1976, pp. 522–587.Google Scholar
  20. [20]
    Scott, D. S., Relating theories of the λ-calculus. In: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, edited by J. P. Seldin and R. Hindley. Academic Press, 1980, pp. 403–450.Google Scholar
  21. [21]
    Scott, D. S., Lectures on a mathematical theory of computation. Technical Report, no. PRG-19, Oxford University Computing Laboratory, 1981, 148 pp.Google Scholar
  22. [22]
    Scott, D. S., Some ordered sets in computer science. In: Ordered Sets, Banff, Canada, edited by I. Rival. D. Reidel Publishing Company, 1981, pp. 677–718.Google Scholar
  23. [23]
    Scott, D. S., Domains for denotational semantics. In: ICALP 82, Aarhus, Denmark, edited by M. Nielsen and E. M. Schmidt. Lecture Notes in Computer Science, vol. 140, Springer-Verlag, 1982, pp. 577–613.Google Scholar
  24. [24]
    Scott, D. S., and Strachey, C., Toward a mathematical semantics for computer languages. Technical Report, no. PRG-6, Oxford University Computing Laboratory, 1971.Google Scholar
  25. [25]
    Smyth, M. B., Effectively given domains. Theoretical Computer Science vol. 5, 1977, pp. 257–274.Google Scholar
  26. [26]
    Smyth, M. B., Powerdomains. Journal of Computer System Sciences, vol. 16, 1978, pp. 23–36.Google Scholar
  27. [27]
    Smyth, M. B., The largest cartesian closed category of domains. Theoretical Computer Science, vol. 27, 1983, pp 109–119.Google Scholar
  28. [28]
    Smyth, M. B., Powerdomains and predicate transformers: a topological view. In: ICALP 83, edited by J. Diaz. Lecture Notes in Computer Science, vol. 154, Springer-Verlag, 1983, pp. 662–676.Google Scholar
  29. [29]
    Smyth, M. B. and Plotkin, G. D., The category-theoretic solution of recursive domain equations. SIAM Journal of Computing, vol. 11, 1982, pp. 761–783.Google Scholar
  30. [30]
    Stoy, J. E., Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. M.I.T. Press, 1977, 414 pp.Google Scholar
  31. [31]
    Wand, M., Fixed point constructions in order-enriched categories. Theoretical Computer Scence, vol. 26, 1983, pp. 131–147.Google Scholar
  32. [32]
    Weihrauch, K. and Deil, T., Berechenbarkeit auf cpo's. Technical Report no. 63, RWTH, Aachen, 1980, 101 pp.Google Scholar
  33. [33]
    Winskel, G. and Larsen, K., Using information systems to solve recursive domain equations effectively. In: Semantics of Data Types, Sophia-Antipolis, edited by G. Kahn and G. D. Plotkin. Lecture Notes in Computer Science, vol. 173, Springer-Verlag, 1984, pp. 109–130.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Carl A. Gunter
    • 1
  1. 1.Department of Computer ScienceCarnegie-Mellon UniversityPittsburgh

Personalised recommendations