Abstract Development of formal proofs of correctness of programs can increase actual and
perceived reliability and facilitate better understanding of program specifications and their …

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) …

The theory of program modules is of interest to language designers not only for its practical
importance to programming, but also because it lies at the nexus of three fundamental …

Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc
polymorphism. Type classes have been shown to provide a type-safe solution to important …

We present an internal language with equivalent expressive power to Standard ML, and
discuss its formalization in LF and the machine-checked verification of its type safety in …

Haskell programmers have been experimenting with dependent types for at least a decade,
using clever encodings that push the limits of the Haskell type system. However, the …

This paper presents an extension to Liquid Haskell that facilitates stating and semi-
automatically proving properties of typeclasses. Liquid Haskell augments Haskell with …

We present instance arguments: an alternative to type classes and related features in the
dependently typed, purely functional programming language/proof assistant Agda. They are …

We present modular implicits, an extension to the OCaml language for ad-hoc polymorphism
inspired by Scala implicits and modular type classes. Modular implicits are based on type …

We present a higher-order module system for the purely functional data-parallel array
language Futhark. The module language has the property that it is completely eliminated at …