Abstract
Let B be the closed term model of the λ-calculus in which terms with the same Böhm tree are identified. We investigate which partial equivalence relations (PERs) on B can be regarded as predomains or domains. Working inside the realizability topos on B, such PERs can be regarded simply as sets in a particular model of constructive set theory.
No well-behaved partial order has been identified for any class of PERs; but it is still possible to isolate those PERs which have ‘suprema of chains’ in a certain sense, and all maps between such PERs in the model preserve such suprema of chains. One can also define what it means for such a PER to have a ‘bottom’; partial function spaces provide an example. For these PERs, fixed points of arbitrary endofunctions exist and are computed by the fixed point combinator y. There is also a notion of meet-closure for which all maps are stable.
The categories of predomains are closed under the formation of total and partial function spaces, polymorphic types and convex powerdomains. (Subtyping and bounded quantification can also be modelled.) They in fact form reflective subcategories of the realizability topos; and in this set-theoretic context, these constructions are very simple to describe.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, G. Plotkin: A PER model of polymorphism and recursive types, in: Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.
H. P. Barendregt: The Lambda-Calculus: Its Syntax and Semantics (revised edition), North-Holland, 1984.
M. Beeson: Foundations of Constructive Mathematics, Springer, 1985.
T. Coquand, G. Huet: Constructions: a higher-order proof system for mechanizing mathematics, in: EUROCAL '85: European Conference on Computer Algebra, Springer, 1985.
P. Freyd, P. Mulry, G. Rosolini, D.S. Scott: Extensional PERs, in: Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.
J.M.E. Hyland: The effective topos, in: The L.E.J. Brouwer Centenary Symposium (ed. A. S. Troelstra, D. van Dalen), North-Holland, 1982.
J.M.E. Hyland: A small complete category, Annals of Pure and Applied Logic 40 (1988) 135–165.
J.M.E. Hyland: Synthetic domains—the story so far, Abstracts EACTS, 1990.
J.M.E. Hyland, A.M. Pitts: The theory of constructions, categorical semantics and topos-theoretic models, in Categories in Computer Science and Logic (Proc. Boulder 1987), Contemp. Math. 92 (1989) 137–199.
J.M.E. Hyland, E.P. Robinson, G. Rosolini: The discrete objects in the effective topos, Proc. Lond. Math. Soc. (3) 60 (1990) 1–36.
P. T. Johnstone: Topos Theory, Academic Press, 1977.
W. K.-S. Phoa: Effective domains and intrinsic structure, in: Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.
W. K.-S. Phoa: Building domains from models of computation, submitted.
W. K.-S. Phoa: Domain Theory in Realizability Toposes, Ph.D. dissertation, University of Cambridge, November 1990.
W. K.-S. Phoa: Reflectivity for categories of synthetic domains, submitted, 1990.
W. K.-S. Phoa: Two results on set-theoretic polymorphism, submitted, 1991.
W. K.-S. Phoa, P. Taylor: The synthetic Plotkin powerdomain, preprint.
G. D. Plotkin, M. B. Smyth: The category-theoretic solution of recursive domain equations, Siam Journal of Computing vol. 11 no. 4, 1982.
E. Robinson: How complete is PER? in: Proc. of 4th Annual Symposium on Logic in Computer Science, 1989.
G. Rosolini: Categories and effective computations, in: Lecture Notes in Computer Science 283, Springer, 1987.
D.S. Scott: Data types as lattices, SIAM J. Comput. 5 (3) (1976) 522–587.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Phoa, W. (1991). From term models to domains. In: Ito, T., Meyer, A.R. (eds) Theoretical Aspects of Computer Software. TACS 1991. Lecture Notes in Computer Science, vol 526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54415-1_42
Download citation
DOI: https://doi.org/10.1007/3-540-54415-1_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54415-9
Online ISBN: 978-3-540-47617-7
eBook Packages: Springer Book Archive