Haskell Symposium 2021
as the organisers put it
The Haskell Symposium presents original research on Haskell, discusses practical experience and future development of the language, and promotes other forms of declarative programming. Just like ICFP 2021, the Haskell Symposium will be virtual. The dates for the symposium are 26-27 August, 2021. More information about the format (time zone, presentation style, etc.) will be added as soon as it is finalized. Note: this website has the same content as this one. Topics of interest include: Language design, with a focus on possible extensions and modifications of Haskell as well as critical ...
| title | author | length |
|---|---|---|
| Chesskell: A Two-Player Game at the Type Level | Toby Bailey | 31m |
A full type-level Haskell model of FIDE 2018 chess is implemented as a composition of first-class families and a continuation-passing-style EDSL where a… | ||
| Express: applications of dynamically typed Haskell expressions | Rudy Matela | 28m |
The express library implements dynamically typed Haskell expressions as a wrapper around Data.Dynamic and adds pretty printing, delayed evaluation, support for… | ||
| Haskell⁻¹: Automatic Function Inversion in Haskell | Finn Teegen, Kai-Oliver Prott, Niels Bunkenburg | 34m |
Automatic inversion generates an inverse for any Haskell2010 function by a GHC plugin that lifts code into a functional-logic monad supporting non-determinism… | ||
| Why Functional Programming with Linear Types Matters | mathieu bus flug | 01h 09m |
GHC 9.0 adds retrofitted linear types and a rio monad (linear-base) that track usages to enforce resource safety: sockets must be used exactly once so… | ||
| Design Patterns for Parser Combinators (Functional Pearl) | Jamie Willis | 28m |
A cookbook of concrete parser-combinator fixes demonstrates on a small calculator parser: left recursion is eliminated by replacing naive recursion with chainL… | ||
| Graded Monads and Type-Level Programming for Dependence Analysis | Finnbar Keating | 34m |
Uses a graded monad that tags computations with type-level (reads,writes) sets and names memory cells by symbols, builds a type-level dependency graph by… | ||
| Practical Normalization by Evaluation for EDSLs | Alejandro Russo, Sam Lindley | 35m |
Provides a practical recipe using Normalization by Evaluation to get the fusion benefits of shallow embeddings while keeping deep-syntax for codegen… | ||
| Seeking Stability by being Lazy and Shallow: Lazy and shallow instantiation | Gert-Jan Bottu, Richard A. Eisenberg | 14m |
Formalizing a type-system family parameterized by eager vs lazy and deep vs shallow instantiation, the work proves stability properties (type-preserving let… | ||
| Linear Haskell, Today and Tomorrow | Jean-Philippe Bernardy | 01h 04m |
GHC 9 ships a working linear-types extension and the talk demos code: identity and map type-check with GHC 9 linear types, lists and functions become… | ||
| Evaluating Linear Functions to Symmetric Monoidal Categories | Arnaud Spiwack | 42m |
Arrows lose needed parallelism because they force tuple-shaped inputs, so encoding box-and-wire diagrams as arrows wastes CPU; the claim is that symmetric… | ||
| Full Workshop (2 days) | Toby Bailey | 07h 15m |
A full type-level chess implementation demonstrates what Haskell’s types can enforce, and how fragile GHC’s performance can be: a naive check for “king in… | ||
| nothing matches | ||