Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.
Therefore, the Pointed Crumble GLAM (with its transition function → pCr), the Crumble GLAM (with→ Cr), and the read- back (·)⇓ form an implementation system
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
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.