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
Constructive logics: Part I: a tutorial on proof systems and typed &lgr;-calculi
Theoretical Computer Science
Basic proof theory
Term rewriting and all that
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A Computational Interpretation of the lambda-µ-Calculus
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A Symmetric Lambda Calculus for "Classical" Program Extraction
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Program Extraction from Classical Proofs
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Lambda terms for natural deduction, sequent calculus and cut elimination
Journal of Functional Programming
Computation with classical sequents
Mathematical Structures in Computer Science
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
A Logical Interpretation of the λ-Calculus into the η-Calculus, Preserving Spine Reduction and Types
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Strong normalisation for a gentzen-like cut-elimination procedure
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
An isomorphism between cut-elimination procedure and proof reduction
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Negative translations and duality: toward a unified approach
Ludics, dialogue and interaction
On a local-step cut-elimination procedure for the intuitionistic sequent calculus
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Hi-index | 0.00 |
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen's standard cut-reductions, but is less restrictive than previous strongly normalising cut-elimination procedures. In comparison, for example, with works by Dragalin and Danos et al., our procedure requires no special annotations on formulae and allows cut-rules to pass over other cut-rules. In order to adapt the notion of symmetric reducibility candidates for proving the strong normalisation property, we introduce a novel term assignment for sequent proofs of classical logic and formalise cut-reductions as term rewriting rules.