Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Type-Theoretic Approach to Induction with Higher-Order Encodings
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Formalised Cut Admissibility for Display Logic
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Recursion for Higher-Order Encodings
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Termination and Reduction Checking for Higher-Order Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Information and Computation
Handbook of automated reasoning
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
Verifying Termination and Reduction Properties about Higher-Order Logic Programs
Journal of Automated Reasoning
Relating State-Based and Process-Based Concurrency through Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A practical module system for LF
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Generic methods for formalising sequent calculi applied to provability logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
On the specification of sequent systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Modeling datalog fact assertion and retraction in linear logic
Proceedings of the 14th symposium on Principles and practice of declarative programming
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Proceedings of the Fifth Balkan Conference in Informatics
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
| Hi-index | 0.00 |
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. This makes them amenable to elegant and concise implementations in Elf, a constraint logic programming language based on the LF logical framework.