A Diamond Machine for Strong Evaluation
Abstract elided by the publisher.
Related papers
- Diamonds Are a Girl's Best Friend: Partial Order Reduction for Timed Automata with Abstractions CAV 2014
- CZ: multiple inheritance without diamonds OOPSLA 2009
- A Strong Distillery APLAS 2015
- A simple and efficient implementation of strong call by need by an abstract machine JFP 2026
- A simple and efficient implementation of strong call by need by an abstract machine ICFP 2022
- Gleipnir: toward practical error analysis for Quantum programs PLDI 2021
- An Abstract Machine for Strong Call by Value APLAS 2020
- Diamonds are not forever: liveness in reactive programming with guarded recursion POPL 2021