Type Checking with Open Type Functions by Tom Schrijvers, Simon Peyton-Jones, Manuel M.
T. Chakravarty, and Martin Sulzmann
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types.
The contribution of the paper is that we identify and characterise the key technical challenge of entailment checking; and we give a novel, decidable, sound, and complete algorithm to solve it, together with some practically-important...
[ANN] FP Day 2011 - October 14th. Cambridge, UK.
Announcing FP Day 2011 a new 1 day Functional Programming event. The event covers the practical application of FP in Haskell, F# and Clojure. Keynote speakers are Simon-Peyton-Jones and Don...
A Monadic Framework for Delimited Continuations
A Monadic Framework for Delimited Continuations (PDF), R. Kent Dybvig, Simon Peyton Jones, Amr Sabry. TR, June 2005. Delimited continuations are more expressive than traditional abortive...
Data Representation Synthesis
I was just lucky enough to see Peter Hawkins present a particularly compelling synthesis language: data structure synthesis: We consider the problem of specifying combinations of data...
Post new comment