Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.
In: Dastani, M., Sirjani, M
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
A crumbling abstract machine yields a reversible Landauer's embedding for call-by-value lambda calculus with constant space overhead per step.
citing papers explorer
-
Crumbling Abstract Machines
Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.