A general storage theorem for integers in call-by-name \(\lambda\)- calculus
From MaRDI portal
Publication:1329740
DOI10.1016/0304-3975(94)90081-7zbMath0813.03008MaRDI QIDQ1329740
Publication date: 18 May 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90081-7
03B70: Logic in computer science
68N01: General topics in the theory of software
03B40: Combinatory logic and lambda calculus
Related Items
A new deconstructive logic: linear logic, About classical logic and imperative programming, Getting results from programs extracted from classical proofs, Dependent choice, `quote' and the clock, Programs from proofs using classical dependent choice, Relating Classical Realizability and Negative Translation for Existential Witness Extraction
Cites Work
- Opérateurs de mise en mémoire et traduction de Gödel. (Storage operators and Gödel translation)
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Classical logic, storage operators and second-order lambda-calculus
- Lambda-calcul, évaluation paresseuse et mise en mémoire
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item