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 …

We present a novel programming language design that attempts to combine the clarity and
safety of high-level functional languages with the efficiency and parallelism of low-level …

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 …

Establishing quantitative bounds on the execution cost of programs is essential in many
areas of computer science such as complexity analysis, compiler optimizations, security and …

Bidirectional typechecking, in which terms either synthesize a type or are checked against a
known type, has become popular for its scalability (unlike Damas-Milner type inference …

We propose a core semantics for Dependent Haskell, an extension of Haskell with full-
spectrum dependent types. Our semantics consists of two related languages. The first is a …

In this paper we consider categories over a commutative ring provided either with a free
action or with a grading of a not necessarily finite group. We define the smash product …

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 …

Haskell, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new
type-level programming features for some time. Many of these features—generalized …