Compositional pre-processing for automated reasoning in dependent type theory - l'unam - université nantes angers le mans Access content directly
Conference Papers Year : 2023

Compositional pre-processing for automated reasoning in dependent type theory

Abstract

In the context of interactive theorem provers based on a dependent type theory, automation tactics (dedicated decision procedures, call of automated solvers, ...) are often limited to goals which are exactly in some expected logical fragment. This very often prevents users from applying these tactics in other contexts, even similar ones. This paper discusses the design and the implementation of pre-processing operations for automating formal proofs in the Coq proof assistant. It presents the implementation of a wide variety of predictible, atomic goal transformations, which can be composed in various ways to target different backends. A gallery of examples illustrates how it helps to expand significantly the power of automation engines.
Fichier principal
Vignette du fichier
main.pdf (627.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03901019 , version 1 (16-12-2022)
hal-03901019 , version 2 (18-12-2022)
hal-03901019 , version 3 (20-02-2024)

Identifiers

Cite

Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, et al.. Compositional pre-processing for automated reasoning in dependent type theory. CPP 2023 - Certified Programs and Proofs, Jan 2023, Boston, United States. pp.1-15, ⟨10.1145/3573105.3575676⟩. ⟨hal-03901019v3⟩
222 View
186 Download

Altmetric

Share

Gmail Facebook X LinkedIn More