zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
The largest Cartesian closed category of domains. (English) Zbl 0556.68017
Most of the studies in semantics of programming languages use ’domains’, i.e. $\omega$-algebraic cpo’s; the corresponding category $\omega$ ACPO should be closed under function-space formation, reasonably. This is not true however. One does obtain Cartesian closure (the technical name of what we want) by considering the category $\omega$ ACPO-CC of consistently complete domains, but now the powerdomain construction takes us outside the category. Plotkin has conjectured that the category SFP which is an extension of consistently complete domains while still a subcategory of that of domains (and which is closed under powerdomain and function-space formation) is the largest category of domains closed under the constructions aforementioned. The paper under review proves this, making extensive use of the set of finite elements of a domain and of the set of minimal bounds of a poset. Finally some extensions are considered in case the notion of ’domain’ is modified either to effectively given domains or to continuous domains: the author conjectures some of the results to be still true.
Reviewer: M.Eytan

68Q99Theory of computing
18D15Closed categories
06B23Complete lattices, completions
Full Text: DOI
[1] Berry, G.: Modéles complètement adéquates et stables des lambda-calculs typés. Thése (1979)
[2] Hennessy, M.; Plotkin, G.: Full abstraction for a simple parallel programming language. Lecture notes in comput. Sci. 74, 108-120 (1979) · Zbl 0457.68006
[3] Markowsky, G.: A motivation and generalization of Scott’s notion of a continuous lattice. Lecture notes in comput. Sci. 871, 298-307 (1981) · Zbl 0472.06008
[4] Markowsky, G.; Rosen, B.: Bases for chain-continuous posets. IBM J. Res. develop 20, 138-147 (1976) · Zbl 0329.06001
[5] Plotkin, G.: A powerdomain construction. SIAM J. Comput. 5, 452-488 (1976) · Zbl 0355.68015
[6] Scott, D.: Cotinuous lattices. Lecture notes in mathematics 274, 97-136 (1971)
[7] Smyth, M. B.: Effectively given domains. Theoret. comput. Sci. 5, 257-274 (1977) · Zbl 0429.03028