Type-level integers, booleans, lists using type families

Version on this page:
LTS Haskell 17.11:1.0.2
Stackage Nightly 2021-05-10:1.0.2
Latest on Hackage:1.0.2

See all snapshots tfp appears in

BSD-3-Clause licensed by Peter Gavin, Henning Thielemann
This version can be pinned in stack with:tfp-,2042
Depends on 2 packages(full list with versions):
Used by 1 package in lts-12.14(full list with versions):

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.