On the Computational Representation of Classical Logical Connectives
From MaRDI portal
Publication:2864215
DOI10.1016/j.entcs.2006.12.039zbMath1277.03030OpenAlexW1998178168MaRDI QIDQ2864215
Alexander J. Summers, Jayshan Raghunandan
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.12.039
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Untersuchungen über das logische Schliessen. I
- The duality of computation
- Jumbo λ-Calculus
- Proof Nets for Classical Logic
- A Formulae-as-Types Interpretation of Subtractive Logic
- Call-by-value is dual to call-by-name
- Theoretical Computer Science
- Programming Languages and Systems
This page was built for publication: On the Computational Representation of Classical Logical Connectives