A Well-Typed Binomial Heap

Featuring Jasper Van der Jeugt

Most people are familiar with the hello world of dependently-typed Haskell: a vector that is annotated with the Peano number represenation of its size. This talk introduces a similar way to deal with binomial heaps.

Raytracing with Haskell

Featuring Michał Kawalec

Understanding the performance of Haskell code is often an important factor for success in many applications.

Write Your Own GHC Type Checker Plugins

Featuring Gabe Dijkstra

It has never been easier to do type-level programming in Haskell to capture precise invariants of the values as we are working with. Thanks to extensions such as DataKinds and TypeFamilies, many value-level definitions translate directly to type-level definitions.

Write Yourself a Typed Functional Language

Featuring Oleg Grenrus

One way to learn a tool is to use it to build something non-trivial.

2

GRIN - an Alternative Haskell Compiler Backend

Featuring Andor Penzes and Csaba Hruska

The GRIN language is an intermediate representation for lazy programming languages such as Haskell. It serves the same role as STG (in GHC compilation pipeline) but follows different design decisions. GRIN describes suspended computations as regular data structure using whole program...

Haskell IDE Support via LSP

Featuring Alan Zimmerman

Haskell SpriteKit — A Purely Functional API for a Stateful Animation System & Physics Engine

Featuring Manuel M T Chakravarty

Graphics, animation, and games programming in Haskell faces a dilemma. You can either use existing frameworks with their highly imperative APIs (such as OpenGL, Cocos2D, or SpriteKit) or you waste a lot of energy trying to re-engineer those rather complex systems from scratch. Or, maybe, you can...

Elegant Geometry with Denotational Design

Featuring David Eichmann

This talk will explore the application of denotational design to geometry and how it leads to elegant implementation.

Profunctors and Data Accessors

Featuring Andrzej Rybczak

The talk will cover basics of Profunctors, i.e. what are they and how they are useful. Andrzej will also explore the concept of profunctor transformations and how they can be used to model data accessors such as lenses, prisms and traversals.

Labelled Algebraic Graphs

Featuring Andrey Mokhov