一种基于饱和的高阶有理模式合一算法
A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns
AI总结:
针对高阶合一不可判定的问题,本文扩展Miller的高阶模式合一算法至高阶有理项,证明其可判定性及最一般合一子的存在性,并验证了算法的可靠性与完备性。
摘要:
高阶合一已被证明是不可判定的。Miller发现了模式片段,并随后证明高阶模式合一是可判定的且存在最一般合一子。我们将该算法扩展到高阶有理项(又称正则Böhm树,一种循环λ项形式),并证明高阶有理项上的模式合一是可判定的且存在最一般合一子。我们证明了该算法的可靠性和完备性。
英文摘要:
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to higher-order rational terms (a.k.a. regular Böhm trees, a form of cyclic $λ$-terms) and show that pattern unification on higher-order rational terms is decidable and has most general unifiers. We prove the soundness and completeness of the algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。