ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science - Special issue on theories of types and proofs
External Rewriting for Skeptical Proof Assistants
Journal of Automated Reasoning
Automated Proof Construction in Type Theory Using Resolution
Journal of Automated Reasoning
Fucusing and Proof-Nets in Linear and Non-commutative Logic
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Proof Normalization for a First-Order Formulation of Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Call-by-value is dual to call-by-name
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Journal of Automated Reasoning
Automation for interactive proof: first prototype
Information and Computation - Special issue: Combining logical systems
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Strong normalisation for a gentzen-like cut-elimination procedure
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Embedding pure type systems in the lambda-pi-calculus modulo
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Automatic combinability of rewriting-based satisfiability procedures
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The language X: circuits, computations and classical logic
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
On the Convergence of Reduction-based and Model-based Methods in Proof Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Types for Proofs and Programs
| Hi-index | 0.00 |
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a systematic, correct and complete way. We prove in detail the strong normalisation of a proof term language that models appropriately superdeduction. We finaly examplify on several examples, including equality and noetherian induction, the usefulness of this approach which is implemented in the lemuridæ system, written in TOM.