The approximation theorem for the Λμ-calculus
From MaRDI portal
Publication:5268997
DOI10.1017/S0960129515000286zbMath1423.03052MaRDI QIDQ5268997
Publication date: 14 June 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
03B40: Combinatory logic and lambda calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Domain theory in logical form
- λμ-calculus and Böhm's theorem
- Approximation Theorems for Intersection Type Systems
- Typing streams in the Λμ-calculus
- A Filter Model for the λμ-Calculus
- An approach to call-by-name delimited continuations
- A filter lambda model and the completeness of type assignment
- On the Relations between the Syntactic Theories of λμ-Calculi
- A Hierarchy for Delimited Continuations in Call-by-Name
- Standardization and Böhm Trees for Λμ-Calculus
- Classical logic, continuation semantics and abstract machines