Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 0556.68017
Smyth, Michael B.
The largest Cartesian closed category of domains.
(English)
[J] Theor. Comput. Sci. 27, 109-119 (1983). ISSN 0304-3975

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. \par 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.
[M.Eytan]
MSC 2000:
*68Q99 Theory of computing
18D15 Closed categories
06B23 Complete lattices
68Q55 Semantics

Keywords: omega-algebraic cpo; complete partial order; semantics of programming languages; function-space formation; Cartesian closure; consistently complete domains; powerdomain; finite elements of a domain; minimal bounds of a poset; effectively given domains; continuous domains

Cited in: Zbl 1081.18010 Zbl 0701.68074 Zbl 0635.06003 Zbl 0564.03037

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster