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 24.18:1.0.2
Stackage Nightly 2025-11-04:1.0.2
Latest on Hackage:1.0.2

See all snapshots tfp appears in

BSD-3-Clause licensed by Peter Gavin, Henning Thielemann
Maintained by [email protected]
This version can be pinned in stack with:tfp-1.0.0.2@sha256:59b9e6958d3edea0618b8ccdec41265fa69fd88dc96a2dacfa5ef5e76ea2d007,2042

Module documentation for 1.0.0.2

Depends on 2 packages(full list with versions):
base, utility-ht
Used by 1 package in lts-11.22(full list with versions):
fixed-length

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.