Abstract
Synthetic Domain Theory (SDT) is a constructive variant of Domain Theory where all functions are continuous following Dana Scott′s idea of “domains as sets”. Recently there have been suggested more abstract axiomatizations encompassing alternative notions of domain theory as, for example, stable domain theory.
In this article a logical and axiomatic version of SDT capturing the essence of Domain Theory à la Scott is presented. It is based on a sufficiently expressive version of constructive type theory and fully implemented in the proof checker Lego. On top of this “core SDT” denotational semantics and program verification can be – and in fact has been – developed in a purely formal machine-checked way.
The version of SDT we have chosen for this purpose is based on work by Reus and Streicher and can be regarded as an axiomatization of complete extensional PERs. This approach is a modification of Phoa′s complete Σ-spaces and uses axioms introduced by Taylor.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agerholm, S. (1994): A HOL Basis for Reasoning about Functional Programs, Ph.D. Thesis, BRICS, University of Aarhus. Also available as BRICS report RS-94-44.
Bailey, A. (1998): The Machine-Checked Literate Formalisation of Algebra in Type Theory, Ph.D. Thesis, University of Manchester.
Burstall, R. and McKinna, J. (1992): Deliverables: A categorical approach to program development in type theory, Technical Report ECS-LFCS-92-242, Edinburgh University.
Fiore, M. and Plotkin, G. (1994): An axiomatisation of computationally adequate domain theoretic models of FPC, in Proc. 9th Logic in Computer Science, Washington, pp. 92-102.
Fiore, M. and Rosolini, G. (1998): Domains in H. To appear in TCS.
Freyd, P. (1991): Algebraically complete categories, in A. Carboni, M. Pedicchio, and G. Rosolini (eds.), Proceedings of the 1990 Como Category Theory Conference, Lecture Notes in Math. 1488. Berlin, pp. 95-104.
Freyd, P., Mulry, P., Rosolini, G. and Scott, D. (1992): Extensional PERs, Informat. and Comput. 98, 211-227.
Gunter, C. and Scott, D. (1990): Semantic domains, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Chapt. 12, Elsevier Science Publisher, pp. 635-674.
Hyland, J. (1991): First steps in synthetic domain theory, in A. Carboni, M. Pedicchio, and G. Rosolini (eds.), Proceedings of the 1990 Como Category Theory Conference, Lecture Notes in Math. 1488. Berlin, pp. 131-156.
Hyland, J. M. E. and Moggi, E. (1995): The S-replete construction, in CTCS 1995, LNCS 953.
Kock, A. (1981): Synthetic Differential Geometry, Cambridge University Press.
Lambek, J. and Scott, P. (1980): Introduction to Higher Order Categorical Logic, Cambridge Studies in Adv. Math. 7, Cambridge University Press.
Longley, J. (1994): Realizability Toposes and Language Semantics, Ph.D. Thesis, University of Edinburgh.
Longley, J. and Simpson, A. (1997): A uniform approach to domain theory in realizability models, MSCS 7(5), 453-468. Special edition of MSCS for the Workshop on Logic, Domains and Programming Languages, Darmstadt, Germany.
Luo, Z. (1990): An Extended Calculus of Constructions, Ph.D. Thesis, University of Edinburgh. Available as report ECS-LFCS-90-118.
Luo, Z. (1994): Computation and Reasoning - A Type Theory for Computer Science, Monographs on Comput. Sci. 11, Oxford University Press.
Luo, Z. (1999): Coercive subtyping, J. Logic Comput. 9(1).
Luo, Z. and Pollack, R. (1992): LEGO Proof Development System: User's Manual, Technical Report ECS-LFCS-92-211, Edinburgh University.
Paulson, L. (1987): Logic and Computation, Cambridge Tracts in Theoret. Comput. Sci. 2, Cambridge University Press.
Phoa, W. (1990): Domain Theory in Realizability Toposes, Ph.D. Thesis, University of Cambridge. Also available as report ECS-LFCS-91-171, University of Edinburgh.
Pollack, R. (1994): The Theory of LEGO - A Proof Checker for the Extended Calculus of Constructions, Ph.D. Thesis, University of Edinburgh.
Regensburger, F. (1994): HOLCF: Eine konservative Erweiterung von HOL um LCF, Ph.D. Thesis, Technische Universität München.
Reus, B. (1995): Program Verification in Synthetic Domain Theory, Ph.D. Thesis, Ludwig-Maximilians-Universität München, Shaker Verlag, Aachen, 1996.
Reus, B. (1996): Synthetic domain theory in type theory: another logic of computable functions, in J. von Wright, J. Grundy, and J. Harrison (eds.), Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs'96, Lecture Notes in Comput. Sci. 1125, pp. 363-381.
Reus, B. (1999): Extensional ∑-spaces in type theory, Appl. Cat. Structures 7, 159-183.
Reus, B. and Streicher, T. (1993a): Naive synthetic domain theory - A logical approach, Draft.
Reus, B. and Streicher, T. (1993b): Verifying properties of module construction in type theory, in A. Borzyszkowski and S. Sokolowski (eds.), MFCS'93, Lecture Notes in Comput. Sci. 711, pp. 660-670.
Reus, B. and Streicher, T. (1999): General synthetic domain theory - A logical approach, Math. Struct. in Comput. Sci. 9, 177-223.
Rogers, H. (1967): Theory of Recursive Functions and Effective Computability, McGraw-Hill.
Rosolini, G. (1986): Continuity and effectiveness in topoi, Ph.D. Thesis, University of Oxford.
Rosolini, G. (1995): Notes on synthetic domain theory, draft.
Simpson, A. (1995): Private communication.
Simpson, A. (1996): Domain theory in intuitionistic set theory, draft.
Taylor, P. (1991): The fixed point property in synthetic domain theory, in 6th Symp. on Logic in Computer Science, Washington, pp. 152-160.
Taylor, P. (1993): Synthetic domain theory notes, draft.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Reus, B. Formalizing Synthetic Domain Theory. Journal of Automated Reasoning 23, 411–444 (1999). https://doi.org/10.1023/A:1006258506401
Issue Date:
DOI: https://doi.org/10.1023/A:1006258506401