CONSTRUCTIVE CLASSICAL LOGIC AS CPS-CALCULUS
From MaRDI portal
Publication:5249031
DOI10.1142/S0129054100000065zbMath1320.03063MaRDI QIDQ5249031
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Metamathematics of constructive systems (03F50) Combinatory logic and lambda calculus (03B40)
Cites Work
- Linear logic
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Untersuchungen über das logische Schliessen. I
- A new constructive logic: classic logic
- The correspondence between cut-elimination and normalization
- Normalization as a homomorphic image of cut-elimination
- A new deconstructive logic: linear logic
This page was built for publication: CONSTRUCTIVE CLASSICAL LOGIC AS CPS-CALCULUS