arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.07666cs.LOcs.PL
收藏

Adelfa:一个关于LF规范的推理系统

Adelfa: A System for Reasoning about LF Specifications

Mary Southern, Gopalan Nadathur

摘要:

我们提出了一个系统,称为Adelfa的爱丁堡逻辑框架或LF开发的规格推理提供机械化的支持。Adelfa的基础是一个新的逻辑,名为L_LF。LF中的类型判断由L_LF中的原子公式表示,并且允许对出现在这样的公式中的上下文和术语进行量化。上下文,这构成了类型分配给唯一命名的变量,使用名义常数的技术设备建模,在L_LF的特点是上下文模式,描述其归纳结构。我们提出了这些公式和相关的语义之前,勾勒出一个证明系统,用于构建参数,是健全的语义。然后,我们概述了这个证明系统在Adelfa中的实现,并通过几个示例证明的发展来说明它的使用。最后,我们将Adelfa与现有的LF规范推理系统联系起来。

英文摘要:

We present a system called Adelfa that provides mechanized support for reasoning about specifications developed in the Edinburgh Logical Framework or LF. Underlying Adelfa is a new logic named L_LF. Typing judgements in LF are represented by atomic formulas in L_LF and quantification is permitted over contexts and terms that appear in such formulas. Contexts, which constitute type assignments to uniquely named variables that are modelled using the technical device of nominal constants, are characterized in L_LF by context schemas that describe their inductive structure. We present these formulas and an associated semantics before sketching a proof system for constructing arguments that are sound with respect to the semantics. We then outline the realization of this proof system in Adelfa and illustrate its use through a few example proof developments. We conclude the paper by relating Adelfa to existing systems for reasoning about LF specifications.

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

↑