Proofs for Free in the $\lambda\Pi$-Calculus Modulo Theory
<|reference_start|>Proofs for Free in the $\lambda\Pi$-Calculus Modulo Theory: Parametricity allows the transfer of proofs between different implementations of the same data structure. The lambdaPi-calculus modulo theory is an extension of the lambda-calculus with dependent types and user-defined rewrite rules. It is a logical framework, used to exchange proofs between different proof systems. We define an interpretation of theories of the lambdaPi-calculus modulo theory, inspired by parametricity. Such an interpretation allows to transfer proofs for free between theories that feature the notions of proposition and proof, when the source theory can be embedded into the target theory.<|reference_end|>
@article{traversié2024proofs,
    title={Proofs for Free in the $\lambda\Pi$-Calculus Modulo Theory},
    author={Thomas Traversi'e (MICS, CentraleSup'elec, Universit'e
  Paris-Saclay)},
    journal={EPTCS 404, 2024, pp. 49-63},
    year={2024},
    doi={10.4204/EPTCS.404.4},
    archivePrefix={arXiv},
    eprint={2407.06627},
    primaryClass={cs.LO}
}