Dedekind completion as a method for constructing new Scott domains

DOI10.1016/S1571-0661(04)00310-XMaRDI QIDQ2841264zbMATH OpenFDO

Authors Klaus Grue

Publication date 24 July 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(04)00310-X

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Continuous lattices and posets, applications (06B35)

Recommendations

• Continuous and completely distributive lattices
• Algebraic specifications for domain theory
• scientific article; zbMATH DE number 1775339
• A constructive theory of continuous domains suitable for implementation
• scientific article; zbMATH DE number 956838

Cites work

• \(\kappa\)-continuous lattices and comprehension principles for Frege structures
• A -denotational semantics for map theory in ZFC+SI
• A type-free system extending (ZFC)
• scientific article; zbMATH DE number 3858394 (Why is no real title available?)
• scientific article; zbMATH DE number 46869 (Why is no real title available?)
• scientific article; zbMATH DE number 482822 (Why is no real title available?)
• scientific article; zbMATH DE number 1984518 (Why is no real title available?)
• scientific article; zbMATH DE number 794258 (Why is no real title available?)
• Map theory
• The lambda calculus, its syntax and semantics
• The system \({\mathcal F}\) of variable types, fifteen years later

Cited in

(2)

• Full abstraction for nominal Scott domains
• The essence of Scott's ``continuous lattices

This page was built for publication: Dedekind completion as a method for constructing new Scott domains

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