scientific article; zbMATH DE number 6932687
From MaRDI portal
Publication:4585074
DOI10.23638/LMCS-14(3:8)2018MaRDI QIDQ4585074
Publication date: 6 September 2018
Full work available at URL: https://arxiv.org/abs/1607.04611
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expressibility of functionals in D. Scott's LCF language
- The extensional ordering of the sequential functionals
- The IO- and OI-hierarchies
- LCF considered as a programming language
- Fully abstract models of typed \(\lambda\)-calculi
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- The sequentially realizable functionals
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- On the \(\lambda Y\) calculus
- The expressive power of higher-order types or, life without CONS
- Higher Types, Finite Domains and Resource-bounded Turing Machines
- Strictness of the Collapsible Pushdown Hierarchy
- Higher-Order Computability
- Computability over the partial continuous functionals
- The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$
- Collapsible Pushdown Automata and Recursion Schemes
- Inductive Definition and Domain Theoretic Properties of Fully Abstract
- On the ubiquity of certain total type structures
- Finitary PCF is not decidable
This page was built for publication:
