Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus Modulo Theory

Abstract

The $\lambda$$\Pi$-calculus modulo theory is a logical framework in which various logics and type systems can be encoded, thus helping the cross-verification and interoperability of proof systems based on those logics and type systems. In this paper, we show how to encode predicate subtyping and proof irrelevance, two important features of the PVS proof assistant. We prove that this encoding is correct and that encoded proofs can be mechanically checked by Dedukti, a type checker for the $\lambda$$\Pi$-calculus modulo theory using rewriting.