Natural non-dcpo domains and f-spaces

DOI10.1016/j.apal.2008.09.027zbMath1168.06004OpenAlexW2091935350MaRDI QIDQ1023300

Vladimir Yu. Sazonov

Publication date: 11 June 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.09.027

zbMATH Keywords

full abstractiondomain theorysequentialityScott domainsdcpo and non-dcpo domainsf-spaces

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Higher-type and set recursion theory (03D65)

Related Items

On naturally continuous non-dcpo domains ⋮ The extensional ordering of the sequential functionals

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Relative regular closedness and \(\pi\)-valuations
• 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
• Finitary PCF is not decidable