tfp: Type-level integers, booleans, lists using type families

[ bsd3, library, type-system ] [ Propose Tags ]

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.

Versions 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 1.0, 1.0.0.1, 1.0.0.2
Dependencies base (>=3.0 && <5), QuickCheck (>=1.2.0.0), template-haskell (>=2.0) [details]
License BSD-3-Clause
Copyright Copyright (c) 2013 Henning Thielemann, 2008 Peter Gavin
Author Peter Gavin, Henning Thielemann
Maintainer haskell@henning-thielemann.de
Category Type System
Home page http://www.haskell.org/haskellwiki/Type_arithmetic
Source repo head: darcs get http://code.haskell.org/~thielema/tfp/
this: darcs get http://code.haskell.org/~thielema/tfp/ --tag 0.7
Uploaded by HenningThielemann at Mon May 20 09:33:04 UTC 2013
Distributions LTSHaskell:1.0.0.2, NixOS:1.0.0.2, Stackage:1.0.0.2
Executables tfp-test
Downloads 4118 total (44 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Flags

NameDescriptionDefaultType
build-test

Build the tfp-test test program

DisabledAutomatic

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

For package maintainers and hackage trustees