Abstract
In our previous work (Inform. and Comput., 2005, 202: 87–103), we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This accomplishes the first of a possible, two-step process in solving the problem raised (LNCS, 1991, 530: 16–33; Domains and lambda-calculi, Cambridge Univ. Press, 1998) whether the category of stable bifinite domains of Amadio-Droste-Göbel (LNCS, 1991, 530: 16–33; Theor. Comput. Sci., 1993, 111: 89–101) is the largest cartesian closed full subcategory within the category of ω-algebraic meet-cpos with stable functions. This paper presents the results of the second step, which is to show that for any ω-algebraic meet-cpo D satisfying axioms M and I to be contained in a cartesian closed full sub-category using ω-algebraic meet-cpos with stable functions, it must not violate MI∞. We introduce a new class of domains called weakly distributive domains and show that for these domains to be in a cartesian closed category using ω-algebraic meet-cpos, property MI∞ must not be violated. Further, we demonstrate that principally distributive domains (those for which each principle ideal is distributive) form a proper subclass of weakly distributive domains, and Birkhoff’s M 3 and N 5 (Introduction to Lattices and order, Cambridge Univ. Press, 2002) are weakly distributive (but non-distributive). Then, we establish characterization results for weakly distributive domains. We also introduce the notion of meet-generators in constructing stable functions and show that if an ω-algebraic meet-cpo D contains an infinite number of meet-generators, then [D → D] fails I. However, the original problem of Amadio and Curien remains open.
Similar content being viewed by others
References
Milner R. Fully abstract models of typed λ-calculi. Theoretical Computer Science, 1977, 4: 1–22
Berry G. Modèles complètement adéquats et stables des lambdacalculs typés. Thèse de Doctorat d’Etat, Université Paris VII, 1979
Girard J Y. Linear logic. Theoretical Computer Science, 1987, 50: 1–102
Winskel G. An introduction to event structures. Lecture Notes in Computer Science, 1988, 354: 364–399
Coquand T, Gunter C A, Winskel G. DI-domains as a model of polymorphism. Lecture Notes in Computer Science, 1987, 298: 344–363
Reddy U. Global state considered unnecessary: an introduction to object-based semantics. Higher-Order and Symbolic Computation, 1996, 9: 7–76
Smyth M B. The largest cartesian closed category of domains. Theoretical Computer Science, 1983, 27: 109–120
Zhang G Q. The largest cartesian closed category of stable domains. Theoretical Computer Science, 1996, 166: 203–219
Amadio R M. Bifinite domains: stable case. Lecture Notes in Computer Science, 1991, 530: 16–33
Droste M. On stable domains. Theoretical Computer Science, 1993, 111: 89–101
Plotkin G. A powerdomain construction. SIAM Journal on Computing, 1976, 5: 452–487
Amadio R M, Curien P L. Domains and lambda-calculi. Cambridge: Cambridge University Press, 1998
Zhang G Q, Jiang Y. On a problem of Amadio and Curien: the finite antichain condition. Information and Computation, 2005, 202: 87–103
Jiang Y, Zhang G Q. Weakly distributive domains. In: Proceedings of TLCA. Lecture Notes in Computer Science, 2007, 4583: 194–206
Droste M. Cartesian closed categories of stable domains for polymorphism. Preprint, Universität GHS Essen, 1991
Davey B A, Priestley H A. Introduction to Lattices and Order. Cambridge: Cambridge University Press, 2002
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jiang, Y., Zhang, GQ. Weakly distributive domains (II). Front. Comput. Sc. China 1, 373–384 (2007). https://doi.org/10.1007/s11704-007-0036-x
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11704-007-0036-x