arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.02883cs.LO
收藏

在逻辑框架Dedukti中的适当和计算编码

Adequate and computational encodings in the logical framework Dedukti

Thiago Felicissimo

摘要:

Dedukti是一个非常有表现力的逻辑框架,与大多数框架不同,如爱丁堡逻辑框架(LF),它允许在演绎的同时表示计算。然而,与LF编码不同,到目前为止提出的Dedukti编码没有充分性定理-即,编码系统中的项与其编码中的项之间的双射。此外,它们中的许多也没有保守性结果,这损害了Dedukti检查以这种编码编写的证明的能力。我们提出了一种不同的方法Dedukti编码,不仅允许更简单的保守性证明,但也恢复编码的充分性。更确切地说,我们在这项工作中提出了足够的(因此保守的)编码功能纯类型系统。然而,与LF编码相比,我们的编码是计算性的--也就是说,直接将计算表示为计算。因此,我们的工作是第一个提出并证明正确的方法,允许在Dedukti中进行充分和计算的编码。

英文摘要:

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 theorem -- i.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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑