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 22.14:1.0.2
Stackage Nightly 2024-03-28: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

  • Data
    • Data.SizedInt
    • Data.SizedWord
  • Type
    • Type.Base
      • Type.Base.Proxy
    • Type.Data
      • Type.Data.Bool
      • Type.Data.List
      • Type.Data.Num
        • Type.Data.Num.Decimal
          • Type.Data.Num.Decimal.Digit
            • Type.Data.Num.Decimal.Digit.Proof
          • Type.Data.Num.Decimal.Literal
          • Type.Data.Num.Decimal.Number
          • Type.Data.Num.Decimal.Proof
        • Type.Data.Num.Unary
          • Type.Data.Num.Unary.Literal
          • Type.Data.Num.Unary.Proof
      • Type.Data.Ord
Depends on 2 packages(full list with versions):
Used by 1 package in nightly-2018-01-29(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.