Haskell’s laziness allows the programmer to solve some problems naturally and declaratively via recursive equations. Unfortunately, if the input is “too recursive”, these very elegant idioms can fall into the dreaded black hole, and the programmer has to resort to more pedestrian approaches.
It does not have to be that way: We built variants of common pure data structures (Booleans, sets) where recursive definitions are productive. Internally, the infamous unsafePerformIO is at work, but the user only sees a beautiful and pure API, and their pretty recursive idioms – magically – work again.
Tue 5 SepDisplayed time zone: Pacific Time (US & Canada) change
15:00 - 16:00
|Combinator-Based Fixpoint Algorithms for Big-Step Abstract Interpreters|
ICFP Papers and EventsDOI
|More Fixpoints! (Functional Pearl)Functional Pearl|
ICFP Papers and Events
Joachim Breitner unaffiliatedDOI Pre-print File Attached