A long-standing shortcoming of statically typed functional languages is that type checking
does not rule out pattern-matching failures (run-time match exceptions). Refinement types …

Ornaments express relations between inductive types with the same inductive structure. We
implement fully automatic proof reuse for a particular class of ornaments in a Coq plugin …

Ornaments are a way to describe changes in datatype definitions reorganizing, adding, or
dropping some pieces of data so that functions operating on the bare definition can be …

Ornaments provide a way to express transformations of inductive datatypes that reorganize,
specialize, and add fields to already existing datatypes. From such a transformation, we …

Ornaments are a way to describe changes in datatype definitions reorganizing, adding, or
dropping some pieces of data so that functions operating on the bare definition can be …

Inductive datatypes and parametric polymorphism are two key features introduced in the ML
family of languages in the 1980's, at the core of the two popular languages OCaml and …

Generalized Algebraic Data Types, or simply GADTs, can encode non-trivial properties in
the types of the constructors. Once such properties are encoded in a datatype, however, all …

Ornaments are a way to describe changes in datatype definitions that preserve their
recursive structure, reorganizing, adding, or dropping some pieces of data so that functions …