Crumbling Abstract Machines
Crumbling Abstract Machines
复制标题
摇摇欲坠的抽象机器
DOI:
10.1145/3354166.3354169
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
Accattoli B
中科院分区:
文献类型:
--
作者:
Accattoli B
Extending the λ-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the case where applications have only values as immediate subterms.This work studies how such a crumbled representation of terms impacts on the design and the efficiency of abstract machines for call-by-value evaluation. About the design, it removes the need for data structures encoding the evaluation context, such as the applicative stack and the dump, that get encoded in the environment. About efficiency, we show that there is no slowdown, clarifying in particular a point raised by Kennedy, about the potential inefficiency of such a representation.Moreover, we prove that everything smoothly scales up to the delicate case of open terms, needed to implement proof assistants. Along the way, we also point out that continuation-passing style transformations--that may be alternatives to our representation--do not scale up to the open case.
登录
查看更多内容
DOI:
10.1051/ita:1999130
发表时间:
1999
期刊:
RAIRO Theor. Informatics Appl.
影响因子:
--
作者:
Luca Paolini;S. D. Rocca
通讯作者:
S. D. Rocca
DOI:
--
发表时间:
1994
期刊:
ACM-SIGACT Symposium on Principles of Programming Languages
影响因子:
--
作者:
J. Hatcliff;O. Danvy
通讯作者:
O. Danvy
DOI:
--
发表时间:
2005
期刊:
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
影响因子:
--
作者:
Søren B. Lassen
通讯作者:
Søren B. Lassen
DOI:
--
发表时间:
2012
期刊:
International Conference on Rewriting Techniques and Applications
影响因子:
--
作者:
Beniamino Accattoli
通讯作者:
Beniamino Accattoli
DOI:
10.1007/978-3-662-44145-9_3
发表时间:
2014
期刊:
J. ACM
影响因子:
--
作者:
Beniamino Accattoli;C. Coen
通讯作者:
C. Coen