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
Strong Normalisation of Cut-Elimination in Classical Logic
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
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
Strong normalisation in the π-calculus
Information and Computation
Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Categorical proof theory of classical propositional calculus
Theoretical Computer Science - Logic, language, information and computation
Rewriting Computation and Proof
Completeness and Soundness Results for X with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| 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.