一句话:提出无穷 lambda 演算中 Böhm 归约合流性与规范化的新余归纳证明,并在 Coq 中形式化。
本文研究无穷 lambda 演算中 Böhm 归约的合流性与规范化问题。此前该结果的证明较为复杂,作者提出一种新的余归纳证明技术;该技术并非对既有证明的余归纳改写,而是具有独立思路。作者在 Coq 证明助手中将合流性与规范化的证明完整机器化验证。结果表明,该证明比先前证明更简洁,同时展示了余归纳方法在无穷 lambda 演算元理论形式化中的有效性。
We present a new and formal coinductive proof of confluence and normalisation of B\"ohm reduction in infinitary lambda calculus. The proof is simpler than previous proofs of this result. The technique of the proof is new, i.e., it is not merely a coinductive reformulation of any earlier proofs. We formalised the proof in the Coq proof assistant.Comment: arXiv admin note: text overlap with arXiv:1501.04354
DOI 原文 · arXiv · PDF(开放获取) · DBLP
@article{abs-1808-05481,
title = {A new coinductive confluence proof for infinitary lambda calculus},
author = {Łukasz Czajka},
journal = {Logical Methods in Computer Science},
volume = {Volume 16, Issue 1},
year = {2020},
doi = {10.23638/lmcs-16(1:31)2020}
}