实现Open Call-by-Value(扩展版)
Implementing Open Call-by-Value (Extended Version)
摘要:
按值调用演算的理论依赖于弱求值和闭项,这是程序设计语言研究中的自然假设。然而,对于模型证明助手,需要强有力的评估和开放的条款。开放式按值调用(Open call-by-value)是带开放项的弱求值的中间设置,在此之上,Grégoire和Leroy设计了Coq的抽象机。本文提出了一种开放式按值调用的抽象机理论。文献中包含的机器要么简单但效率低下,因为它们具有指数开销,要么高效但笨重,因为它们依赖于环境标签和技术优化。我们介绍了一种简单而高效的机器:它不使用标签,并且在双线性开销内实现了开放的按值调用。此外,我们提供了一个新的精细理解不同的优化如何影响开销的复杂性。
英文摘要:
The theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proof assistants, however, strong evaluation and open terms are required. Open call-by-value is the intermediate setting of weak evaluation with open terms, on top of which Grégoire and Leroy designed the abstract machine of Coq. This paper provides a theory of abstract machines for open call-by-value. The literature contains machines that are either simple but inefficient, as they have an exponential overhead, or efficient but heavy, as they rely on a labelling of environments and a technical optimization. We introduce a machine that is simple and efficient: it does not use labels and it implements open call-by-value within a bilinear overhead. Moreover, we provide a new fine understanding of how different optimizations impact on the complexity of the overhead.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。