Modular pre-processing for automated reasoning in dependent type theory

04/06/2022

∙

by   Valentin Blot, et al.

∙

Inria

∙

Laboratoire de Recherche en Informatique (LRI)

∙

mee.com

∙

0

∙

share

The power of modern automated theorem provers can be put at the service of interactive theorem proving. But this requires in particular bridging the expressivity gap between the logics these provers are respectively based on. This paper presents the implementation of a modular suite of pre-processing transformations, which incrementally bring certain formulas expressed in the Calculus of Inductive Constructions closer to the first-order logic of Satifiability Modulo Theory solvers. These transformations address issues related to the axiomatization of inductive types, to polymorphic definitions or to the different implementations of a same theory signature. This suite is implemented as a plugin for the Coq proof assistant, and integrated to the SMTCoq toolchain.