A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
"Classical" Programming-with-Proofs in lambdaPASym: An Analysis of Non-confluence
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
About Translations of Classical Logic into Polarized Linear Logic
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Proceedings of ACM conference on Proving assertions about programs
Extracting constructive content from classical proofs
Extracting constructive content from classical proofs
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
On one-pass CPS transformations
Journal of Functional Programming
| Hi-index | 0.00 |
We address two related topics concerning recent developments of constructive classical logic. The first topic concerns the well known relationships that negative translation (a.k.a. CPS translation) establishes between classical and intuitionistic logic. We examine why they fail to give us a clear and complete picture of constructive classical logic. Secondly, we analyze some recently developed classical calculi which shed new light on negative translation and its connections with the concept of syntactical duality.