Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Defines a new call-by-silly calculus mirroring call-by-need, proves it shares contextual equivalence with call-by-value, and shows its strategy computes maximal-length sequences via multi types and rewriting.
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.
-
Mirroring Call-by-Need, or Values Acting Silly
Defines a new call-by-silly calculus mirroring call-by-need, proves it shares contextual equivalence with call-by-value, and shows its strategy computes maximal-length sequences via multi types and rewriting.