The sequential functionals of type ( )^n form a \textit{dcpo} for all n N

DOI10.23638/LMCS-14(1:23)2018MaRDI QIDQ4637682zbMATH OpenFDO

Authors Dag Normann

Publication date 25 April 2018

Full work available at URL https://arxiv.org/abs/1607.02970

zbMATH Keywords

sequential proceduresequential functionaldirected complete partial ordering

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Higher-type and set recursion theory (03D65)

Abstract: We prove that the sequential functionals of some fixed types at type level 2, taking finite sequences of unary functions as arguments, do form a directed complete partial ordering. This gives a full characterisation of for which types the partially ordered set of sequential functionals has this property. As a tool, we prove a normal form theorem for the finite sequential functionals of the types in question,

Recommendations

• The extensional ordering of the sequential functionals
• The sequentially realizable functionals
• Sequentiality in an extensional framework
• On sequential functionals of type 3
• Publication:4938567

Cites work

• scientific article; zbMATH DE number 1499102 (Why is no real title available?)
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Concrete domains
• Expressibility of functionals in D. Scott's LCF language
• Full abstraction for PCF
• Fully abstract models of typed \(\lambda\)-calculi
• Higher-order computability
• On full abstraction for PCF: I, II and III
• On sequential functionals of type 3
• The extensional ordering of the sequential functionals

Cited in

(2)

• The sequentially realizable functionals
• The recursion hierarchy for PCF is strict

This page was built for publication: The sequential functionals of type \((\iota \rightarrow \iota)^n \rightarrow \iota\) form a \textit{dcpo} for all \(n \in \mathbb N\)

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