Adequate and Computational Encodings in the Logical Framework Dedukti - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Adequate and Computational Encodings in the Logical Framework Dedukti

Abstract

Dedukti is a very expressive logical framework which unlike most frameworks, such as the Edinburgh Logical Framework (LF), allows for the representation of computation alongside deduction. However, unlike LF encodings, Dedukti encodings proposed until now do not feature an adequacy theoremi.e., a bijection between terms in the encoded system and in its encoding. Moreover, many of them also do not have a conservativity result, which compromises the ability of Dedukti to check proofs written in such encodings. We propose a different approach for Dedukti encodings which do not only allow for simpler conservativity proofs, but which also restore the adequacy of encodings. More precisely, we propose in this work adequate (and thus conservative) encodings for Functional Pure Type Systems. However, in contrast with LF encodings, ours is computational-that is, represents computation directly as computation. Therefore, our work is the first to present and prove correct an approach allowing for encodings that are both adequate and computational in Dedukti.
Fichier principal
Vignette du fichier
LIPIcs-FSCD-2022-25.pdf (925.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03956666 , version 1 (25-01-2023)

Identifiers

Cite

Thiago Felicissimo. Adequate and Computational Encodings in the Logical Framework Dedukti. FSCD 2022 - 7th International Conference on Formal Structures for Computation and Deduction, Aug 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.25⟩. ⟨hal-03956666⟩
28 View
10 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More