Abstract The results presented in this paper were inspired by the work of Smyth, who showed that there is a largest cartesian closed full subcategory inside the category of countably based algebraic cpos with least element, namely the category of profinite domains. Removing the countability condition, we show that there are exactly two maximal cartesian closed full subcategories inside the category of algebraic cpos with least element. One is the natural extension of the class of profinite domains to the uncountable case, the other is a new class of domains, which are characterized by the property that every principal ideal is a complete lattice. The name L- domain is introduced for cpos with this property. Passing to the general situation where no least element is required anymore, we find a pair of categories in place of each the profinite domains and the algebraic L-domains. Thus there are four maximal cartesian closed categories of algebraic cpos in this case. This complete overview over the possible classes of domains allows to prove general theorems about them. This is illustrated by the result that a cpo has an algebraic function space if and only if its space of strict continuous functions is algebraic.
[1]
Thierry Coquand.
Categories of Embeddings
,
1988,
LICS.
[2]
Gordon D. Plotkin,et al.
A Powerdomain Construction
,
1976,
SIAM J. Comput..
[3]
Dana S. Scott,et al.
Lectures on a Mathematical Theory of Computation
,
1982
.
[4]
Achim Jung.
New Results on Hierarchies of Domains
,
1987,
MFPS.
[5]
Michael B. Smyth,et al.
The Largest Cartesian Closed Category of Domains
,
1983,
Theor. Comput. Sci..
[6]
Henk Barendregt,et al.
The Lambda Calculus: Its Syntax and Semantics
,
1985
.