Safe, zero-cost coercions for Haskell

Generative type abstractions — present in Haskell, OCaml, and other languages — are useful concepts to help prevent programmer errors. They serve to create new types that are distinct at compile time but share a run-time representation with some base type. We present a new mechanism that allows for zero-cost conversions between generative type abstractions and their representations, even when such types are deeply nested. We prove type safety in the presence of these conversions and have implemented our work into GHC.

• Extended version with proofs