This paper describes a new approach to generic functional programming, which allows us to
define functions generically for all datatypes expressible in Haskell. A generic function is …

We present a sound type-based'usage analysis' for a realistic lazy functional language.
Accurate information on the usage of program subexpressions in a lazy functional language …

Dependent types reflect the fact that validity of data is often a relative notion by allowing prior
data to affect the types of subsequent data. Not only does this make for a precise type …

The Curry-Howard isomorphism states that types are propositions and that programs are
proofs. This allows programmers to state and enforce invariants of programs by using types …

Abstract The Hindley/Milner type system has been widely adopted as a basis for statically
typed functional languages. One of the main reasons for this is that it provides an elegant …

LNCS 7829 - Some History of Functional Programming Languages Page 1 Some History of
Functional Programming Languages (Invited Talk) DA Turner University of Kent & Middlesex …

We argue that the novel combination of type classes and existential types in a single
language yields significant expressive power. We explore this combination in the context of …

Haskell programmers often use a multi-parameter type class in which one or more type
parameters are functionally dependent on the first. Although such functional dependencies …

In lazy functional languages,⊥ is typically an element of every type. While this provides
great flexibility, it also comes at a cost. In this paper we explore the consequences of …

Generic programming allows you to write a function once, and use it many times at different
types. A lot of good foundational work on generic programming has been done. The goal of …