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: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming
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
The paper develops verified Rocq tactics for string-diagram-based equational reasoning in symmetric monoidal categories via conversion to hypergraphs with interfaces.
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.