Reflecting proofs in first-order logic with equality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3632 LNAI, Issue , 2005, Pages 7-22

  Contejean, Evelyne ^a   Corbineau, Pierre ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; BENCHMARKING; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FORMAL LOGIC; INFORMATION SCIENCE;

AUTOMATED THEOREM PROVER; FIRST-ORDER MULTI-SORTED LOGIC; PROOF ASSISTANTS;

THEOREM PROVING;

EID: 26944483502     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11532231_2     Document Type: Conference Paper

References (17)

1. C. Alvarado. Réflexion pour la réécriture dans le calcul des constructions inductives. PhD thesis, Université Paris-Sud, Dec. 2002.
2. L. Bachmair, N. Dershowitz, and D. A. Plaisted. Completion without failure. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures 2: Rewriting Techniques, chapter 1, pages 1-30. Academic Press, New York, 1989.
3. M. Bezem, D. Hendriks, and H. de Nivelle. Automated proof construction in type theory using resolution. Journal of Automated Reasoning, 29(3):253-275, 2002.
4. E. Contejean, C. Marché, and X. Urbain. CiME3, 2004. http://cime.lri.fr/.
5. P. Corbineau. First-order reasoning in the Calculus of Inductive Constructions. In S. Berardi, M. Coppo, and F. Damiani, editors, TYPES 2003: Types for Proofs and Programs, volume 3085 of LNCS, pages 162-177, Torino, Italy, Apr. 2004. Springer-Verlag.
6. P. Crégut. Une procédure de décision reflexive pour l'arithmétique de Presburger en Coq. Deliverable, Projet RNRT Calife, 2001.
7. N. G. de Bruijn. Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Proc. of the Koninklijke Nederlands Akademie, 75(5):380-392, 1972.
8. R. Dyckhoff. Contraction-free sequent calculi for intuitionistic logic. The Journal of Symbolic Logic, 57(3):795-807, 1992.
9. B. Grégoire and X. Leroy. A compiled implementation of strong reduction. In International Conference on Functional Programming 2002, pages 235-246. ACM Press, 2002.
10. J. Harrison. Metatheory and reflection in theorem proving: A survey and critique. Technical Report CRC-053, SRI Cambridge, Millers Yard, Cambridge, UK, 1995.
11. D. Hendriks. Proof Reflection in Coq. Journal of Automated Reasoning, 29(3-4):277-307, 2002.
12. T Hillenbrand and B. Löchner. The next Waldmeister loop. In A. Voronkov, editor, Proceedings of CADE 18, LNAI, pages 486-500. Springer-Verlag, 2002.
13. J. Hsiang and M. Rusinowitch. On word problems in equational theories. In T. Ottmann, editor, 14th International Colloquium on Automata, Languages and Programming, volume 267 of LNCS, pages 54-71, Karlsruhe, Germany, July 1987. Springer-Verlag.
14. Q.-H. Nguyen. Certifying Term Rewriting Proofs in ELAN. In M. van den Brand and R. Verma, editors, Proceedings of the International Workshop RULE'01, volume 59 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001.
15. G. E. Peterson. A technique for establishing completeness results in theorem proving with equality. SIAM Journal on Computing, 12(1):82-100, Feb. 1983.
16. G. Sutcliffe and C. Suttner. The TPTP Problem Library: CNF Release vl.2.1. Journal of Automated Reasoning, 21(2): 177-203, 1998.
17. The Coq Development Team. The Coq Proof Assistant Reference Manual - Version V8.0, Apr. 2004. http://coq.inria.fr.