Limiting partial combinatory algebras
From MaRDI portal
Publication:1884934
DOI10.1016/S0304-3975(03)00360-8zbMath1088.03012MaRDI QIDQ1884934
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
partial combinatory algebra\(\lambda\mu\)-calculuspartial equivalence relationrealizability interpretationlimiting recursive
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Classical recursion theory. The theory of functions and sets of natural numbers
- Infinite \(\lambda\)-calculus and types
- Infinitary lambda calculus
- Computable structures and the hyperarithmetical hierarchy
- On proof terms and embeddings of classical substructural logics
- Tripos theory
- On the computational content of the axiom of choice
- Classical logic, continuation semantics and abstract machines
- Algebraically Generalized Recursive Function Theory
- Limiting recursion
- Uniformly Reflexive Structures: On the Nature of Godelizations and Relative Computability
This page was built for publication: Limiting partial combinatory algebras