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

对称lambda演算强正规化结果的算术证明

Arithmetical proofs of strong normalization results for symmetric lambda calculi

René David, Karim Nour

摘要:

给出了两个对称$λ$ -演算对应于经典逻辑的强正规化的算术证明。第一个是由Curien和Herbelin提出的$\barλμ\tildeμ$ -演算。它通过Curry-Howard对应从Gentzen的经典可编程演算LK导出,以便在“程序”和“上下文”之间以及在“按名称调用”和“按值调用”之间具有对称性。第二种是对称的$λμ$ -演算。它是Parigot引入的$λμ$ -演算,其中加入了约简规则$μ'$,它是$μ$的对称。这些结果是已知的,但是以前的证明使用了约简的候选者,其中类型的解释被定义为某些增算子的不动点,因此是高度非算术的。

英文摘要:

We give arithmetical proofs of the strong normalization of two symmetric $λ$-calculi corresponding to classical logic. The first one is the $\barλμ\tildeμ$-calculus introduced by Curien & Herbelin. It is derived via the Curry-Howard correspondence from Gentzen's classical sequent calculus LK in order to have a symmetry on one side between "program" and "context" and on other side between "call-by-name" and "call-by-value". The second one is the symmetric $λμ$-calculus. It is the $λμ$-calculus introduced by Parigot in which the reduction rule $μ'$, which is the symmetric of $μ$, is added. These results were already known but the previous proofs use candidates of reducibility where the interpretation of a type is defined as the fix point of some increasing operator and thus, are highly non arithmetical.

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

↑