Theoretical Computer Science
A syntactic theory of sequential control
Theoretical Computer Science
Proofs and types
Journal of Information Processing and Cybernetics
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
Lambda-calculus, types and models
Lambda-calculus, types and models
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Free Deduction: An Analysis of "Computations" in Classical Logic
Proceedings of the First Russian Conference on Logic 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
A Symmetric Lambda Calculus for "Classical" Program Extraction
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Completeness of continuation models for λµ-calculus
Information and Computation - Special issue: LICS'97
Continuation models are universal for lambda-mu-calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
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
Reasoning about functional programs and complexity classes associated with type disciplines
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Strong Normalization of Second Order Symmetric Lambda-mu Calculus
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
The calculus of responsibility and commitment
Ludics, dialogue and interaction
Covert movement in logical grammar
Logic and grammar
Hi-index | 0.00 |
We investigate the possibility of giving a computational interpretation of an involutive negation in classical natural deduction. We first show why this cannot be simply achieved by adding ∀∀A = A to typed λ-calculus: the main obstacle is that an involutive negation cannot be a particular case of implication at the computational level. It means that one has to go out typed λ-calculus in order to have a safe computational interpretation of an involutive negation. We then show how to equip λµ-calculus in a natural way with an involutive negation: the abstraction and application associated to negation are simply the operators µ and [] from λµ-calculus. The resulting system is called symmetric λµ-calculus. Finally we give a translation of symmetric λ-calculus in symmetric λµ-calculus, which doesn't make use of the rule of µ-reduction of λµ-calculus (which is precisely the rule which makes the difference between classical and intuitionistic proofs in the context of λµ-calculus). This seems to indicate that an involutive negation generates an original way of computing. Because symmetric λµ-calculus contains both ways, it should be a good framework for further investigations.