| ||||||||||||||||||||
![]() |
||||||||||||||||||||
[Bur13] A Shallow Embedding of Resolution and Superposition Proofs into the λΠ-Calculus ModuloConférences Internationales sans actes : Third International Workshop on Proof Exchange for Theorem Proving, Lake Placid, USA,Mots clés: automatic theorem provers, interoperability, rewriting, proof checking
Résumé:
The λΠ-calculus modulo is a proof language that has been proposed as a proof standard for (re-)checking and interoperability. Resolution and superposition are proof-search methods that are used in state-of-the-art first-order automated theorem provers. We provide a shallow embedding of resolution and superposition proofs in the λΠ-calculus modulo, thus offering a way to check these proofs in a trusted setting, and to combine them with other proofs. We implement this embedding as a backend of the prover iProver Modulo.
Equipe:
sys
BibTeX
|
||||||||||||||||||||