Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.
As for the sea rule, by Lemma D.20 it suffices to prove that (b, e/v.alt)is a /v.alt-crumble, knowing that the other transition rules cannot be applied
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.