Principles of superdeduction

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 41-50

  Brauner, Paul ^a   Houtmann, Clément ^b   Kirchner, Claude ^a  

^a LORIA   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHRISTIANS; CLASSICAL SEQUENT CALCULUS; CUT-ELIMINATION PROCEDURE; DEDUCTION MODULO; DEDUCTION RULE; DEDUCTION SYSTEMS; FORMAL FOUNDATION; NATURAL DEDUCTION; NORMALISATION; PREDICATE LOGIC; PROOF ASSISTANT; SEQUENT CALCULUS;

CALCULATIONS; COMPUTER SCIENCE; DIFFERENTIATION (CALCULUS); THEOREM PROVING;

FORMAL LOGIC;

EID: 82755165862     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.37     Document Type: Conference Paper

References (27)

1. J.-M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297-347, 1992.
2. E. Balland, P. Brauner, R. Kopetz, P.-E. Moreau, and A. Reilles. Tom: Piggybacking rewriting on java. In Proceedings of RTA, 2007. To appear.
3. M. Bezem, D. Hendriks, and H. de Nivelle. Automated proof construction in type theory using resolution. Journal of Automated Reasoning, 29(3-4):253-275, 2002.
4. P. Brauner, G. Dowek, and B. Wack. Normalization in supernatural deduction and in deduction modulo. Available on the author's webpage, 2007.
5. P. Brauner, C. Houtmann, and C. Kirchner. Superdeduction at work. Technical report, INRIA Lorraine, 2007. Available at http://hal.inria.fr/inria- 00141672.
6. G. Burel. Unbounded proof-length speed-up in deduction modulo. Technical report, INRIA Lorraine, 2007. Available at http://hal.inria.fr/inria-00138195.
7. H. Cirstea and C. Kirchner. The rewriting calculus - Part I and II. Logic Journal of the Interest Group in Pure and Applied Logics, 9(3):427-498, May 2001.
8. H. Cirstea, L. Liquori, and B. Wack. Rewriting calculus with fixpoints: Untyped and first-order systems. In Proceedings of TYPES, volume 3085 of LNCS. Springer, 2003.
9. D. Cousineau and G. Dowek. Embedding pure type systems in the λΠ-calculus modulo. In Proceedings of TLCA, 2007.
10. P.-L. Curien and H. Herbelin. The duality of computation. In Proceedings of ICFP '00, pages 233-243, New York, NY, USA, 2000. ACM Press.
11. G. Dowek. Proof normalization for a first-order formulation of higher-order logic. In E. Gunter and A. Felty, editors, Proceedings of TPHOL, volume 1275 of LNCS, pages 105-119. Springer, 1997.
12. G. Dowek, T. Hardin, and C. Kirchner. Theorem proving modulo. Journal of Automated Reasoning, 31(1):33-72, Nov 2003.
13. G. Dowek and A. Miquel. Cut elimination for Zermelo's set theory. Available on author's web page.
14. G. Dowek and B. Werner. Proof normalization modulo. Journal of Symbolic Logic, 68(4):1289-1316, 2003. (Pubitemid 38033378)
15. G. Dowek and B. Werner. Arithmetic as a theory modulo. In J. Giesl, editor, Proceedings of RTA'05, volume 3467 of LNCS, pages 423-437. Springer, 2005. (Pubitemid 41313373)
16. L. Hallnäs and P. Schroeder-Heister. A proof-theoretic approach to logic programming. II. programs as definitions. Journal of Logic and Computation, 1(5):635-660, 1991.
17. X. Huang. Reconstruction proofs at the assertion level. In Proceedings of CADE, volume 814 of LNCS, pages 738-752. Springer, 1994.
18. R. McDowell and D. Miller. Cut-elimination for a logic with definitions and induction. Theoretical Computer Science, 232(1-2):91-119, 2000.
19. Q.-H. Nguyen, C. Kirchner, and H. Kirchner. External rewriting for skeptical proof assistants. Journal of Automated Reasoning, 29(3-4):309-336, 2002.
20. M. Parigot. Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In A. Voronkov, editor, Logic Programming and Automated Reasoning, Springer, pages 190 - 201, St Petersburg, Russia, 1992.
21. D. Prawitz. Natural Deduction. A Proof-Theoretical Study, volume 3 of Stockholm Studies in Philosophy. Almqvist & Wiksell, Stockholm, 1965.
22. V. Prevosto. Certified mathematical hierarchies: the focal system. In Mathematics, Algorithms, Proofs, Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2005.
23. C. Urban. Strong normalisation for a Gentzen-like cutelimination procedure. In Proceedings of TLCA, pages 415-430, 2001. (Pubitemid 33275743)
24. C. Urban and G. M. Bierman. Strong normalisation of cut-elimination in classical logic. Fundam. Inform., 45(1-2):123-155, 2001. (Pubitemid 33592930)
25. S. van Bakel, S. Lengrand, and P. Lescanne. The language X: circuits, computations and classical logic. In M. Coppo, E. Lodi, and G. M. Pinna, editors, Proceedings of ICTCS'05, volume 3701 of LNCS, pages 81-96. Springer, 2005.
26. E. Visser and Z.-e.-A. Benaissa. A core language for rewriting. In C. Kirchner and H. Kirchner, editors, Proceedings of WRLA, volume 15 of ENTCS. Elsevier, sep 1998.
27. B. Wack. Typage et déduction dans le calcul de réécriture. PhD thesis, Université Henri Poincaré, Nancy 1, October 2005.