The extensional ordering of the sequential functionals

DOI10.1016/J.APAL.2011.06.013MaRDI QIDQ764278zbMATH OpenOpenAlexFDO

Authors 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

discontinuityfinite sequential procedurefully abstract modelsequential functional

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Recommendations

• scientific article; zbMATH DE number 4143905
• Sequential order of compact sequential spaces
• On the functor of order-preserving functionals
• The sequentially realizable functionals
• On the order structure of representable functionals
• Sequentiality in an extensional framework
• Extension of positive functionals on certain ordered spaces
• On sequential separability of functional spaces
• scientific article; zbMATH DE number 1330540
• scientific article; zbMATH DE number 2234966

Cites work

• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Computable functionals of finite types
• Computations in higher types
• Domain-Theoretic Foundations of Functional Programming
• Expressibility of functionals in D. Scott's LCF language
• Finitary PCF is not decidable
• Full abstraction for PCF
• Fully abstract models of typed \(\lambda\)-calculi
• scientific article; zbMATH DE number 3532921 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• Inductive Definition and Domain Theoretic Properties of Fully Abstract
• LCF considered as a programming language
• Natural non-dcpo domains and f-spaces
• On full abstraction for PCF: I, II and III
• On sequential functionals of type 3
• Operational domain theory and topology of sequential programming languages
• Recursive Functionals and Quantifiers of Finite Types I

Cited in

(8)

• The sequentially realizable functionals
• The recursion hierarchy for PCF is strict
• On naturally continuous non-dcpo domains
• The sequential functionals of type \((\iota \rightarrow \iota)^n \rightarrow \iota\) form a \textit{dcpo} for all \(n \in \mathbb N\)
• scientific article; zbMATH DE number 2182492 (Why is no real title available?)
• scientific article; zbMATH DE number 1405588 (Why is no real title available?)
• scientific article; zbMATH DE number 5066509 (Why is no real title available?)
• On sequential functionals of type 3

This page was built for publication: The extensional ordering of the sequential functionals

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