Classical By-Need
Abstract elided by the publisher.
Related papers
- Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus APLAS 2021
- Compositional semantics for composable continuations: from abortive to delimited control ICFP 2014
- Possibilities and Limitations of Call-by-Need Space Improvement ICFP 2001
- Lazy Evaluation for the Lazy: Automatically Transforming Call-by-Value into Call-by-Need CC 2023
- Formalizing the One-Way to Hiding Theorem CPP 2025
- Optimizing synthesis with metasketches POPL 2016
- Maximal Static Expansion POPL 1998
- AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs TACAS 2025