The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$

DOI10.23638/LMCS-14(1:23)2018zbMath1459.03068arXiv1607.02970MaRDI QIDQ4637682

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)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Expressibility of functionals in D. Scott's LCF language
• The extensional ordering of the sequential functionals
• Fully abstract models of typed \(\lambda\)-calculi
• Concrete domains
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Higher-Order Computability
• On sequential functionals of type 3

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