A verified theorem prover backend supported by a monotonic library

Vincent Rahli, Liron Cohen, Mark Bickford

Research output: Contribution to journalConference articlepeer-review


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 formal ly 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.

Original languageAmerican English
Pages (from-to)564-582
Number of pages19
JournalEPiC Series in Computing
StatePublished - 1 Jan 2018
Externally publishedYes
Event22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2018 - Awassa, Ethiopia
Duration: 17 Nov 201821 Nov 2018

All Science Journal Classification (ASJC) codes

  • General Computer Science


Dive into the research topics of 'A verified theorem prover backend supported by a monotonic library'. Together they form a unique fingerprint.

Cite this