A syntactic theory of sequential control
Theoretical Computer Science
Proofs and types
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Normalization theorems for full first order classical natural deduction
Journal of Symbolic Logic
Finding computational content in classical proofs
Logical frameworks
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
On the intuitionistic force of classical search
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
TACS '94 Proceedings of the International Conference 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
Extracting Constructive Content from Classical Logic via Control-like Reductions
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Simple Calculus of Exception Handling
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A CPS-Translation of the Lambda-µ-Calculus
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Continuation Semantics in Typed Lambda-Calculi (Summary)
Proceedings of the Conference on Logic of Programs
Strong normalization proofs by CPS-translations
Information Processing Letters
A Semantics of Realisability for the Classical Propositional Natural Deduction
Electronic Notes in Theoretical Computer Science (ENTCS)
The maximum length of mu-reduction in lambda mu-calculus
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
| Hi-index | 0.00 |
We introduce λµ...., an extension of Parigot's λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, λµ.... may be seen as the core of a typed CBN functional language featuring product, coproduct, and control operators.