Bidirectional ty** combines two modes of ty**: type checking, which checks that a
program satisfies a known type, and type synthesis, which determines a type from the …

A history of Haskell Page 1 A History of Haskell: Being Lazy With Class Paul Hudak Yale
University paul.hudak@yale.edu John Hughes Chalmers University rjmh@cs.chalmers.se …

Generalized algebraic data types (GADTs), sometimes known as" guarded recursive data
types" or" first-class phantom types", are a simple but powerful generalization of the data …

We introduce System FC, which extends System F with support for non-syntactic type
equality. There are two main extensions:(i) explicit witnesses for type equalities, and (ii) …

Advanced type system features, such as GADTs, type classes and type families, have
proven to be invaluable language extensions for ensuring data invariants and program …

We extend classic union and intersection type systems with a type-case construction and
show that the combination of the union elimination rule of the former and the ty** rules for …

GADTs have proven to be an invaluable language extension, for ensuring data invariants
and program correctness among others. Unfortunately, they pose a tough problem for type …

Type inference for parametric polymorphism is wildly successful, but has always suffered
from an embarrassing flaw: polymorphic types are themselves not first class. We present …

Delimited continuations are more expressive than traditional abortive continuations and they
apparently require a framework beyond traditional continuation-passing style (CPS). We …

We present an approach to enriching the type system of ML with a restricted form of
dependent types, where type index terms are required to be drawn from a given type index …