Deriving proved equality tests in Coq-elpi: Stronger induction principles for containers in Coq - Archive ouverte HAL Access content directly
Conference Papers Year :

Deriving proved equality tests in Coq-elpi: Stronger induction principles for containers in Coq

(1, 2, 3)
1
2
3

Abstract

We describe a procedure to derive equality tests and their correctness proofs from inductive type declarations. Programs and proofs are derived compositionally, reusing code and proofs derived previously. The key steps are two. First, we design appropriate induction principles for data types defined using parametric containers. Second, we develop a technique to work around the modularity limitations imposed by the purely syntactic termination check Coq performs on recursive proofs. The unary parametricity translation of inductive data types turns out to be the key to both steps. Last but not least, we provide an implementation of the procedure for the Coq proof assistant based on the Elpi [3] extension language.
Fichier principal
Vignette du fichier
induction.pdf (174.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01897468 , version 1 (17-10-2018)
hal-01897468 , version 2 (08-04-2019)

Identifiers

Cite

Enrico Tassi. Deriving proved equality tests in Coq-elpi: Stronger induction principles for containers in Coq. ITP 2019 - 10th International Conference on Interactive Theorem Proving, Sep 2019, Portland, United States. ⟨10.4230/LIPIcs.CVIT.2016.23⟩. ⟨hal-01897468v2⟩
638 View
811 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More