@hackage / tfp

Type-level integers, booleans, lists using type families

Latest1.0.2

About

Metadata

  • Last updated , by HenningThielemann
  • License BSD-3-Clause
  • Categories Type System

  • Maintained by: haskell@henning-thielemann.de

  • Lottery factor: 0

Links

Installation

Readme

TFP is an abbreviation for Type Family Programming. It provides implementations of type-level integers and booleans, and (eventually) simple type-level data structures. It uses type families as functions to produce new types, which provides an intuitive way to parameterize data types and functions on numerical values at compile time.