ICFP 2021
Sun 22 - Sat 28 August 2021
Thu 26 Aug 2021 21:00 - 21:30 at Haskell - Paper Session 1

We present an approach for automatic function inversion in Haskell. The inverse functions we generate are based on an extension of Haskell’s computational model with non-determinism and free variables. We implement this functional logic extension of Haskell via a monadic lifting of functions and type declarations. Using inverse functions, we additionally show how Haskell’s pattern matching can be augmented with support for functional patterns, which enable arbitrarily deep pattern matching in data structures. Finally, we provide a plugin for the Glasgow Haskell Compiler to seamlessly integrate inverses and functional patterns into the language, covering almost all of the Haskell2010 language standard.

Thu 26 Aug

Displayed time zone: Seoul change

20:00 - 21:30
Paper Session 1Haskell at Haskell
20:00
30m
Talk
Chesskell: A Two-Player Game at the Type Level
Haskell
Toby Bailey University of Warwick, Michael Gale University of Warwick, UK
20:30
30m
Talk
Express: applications of dynamically typed Haskell expressions
Haskell
Rudy Matela Unaffiliated
Link to publication DOI Pre-print
21:00
30m
Talk
Haskell⁻¹: Automatic Function Inversion in Haskell
Haskell
Finn Teegen University of Kiel, Germany, Kai-Oliver Prott University of Kiel, Germany, Niels Bunkenburg University of Kiel, Germany
DOI Pre-print