Hostname: page-component-89b8bd64d-9prln Total loading time: 0 Render date: 2026-05-09T09:23:22.639Z Has data issue: false hasContentIssue false
  • English
  • Français

Building domains from graph models

Published online by Cambridge University Press:  04 March 2009

Wesley Phoa
Wesley Phoa
Affiliation:
Laboratory for the Foundations of Computer Science, James Clerk Maxwell Building, The kins's Buildings, Edinburgh EH9 3JZ, Scotland
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we study partial equivalence relations (PERs) over graph models of the λcalculus. We define categories of PERs that behave like predomains, and like domains. These categories are small and complete; so we can solve domain equations and construct polymorphic types inside them. Upper, lower and convex powerdomain constructions are also available, as well as interpretations of subtyping and bounded quantification. Rather than performing explicit calculations with PERs, we work inside the appropriate realizability topos: this is a model of constructive set theory in which PERs, can be regarded simply as special kinds of sets. In this framework, most of the definitions and proofs become quite smple and attractives. They illustrative some general technicques in ‘synthetic domain theory’ that rely heavily on category theory; using these methods, we can obtain quite powerful results about classes of PERs, even when we know very little about their internal structure.

Information

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 2 , Issue 3 , September 1992 , pp. 277 - 299
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

Abadi, M. and Plotkin, G. (1990) A PER model of polymorphism and recursive types. In: proc. of 5th Annual Symposium on Logic in Computer Science.Google Scholar
Barendregt, H.P. (1984) The Lambda-Calculus: Its Syntax and Semantics (revised edition), North-Holland.Google Scholar
Beeson, M. (1985) Foundations of Constructive Mathematics, Springer.CrossRefGoogle Scholar
Freyd, P., Mulry, P., Rosolini, G. and Scott, D.S. (1990) Extensional PERs. In: Proc. of 5th Annual Symposium on Logic in Computer Science.Google Scholar
Hyland, J. M. E. (1982) The effective topos. In: The L. E. J. Brouwer Centenary Symposium (eds. S., Troelstra A.van Dalen, D.), North-Holland.Google Scholar
Hyland, J. M. E. (1988) A small complete category, Annuals of Pure and Applied Logic 40 135–165.CrossRefGoogle Scholar
Hyland, J. M. E. (to appear) First steps towards synthetic domain theory. In: Category Theory Proceedings, Como 1990 (eds. Carboni, A., Pedicchio, M. C. and Rosolini, G.), Springer LNCS 1488.Google Scholar
Hyland, J. M. E. and Pitts, A. M. (1989) The theory of Constructions, categorical semantics and topos-theoretic models. In: Categories in Computer Science and Logic (Proc. Boulder 1987). Contemp. Math. 92 137–199.Google Scholar
Hyland, J. M. E.Robinson, E. P. and Rosolini, G. (1990) The discrete objects in the effective topos, Proc. Lond. Math. Soc. (3) 60, 1–36.Google Scholar
Johnstone, P. T. (1977) Topos Theory, Academic Press.Google Scholar
Longo, G. and Moggi, E. (1990) Constructive natural deduction and its “ω-set” interpretation, LIENS-90–21, 10 1990; to appear in Math. Structure in Comp. Science.Google Scholar
Phoa, W. K.-S. (1990b) Domain Theory in Realizability Toposes, Thesis, University of Cambridge; available as CST-82–91/ECS-LFCS-91–171, Department of Computer Science, University of Edinburgh.Google Scholar
phoa, W. K.-S. (1990c) Reflectivity for categories of synthetic domains, draft.Google Scholar
phoa, W. K.-S. (in preparation a )From term models to domains. In: The proceedings of Theoretical Aspects of Computer Software (sendai, 1991), Springer Lecture Notes in Computer Science 526; final version, submitted.Google Scholar
phoa, W. K.-S. (1991) Two results on set-theoretic polymorphism. In: The Proceedings of Category Theory and Computer Science (Paris, 1991), Springer Lecture Notes in Computer Science.Google Scholar
phoa, W. K.-S. (submitted 1991) Using fibrations to understand subtypes, to appear in Proc. of the Durham Symposum on Applications of Category Theory to Computer Science, London Mathematical Society.Google Scholar
phoa, W. K.-S. (in preparation b) PCF and the untyped λ-calculus.Google Scholar
phoa, W. K.-S. and Taylor, P. (preprint) The synthetic Plotkin Powerdomain.Google Scholar
plotkin, G. D. and Smyth, M. B. (1982) The category-theoretic solution of recursive domain equations, SIAM J. Comput. 11 (4).Google Scholar
Robinson, E. (1989) How complete is PER? In: Proc. of 4th Annual Symposium on Logic in Computer Science.Google Scholar
Rosolini, G. (1987) Categories and effective computations. In: Lecture Notes in Computer Science 283, Springer.Google Scholar
Rosolini, G. (to appear) About modest sets.Google Scholar
Scott, D. S. (1976) Date types as lattices, SIAM Journal of Computing 5 (3), 522–587.CrossRefGoogle Scholar
Taylor, P. (1991) The fixed point property in synthetic domain theory. In: Proc. of 6th Annual Symposim on Logic in Computer Science.Google Scholar