Detecting Recursion Schemes in Haskell Functions (...)
summary
Claims an automated detector finds concrete recursion schemes in Haskell98 code by computing the least general generalisation of function bodies, implemented as a prototype inside HaRe and exercised on Prelude-like list functions, matrix multiplication and quicksort. The method uses anti-unification to produce substitutions that reconstruct original code and reveal a fold or map, yields modest speedups when swapped for a parallel fold on a 28‑core machine, and notes laziness and edge cases that need rewriting.
AI-written summary · about
chapters (6)
- 0:00Start
- 3:29Alternative Parallelisations
- 9:05Applying Anti-Unification to Matrix Multiplication
- 11:45Not Just Matrix Multiplication
- 12:26Future Work
- 14:10Summary
