Skip to main content
SpringerLink
Log in
Book cover

International Conference on Interactive Theorem Proving

ITP 2014: Interactive Theorem Proving pp 209–225Cite as

Formalized, Effective Domain Theory in Coq

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8558))

Abstract

I present highlights from a formalized development of domain theory in the theorem prover Coq. This is the first development of domain theory that is effective, formalized and that supports all the usual constructions on domains. In particular, I develop constructive models of both the unpointed profinite and the pointed profinite domains. Standard constructions (e.g., products, sums, the function space, and powerdomains) are all developed. In addition, I build the machinery necessary to compute solutions to recursive domain equations.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S.: Domain theory in logical form. Annals of Pure and Applied Logic 51, 1–77 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Abramsky, S., Jung, A.: Domain Theory. In: Handbook of Logic in Computer Science, vol. 3, pp. 1–168. Clarendon Press (1994)

    Google Scholar 

  3. Abramsky, S., Ong, C.-H.L.: Full abstraction in the lazy lambda calculus. Information and Computation 105, 159–267 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Barber, A.: Linear Type Theories, Semantics and Action Calculi. Ph.D. thesis, Edinburgh University (1997)

    Google Scholar 

  5. Barthe, G., Capretta, V.: Setoids in type theory. Journal of Functional Programming 13(2), 261–293 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Benton, N.: A mixed linear and non-linear logic: Proofs, terms and models. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 121–135. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  7. Benton, N., Kennedy, A., Varming, C.: Some domain theory and denotational semantics in Coq. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 115–130. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Birkedal, L., Møgelberg, R., Petersen, R.: Domain-theoretical models of parametric polymorphism. Theoretical Computer Science 288, 152–172 (2007)

    Article  Google Scholar 

  9. Egli, H., Constable, R.L.: Computability concepts for programming language semantics. Theoretical Computer Science 2, 133–145 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fiore, M.P.: Axiomatic Domain Theory in Categories of Partial Maps. Ph.D. thesis, University of Edinburgh (1994)

    Google Scholar 

  11. Freyd, P.: Remarks on algebraically compact categories. In: Applications of Categories in Computers Science. London Mathematical Society Lecture Note Series, vol. 177, pp. 95–106. Cambridge University Press (1991)

    Google Scholar 

  12. Gunter, C.: Profinite Solutions for Recursive Domain Equations. Ph.D. thesis, Carnegie-Mellon University (1985)

    Google Scholar 

  13. Huffman, B.: A purely definitional universal domain. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 260–275. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Jung, A.: Cartesian Closed Categories of Domains. Ph.D. thesis, Centrum voor Wiskunde en Informatica, Amsterdam (1988)

    Google Scholar 

  15. Milner, R.: Logic for computable functions: Description of a machine implementation. Tech. Rep. STAN-CS-72-288, Stanford University (May 1972)

    Google Scholar 

  16. Milner, R.: Models of LCF. Tech. Rep. STAN-CS-73-332, Stanford (1973)

    Google Scholar 

  17. Müller, O., Nipkiw, T., von Oheimb, D., Slotosch, O.: HOLCF = HOL + LCF. Journal of Functional Programming 9 (1999)

    Google Scholar 

  18. Paulin-Mohring, C.: A constructive denotational semantics for Kahn networks. In: From Semantics to Computer Sciences. Essays in Honour of G. Kahn. Cambridge University Press (2009)

    Google Scholar 

  19. Pitts, A.M.: Relational properties of domains. Information and Computation 127 (1996)

    Google Scholar 

  20. Plotkin, G.D.: A powerdomain construction. SIAM J. of Computing 5, 452–487 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  21. Plotkin, G., Smyth, M.: The category theoretic solution of recursive domain equations. Tech. rep., Edinburgh University (1978)

    Google Scholar 

  22. Scott, D.: Outline of a mathematical theory of computation. Tech. Rep. PRG02, OUCL (November 1970)

    Google Scholar 

  23. Taylor, P.: Recursive Domains, Indexed Category Theory and Polymorphism. Ph.D. thesis, University of Cambridge (1986)

    Google Scholar 

  24. Wadler, P.: Theorems for free! In: Intl. Conf. on Functional Programming and Computer Architecture (1989)

    Google Scholar 

  25. Winskell, G.: The Formal Semantics of Programming Languages: An Introduction. MIT Press (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Portland State University, Portland, Oregon, USA

    Robert Dockins

Authors
  1. Robert Dockins
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. NICTA, Sydney, NSW, Australia

    Gerwin Klein

  2. University of Wyoming, Laramie, WY, USA

    Ruben Gamboa

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Dockins, R. (2014). Formalized, Effective Domain Theory in Coq. In: Klein, G., Gamboa, R. (eds) Interactive Theorem Proving. ITP 2014. Lecture Notes in Computer Science, vol 8558. Springer, Cham. https://doi.org/10.1007/978-3-319-08970-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08970-6_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08969-0

  • Online ISBN: 978-3-319-08970-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation