A general storage theorem for integers in call-by-name \(\lambda\)- calculus

DOI10.1016/0304-3975(94)90081-7zbMath0813.03008OpenAlexW2085642842MaRDI QIDQ1329740

Jean-Louis Krivine

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

zbMATH Keywords

imperative programmingstorage operatorscall-by-name \(\lambda\)-calculusGödel's translation

Mathematics Subject Classification ID

Logic in computer science (03B70) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items

Getting results from programs extracted from classical proofs, Dependent choice, `quote' and the clock, Ordered combinatory algebras and realizability, A new deconstructive logic: linear logic, Programs from proofs using classical dependent choice, Call-By-Push-Value from a Linear Logic Point of View, Relating Classical Realizability and Negative Translation for Existential Witness Extraction, About classical logic and imperative programming

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