On Natural Non-dcpo Domains

DOI10.1007/978-3-540-78127-1_34zbMath1133.68373OpenAlexW1528598939MaRDI QIDQ5452201

Vladimir Yu. Sazonov

Publication date: 25 March 2008

Published in: Pillars of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78127-1_34

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• Unnamed Item
• Expressibility of functionals in D. Scott's LCF language
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Computable functionals of finite types
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Inductive Definition and Domain Theoretic Properties of Fully Abstract
• On sequential functionals of type 3

This page was built for publication: On Natural Non-dcpo Domains