Skip to main content

A New Category for Semantics

  • Conference paper
  • First Online:
  • 880 Accesses

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

Abstract

Domain theory for denotational semantics is over thirty years old. There are many variations on the idea and many interesting constructs that have been proposed by many people for realizing a wide variety of types as domains. Generally, the effort has been to create categories of domains that are cartesian closed (that is, have products and function spaces interpreting typed lambda-calculus) and permit solutions to domain equations (that is, interpret recursive domain definitions and perhaps untyped lambda-calculus).

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

References

  1. S. Awodey, A. Bauer. Sheaf Toposes for Realizability. April 2001. Preprint CMU-PHIL-117.

    Google Scholar 

  2. A. Bauer, L. Birkedal, D. S. Scott. Equilogical Spaces. September 1998. Revised February 2001. To appear in Theoretical Computer Science.

    Google Scholar 

  3. A. Bauer The Realizability Approach to Computable Analysis and Topology. Ph.D. Thesis. September 2000.

    Google Scholar 

  4. S. Awodey, J. Hughes. The Coalgebraic Dual of Birkhoff’s Variety Theorem. Preprint. October 2000.

    Google Scholar 

  5. L. Birkedal, J. van Oosten. Relative and Modified Relative Realizability. Preprint 1146, Department of Mathematics, Universiteit Utrecht. March 2000.

    Google Scholar 

  6. A. Bauer, L. Birkedal. Continuous Functionals of Dependent Types and Equilogical Spaces. Proceedings of Computer Science Logic Conference 2000.

    Google Scholar 

  7. S. Awodey, L. Birkedal, D. S. Scott. Local Realizability Toposes and a Modal Logic for Computability. January 2000. To appear in Math. Struct. in Comp. Sci.

    Google Scholar 

  8. L. Birkedal. A General Notion of Realizability. December 1999. Proceedings of LICS 2000.

    Google Scholar 

  9. L. Birkedal. Developing Theories of Types and Computability via Realizability. PhD-thesis. Electronic Notes in Theoretical Computer Science, 34, 2000. Available at http://www.elsevier.nl/locate/entcs/volume34.html. December 1999.

  10. S. Awodey and L. Birkedal. Elementary Axioms for Local Maps of Toposes. Technical Report No. CMU-PHIL103. November 1999. To appear in Journal of Pure and Applied Algebra.

    Google Scholar 

  11. S. Awodey. Topological Representation of the Lambda Calculus. September 1998. Mathematical Structures in Computer Science(2000), vol. 10, pp. 81–96.

    Google Scholar 

  12. L. Birkedal, A. Carboni, G. Rosolini, and D. S. Scott. Type Theory via Exact Categories. LICS 1998. July 1998.

    Google Scholar 

  13. D. S. Scott. A New Category?: Domains, Spaces and Equivalence Relations. Unpublished Manuscript. December 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Scott, D.S. (2001). A New Category for Semantics. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics