A Verified Theorem Prover Backend Supported by a Monotonic Library
| Autor: | Liron Cohen, Mark Bickford, Vincent Rahli |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer science [C05] [Engineering
computing & technology] Automated theorem proving TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computer science TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Calculus Monotonic function Sciences informatiques [C05] [Ingénierie informatique & technologie] |
| Zdroj: | LPAR LPAR 2018. (2018). |
| ISSN: | 2398-7340 |
| DOI: | 10.29007/f58n |
| Popis: | Building a verified proof assistant entails implementing and mechanizing the concept of a library, as well as adding support for standard manipulations on it. In this work we develop such mechanism for the Nuprl proof assistant, and integrate it into the formalization of Nuprl’s meta-theory in Coq. We formally verify that standard operations on the library preserve its validity. This is a key property for any interactive theorem prover, since it ensures consistency. Some unique features of Nuprl, such as the presence of undefined abstractions, make the proof of this property nontrivial. Thus, e.g., to achieve monotonicity the semantics of sequents had to be refined. On a broader view, this work provides a backend for a verified version of Nuprl. We use it, in turn, to develop a tool that converts proofs exported from the Nuprl proof assistant into proofs in the Coq formalization of Nuprl’s meta-theory, so as to be verified. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|