arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1101.4929cs.LOmath.CT
收藏

高阶递归格式的语义

Semantics of Higher-Order Recursion Schemes

Jiri Adamek, Stefan Milius, Jiri Velebil

摘要:

高阶递归格式是递归方程,它从给定的称为“终端”的操作定义新的操作。每个这样的递归方案都被证明在每个斯科特的λ-演算模型中具有最少解释的语义,其中终端被解释为连续操作。对于基于无限λ-项的不可解释语义,我们遵循Fiore,Plotkin和Turi的思想,在上下文中的集合范畴中工作,它是有限集合范畴上的预层。Fiore等人展示了如何通过内函子Hλ来捕获λ-演算中变量绑定的类型,并且他们通过证明λ-项的预层是初始Hλ-幺半群来解释λ-项的同时替换。这里我们研究有理无限λ-项的预层,并证明这是一个初始迭代Hλ-幺半群。我们的结论是,每一个守卫高阶递归计划有一个唯一的未解释的解决方案在这个幺半群。

英文摘要:

Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of λ-calculus in which the terminals are interpreted as continuous operations. For the uninterpreted semantics based on infinite λ-terms we follow the idea of Fiore, Plotkin and Turi and work in the category of sets in context, which are presheaves on the category of finite sets. Fiore et al showed how to capture the type of variable binding in λ-calculus by an endofunctor Hλand they explained simultaneous substitution of λ-terms by proving that the presheaf of λ-terms is an initial Hλ-monoid. Here we work with the presheaf of rational infinite λ-terms and prove that this is an initial iterative Hλ-monoid. We conclude that every guarded higher-order recursion scheme has a unique uninterpreted solution in this monoid.

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

↑