Principles of Inverse Computation in a Functional Language
No abstract available.
Related papers
- Haskell⁻¹: automatic function inversion in Haskell Haskell 2021
- A functional proof pearl: inverting the Ackermann hierarchy CPP 2020
- Unscanning by Möbius Inversion (Functional Pearl) ICFP 2026
- Language-Parametric Reference Synthesis OOPSLA 2025
- Manipulating accumulative functions by swapping call-time and return-time computations JFP 2012
- Automatic inversion generates divide-and-conquer parallel programs PLDI 2007
- Intrinsically Typed Sessions with Callbacks (Functional Pearl) ICFP 2023
- Collections, Cardinalities, and Relations VMCAI 2010