为 Lambda Mu 添加否定
Adding Negation to Lambda Mu
AI总结:
本文提出 Parigot 的 $λμ$-演算的扩展系统 $\cal L$,通过引入否定类型构造子及相关归约规则,证明了其主语归约、合流性、强可归约性及主类型性质。
摘要:
我们提出了 $\cal L$,它是 Parigot 的 $λμ$-演算的扩展,通过添加否定作为类型构造子,以及表示否定引入和消除的语法构造。我们将定义一个归约概念,通过两条新归约规则扩展 $λμ$ 的归约系统,并证明该系统满足主语归约。使用 Aczel 对 Tait 和 Martin-Löf 的并行归约概念的推广,我们证明该扩展归约是合流的。尽管在表示带有蕴涵和否定的自然演绎中的证明方面,类型指派概念有其局限性,但我们将证明其中所有可证明的命题在 $\cal L$ 中都有见证。使用 Girard 的可还原候选方法,我们证明所有可类型化项都是强可归约的,并通过证明 $\cal L$ 的类型指派具有主类型性质来总结全文。
英文摘要:
We present $\cal L$, an extension of Parigot's $λμ$-calculus by adding negation as a type constructor, together with syntactic constructs that represent negation introduction and elimination. We will define a notion of reduction that extends $λμ$'s reduction system with two new reduction rules, and show that the system satisfies subject reduction. Using Aczel's generalisation of Tait and Martin-Löf's notion of parallel reduction, we show that this extended reduction is confluent. Although the notion of type assignment has its limitations with respect to representation of proofs in natural deduction with implication and negation, we will show that all propositions that can be shown in there have a witness in $\cal L$. Using Girard's approach of reducibility candidates, we show that all typeable terms are strongly normalisable, and conclude the paper by showing that type assignment for $\cal L$ enjoys the principal typing property.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。