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
fields
cs.LO 2representative 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.
- TensorRocq: Enabling diagrammatic reasoning in Rocq