tfp

Type-level integers, booleans, lists using type families http://www.haskell.org/haskellwiki/Type_arithmetic

Version on this page:1.0.0.2
LTS Haskell 16.3:1.0.1.1
Stackage Nightly 2020-07-04:1.0.1.1
Latest on Hackage:1.0.1.1

See all snapshots tfp appears in

BSD-3-Clause licensed by Peter Gavin, Henning Thielemann
Maintained by [email protected]

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.

Depends on 2 packages(full list with versions):
Used by 1 package in lts-9.21(full list with versions):