Case Study: Verified Vampire Proofs in the LambdaPi-calculus Modulo
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918142774607872 |
|---|---|
| author | Komel, Anja Petković Rawson, Michael Suda, Martin |
| author_facet | Komel, Anja Petković Rawson, Michael Suda, Martin |
| contents | The Vampire automated theorem prover is extended to output machine-checkable proofs in the Dedukti concrete syntax for the LambdaPi-calculus modulo. This significantly reduces the trusted computing base, and in principle eases proof reconstruction in other proof-checking systems. Existing theory is adapted to deal with Vampire's internal logic and inference system. Implementation experience is reported, encouraging adoption of verified proofs in other automated systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_15541 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Case Study: Verified Vampire Proofs in the LambdaPi-calculus Modulo Komel, Anja Petković Rawson, Michael Suda, Martin Logic in Computer Science The Vampire automated theorem prover is extended to output machine-checkable proofs in the Dedukti concrete syntax for the LambdaPi-calculus modulo. This significantly reduces the trusted computing base, and in principle eases proof reconstruction in other proof-checking systems. Existing theory is adapted to deal with Vampire's internal logic and inference system. Implementation experience is reported, encouraging adoption of verified proofs in other automated systems. |
| title | Case Study: Verified Vampire Proofs in the LambdaPi-calculus Modulo |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2503.15541 |