A crumbling abstract machine yields a reversible Landauer's embedding for call-by-value lambda calculus with constant space overhead per step.
In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A Reversible Crumbling Abstract Machine for Plotkin's Call-by-Value
A crumbling abstract machine yields a reversible Landauer's embedding for call-by-value lambda calculus with constant space overhead per step.