Two categories of effective continuous cpos

DOI10.1016/j.tcs.2006.07.049zbMath1110.03029OpenAlexW2072645462MaRDI QIDQ854182

G. Hamrin, Viggo Stoltenberg-Hansen

Publication date: 7 December 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.049

zbMATH Keywords

domain theoryeffective domainsCartesian closureeffective continuous complete partial orders

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)

A Cartesian closed category of domains with almost algebraic bases

Cites Work

• Domain representability of metric spaces
• The theory of A-spaces
• Computability concepts for programming language semantics
• Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Computable functionals of finite types
• Complete local rings as domains
• Theorie der Numerierungen I
• Bases for Chain-complete Posets
• Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two categories of effective continuous cpos