The extensional ordering of the sequential functionals

DOI10.1016/j.apal.2011.06.013zbMath1247.03095MaRDI QIDQ764278

Dag Normann, Vladimir Yu. Sazonov

Publication date: 13 March 2012

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.2011.06.013

zbMATH Keywords

discontinuity; finite sequential procedure; fully abstract model; sequential functional

Mathematics Subject Classification ID

03D65: Higher-type and set recursion theory

Related Items

Unnamed Item, On naturally continuous non-dcpo domains, The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$

Cites Work

• Unnamed Item
• Unnamed Item
• Expressibility of functionals in D. Scott's LCF language
• Operational domain theory and topology of sequential programming languages
• Natural non-dcpo domains and f-spaces
• Computations in higher types
• 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
• Recursive Functionals and Quantifiers of Finite Types I
• Domain-Theoretic Foundations of Functional Programming
• Inductive Definition and Domain Theoretic Properties of Fully Abstract
• On sequential functionals of type 3
• Finitary PCF is not decidable