Skip to content

Opening book details…

Can I read Constrained Type Families on EtoBox?

Constrained Type Families by J. Garrett Morris and Richard A. Eisenberg is a Computer Science article available to read on EtoBox.

What is Constrained Type Families about?

We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either require totality or implicitly assume it. For example, type families in Haskell provide a powerful, modular means of defining type-level computation. However, their current design implicitly assumes that type families are total, introducing nonsensical types and significantly complicating the metatheory of type families and their extensions. We propose an alternative design, using qualified types to pair type-level computations with predicates that capture their domains. Our approach naturally captures the intuitive partiality of type families, simplifying their metatheory. As evidence, we present the first complete proof of consistency for a language with closed type families.

Who reads Constrained Type Families?

It is typically read by researchers, students, and practitioners in Computer Science.

Author
J. Garrett Morris and Richard A. Eisenberg
Publisher
ACM
Published
2017
Language
EN
Field
Computer Science (Physical Sciences)