The largest Cartesian closed category of domains, considered constructively

DOI10.1017/S0960129504004591zbMATH Open1080.03032MaRDI QIDQ4675770

Dieter Spreen

Publication date: 6 May 2005

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

complete partial orderseffectively given domainsconstructive domainsCartesian closed category of domains\(\omega\)-algebraic cpocompleteness testeffective SFP domaineffectively strongly algebraic cpo

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

On the largest Cartesian closed category of stable domains.

This page was built for publication: The largest Cartesian closed category of domains, considered constructively

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675770)