arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.08161cs.LOcs.PL
收藏

按值范式互模拟

Normal Form Bisimulations By Value

Beniamino Accattoli, Adrienne Lancelot, Claudia Faggian

AI总结:

本文提出一种新的按值调用范式互模拟net互模拟,以弥补现有enf互模拟在验证无意义项识别和letexp交换律上的不足,并分析其与Ehrhard关系模型的关系。

摘要:

范式互模拟是一种基于开放项的程序等价性的自然形式,最初由Sangiorgi在按名调用中引入。文献中包含一种针对Plotkin按值调用λ演算的范式互模拟,即Lassen的enf互模拟,它验证了Moggi的所有单子律,并可扩展以验证η。然而,它并未验证其他相关原则,例如无意义项的识别(由Sangiorgi的互模拟验证)或letexp的交换律。这些缺陷源于Plotkin演算中开放项的问题。我们引入了一种新的按值调用范式互模拟,称为net互模拟,它在精神上更接近Sangiorgi的互模拟,并满足上述额外原则。我们在一个为处理按值调用中开放项而设计的现有形式体系之上发展它。结果表明,enf互模拟和net互模拟是不可比较的,因为net互模拟不验证Moggi的律也不验证η。此外,没有简单的方法将它们合并。为了更好地理解这一情况,我们提供了对丰富的按值调用范式互模拟可能范围的分析,并将它们与Ehrhard的关系模型联系起来。

英文摘要:

Normal form bisimilarities are a natural form of program equivalence resting on open terms, first introduced by Sangiorgi in call-by-name. The literature contains a normal form bisimilarity for Plotkin's call-by-value $λ$-calculus, Lassen's \emph{enf bisimilarity}, which validates all of Moggi's monadic laws and can be extended to validate $η$. It does not validate, however, other relevant principles, such as the identification of meaningless terms -- validated instead by Sangiorgi's bisimilarity -- or the commutation of $\letexp$s. These shortcomings are due to issues with open terms of Plotkin's calculus. We introduce a new call-by-value normal form bisimilarity, deemed \emph{net bisimilarity}, closer in spirit to Sangiorgi's and satisfying the additional principles. We develop it on top of an existing formalism designed for dealing with open terms in call-by-value. It turns out that enf and net bisimilarities are \emph{incomparable}, as net bisimilarity does not validate Moggi's laws nor $η$. Moreover, there is no easy way to merge them. To better understand the situation, we provide an analysis of the rich range of possible call-by-value normal form bisimilarities, relating them to Ehrhard's relational model.

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

↑