Abstract
In this paper we address the problem of solving recursive domain equations using uncountable limits of domains. These arise for instance, when dealing with the ω 1-continuous function-space constructor and are used in the (generative) denotational semantics of programming languages which feature non-deterministic fair constructs implemented with unbounded choice. It is well known that such features cannot be modeled using just Scott-continuous functions; they can be modeled conveniently, instead, using functions which satisfy the weaker continuity property of ω 1-continuity. Surprisingly, the category of cpo’s and ω 1-continuous embeddings is not ω 0-cocomplete. Hence the standard technique of Adámek and Koubek for solving reflexive domain equations involving these constructs fails. This phenomenon was not noticed before in the literature. We discuss two alternative methods that can be used to solve the required domain equations. The first one is an application of the method of Adámek and Koubek to a different category. The second one, instead, is a genuine extension of their method and amounts to considering cones instead of limits. We put both methods on solid categorical grounds and discuss some applications. Finally we utilise the second method in order to give a model for the untyped λ-calculus whose theory is precisely the λβη theory. Thus we show that ω 1-lambda models are complete for the λβη-calculus.
Work partially supported by MURST 40% & 60% grants, by EEC/HCM Network “Lambda Calcul Typé”, by EEC Science Research Project MASK and by an SERC Senior Fellowship.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adámek, J., Koubek, V., Least Fixed-Point of a Functor, Journal of Computer and System Sciences Vol.19, No. 2, 1979, 163–178.
Apt, K.R., Plotkin, G.D., Countable Non-Determinism and Random Assignment, Journal of the ACM Vol.33, No. 4, 1986, 724–767.
Costa G., Metric characterisation of fair computations in CCS, Lecture Notes in Computer Science, Vol.186, Springer-Verlag, Berlin/New York, 1985, 239–251.
Chandra, A.K., Computable Non-Deterministic Functions, in “Proceedings. 19th Annual Symposium on Mathematical Foundations of Computer Science”. IEEE, New York, 1978, 127–131.
Dijkstra, E.W., A Discipline of Programming, Prentice-Hall, Englewood Cliffs, New York, 1976.
Park, D., On the Semantics of Fair Parallelism, in “Proceedings. Winter School on Formal Software Specification”, Lecture Notes in Computer Science, Vol. 86, Springer-Verlag, Berlin/New York, 1980, 504–526.
Plotkin, G.D., A Powerdomain Construction, SIAM J. Comput. Vol.5, No. 3, 1976, 452–487.
Plotkin, G.D., A Powerdomain for Countable Non-Determinism, in “Proceedings. 9th ICALP”, M. Nielsen and E.M. Schmidt Eds., Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, Berlin/New York, 1982, 418–428.
Ronchi della Rocca, S., Honsell, F., An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus, Journal of Computer and System Sciences Vol. 45, No. 1, 1992, 49–75.
Smyth, M.B., Plotkin, G.D., The Category-Theoretic Solution of Recursive Domain Equations, SIAM J. Comput. Vol.11, No. 4, 1982, 761–783.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gianantonio, P., Honsell, F., Liani, S., Plotkin, G.D. (1994). Countable Non-Determinism and Uncountable Limits. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-48654-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive