Haskell⁻¹: Automatic Function Inversion in Haskell
summary
Automatic inversion generates an inverse for any Haskell2010 function by a GHC plugin that lifts code into a functional-logic monad supporting non-determinism, free logical variables and laziness, then extracts heap bindings as inverse results (append [1] yields two solutions). It supports higher-order functions and primitive types (uses an external constraint solver), preserves original definitions, emits the boilerplate automatically, implements functional patterns, and is available as an artifact on GitHub.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 2:53Part in Haskell
- 5:35Contributions
- 11:36Monarchs
- 13:10Inversion Computation
- 21:26Paper Summary
- 23:03Questions
- 31:34Conclusion
related talks
01h 02mHaskell for Java Programmers
01h 22mHaskell for Everyday Programmers
01h 02mType Inference in GHC
01h 04mHaskell - A Peek Inside the Ivory Tower
34mFrom JavaScript to Haskell
49mMaking sense of the Haskell type system
50mTemplate Haskell, a case study in (in)stability
03h 04mHaskell for Beginners: Learn Functional Programming from Scratch