ZuriHac 2023
2023-06-10..2023-06-12
Rapperswil, Switzerland
ZuriHac ·
[ZuriHac 2022, ZuriHac 2023, ZuriHac 2025, ZuriHac 2026]
who it's for
Haskell developers, functional programmers, programming language designers, compiler engineers, category theory researchers, computer science educators, library authors
topics
Verse functional-logic language; transactional STM across data centers; dependent types with Agda proofs; delimited continuations in GHC 9.6; practical monad transformer patterns; Haskell-to-combinators compilation; lazy evaluation measurement techniques; Haskell web application architecture; extensible configurable prettyprinters; structure-editor teaching language (Primer); Plutarch free-without-pure eDSL; category-theory to Haskell constructions
| title | author | length |
|---|---|---|
| Beyond Functional Programming: A Taste of Verse | Simon Peyton Jones | 01h 03m |
Verse is a new declarative functional‑logic language being specified for Epic Games to run persistent metaverse code that must scale to millions of independent… | ||
| A Galilean revolution for computing | Conal Elliott | 01h 28m |
Claim: computation achieves unboundedly scalable reliability and efficiency by making correctness machine-checkable and compositional. Approach uses dependent… | ||
| Delimited Continuations, Demystified | Alexis King | 01h 16m |
GHC gains native first-class delimited continuations in GHC 9.6, implemented as a small runtime patch completed after a three‑year proposal cycle and finished… | ||
| Monad transformers are good, actually | Gabriella Gonzalez | 01h 07m |
Shows that stacking concrete transformers (MaybeT, StateT, ReaderT, WriterT, ExceptT) simplifies real code: readInt/readThreeInts becomes trivial by wrapping… | ||
| MacGyver's Haskell Compiler | Ben Lynn | 01h 01m |
Builds a working Haskell-to-combinators compiler that converts Haskell AST to lambda terms, uses Scott encoding for data and a fixed‑point (Y combinator) trick… | ||
| Category Theory Track by Bartosz Milewski Part 1 | Bartosz Milewski | 01h 29m |
Translates category-theory universal constructions into concrete Haskell code, showing how unit type / terminal object maps to the polymorphic unit function… | ||
| Category Theory Track by Bartosz Milewski Part 2 | Bartosz Milewski | 01h 31m |
Summarizes concrete identities and constructions used to write code from category theory: uses Curry/uncurry to turn A×B→C into A→(B→C) and completes the… | ||
| Lazy Evaluation | Andres Löh | 02h 38m |
Three hours of worked examples show how Haskell’s lazy, outermost reduction (weak head normal form) really behaves: null on an enum is constant space… | ||
| Web Application Architecture in Haskell | Hécate | 20m |
Flora.pm is a real Haskell web app on GitHub that encodes business rules in the type system and runs in production, using a clear DTO/DAO/domain translation to… | ||
| Extensible configurable prettyprinters | Philip Hazelden | 15m |
Three concrete designs for an extensible configurable pretty‑printer are compared with code-level tradeoffs: a zero classes approach uses a per-type renderer… | ||
| Primer: Pedagogical functional programming | George Thomas | 20m |
Small team of three builds Primer, a new statically typed functional teaching language with a structure editor that represents programs as trees and enforces… | ||
| Free without Pure: eDSL framework Plutarch | Las Safin | 25m |
An eDSL framework called Plutarch implements a free-without-pure design that recovers de Bruijn indices from HOAS, tracks linear variables, and composes… | ||
| Project Presentations | Jasper Van der Jeugt | 01h 11m |
A series of short demos shows concrete outcomes and tools: a deriving effort lands bugfixes and recruits first-time GHC contributors; the Haskell Error Index… | ||
| Closing | Farhad D. Mehta, Jasper Van der Jeugt | 03m |
Organizers thank volunteers by name and report 400 attendees at a free community conference, with the venue room seats 500 so there is spare capacity for… | ||
| nothing matches | ||