The recursion hierarchy for PCF is strict
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3983152 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1342245 (Why is no real title available?)
- scientific article; zbMATH DE number 1984266 (Why is no real title available?)
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Collapsible pushdown automata and recursion schemes
- Computability over the partial continuous functionals
- 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
- Higher types, finite domains and resource-bounded Turing machines
- Higher-order computability
- Inductive Definition and Domain Theoretic Properties of Fully Abstract
- LCF considered as a programming language
- On full abstraction for PCF: I, II and III
- On the \(\lambda Y\) calculus
- On the ubiquity of certain total type structures
- Strictness of the collapsible pushdown hierarchy
- The IO- and OI-hierarchies
- The expressive power of higher-order types or, life without CONS
- The extensional ordering of the sequential functionals
- The sequential functionals of type \((\iota \rightarrow \iota)^n \rightarrow \iota\) form a \textit{dcpo} for all \(n \in \mathbb N\)
- The sequentially realizable functionals
This page was built for publication: The recursion hierarchy for PCF is strict
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4585074)
