Proof Search and Proof Check for Equational and Inductive Theorems - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Proof Search and Proof Check for Equational and Inductive Theorems

Résumé

This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the coq proof assistant and the elan rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check.
Fichier principal
Vignette du fichier
Deplagne2003.pdf (305.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00099470 , version 1 (15-02-2024)

Licence

Paternité

Identifiants

Citer

Eric Deplagne, Claude Kirchner, Hélène Kirchner, Quang Huy Nguyen. Proof Search and Proof Check for Equational and Inductive Theorems. Conference on Automated Deduction - CADE-19, Jul 2003, Miami (FL), United States. 20 p, ⟨10.1007/978-3-540-45085-6_26⟩. ⟨inria-00099470⟩
5859 Consultations
3 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More