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

高阶递归格式中的IO与OI

IO vs OI in Higher-Order Recursion Schemes

Axel Haddad

摘要:

我们提出了一个研究模式的推导高阶递归计划,证明了从计划使用innermost-outermost推导(IO)得到的价值树是相同的,使用无限制的推导。由于高阶递归模式可以作为函数式程序的模型,最内-最外派生策略代表了值评估策略调用的理论观点。

英文摘要:

We propose a study of the modes of derivation of higher-order recursion schemes, proving that value trees obtained from schemes using innermost-outermost derivations (IO) are the same as those obtained using unrestricted derivations. Given that higher-order recursion schemes can be used as a model of functional programs, innermost-outermost derivations policy represents a theoretical view point of call by value evaluation strategy.

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

↑