Dedekind completion as a method for constructing new Scott domains

DOI10.1016/S1571-0661(04)00310-XzbMath1268.03018MaRDI QIDQ2841264

Klaus Grue

Publication date: 24 July 2013

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The system \({\mathcal F}\) of variable types, fifteen years later
• \(\kappa\)-continuous lattices and comprehension principles for Frege structures
• A type-free system extending (ZFC)
• The lambda calculus, its syntax and semantics
• Map theory
• A \(\kappa\)-denotational semantics for map theory in ZFC+SI

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