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 [faq] 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, 1.0.1, 1.0.1.1
Change log Changes.md
Dependencies base (>=4.5 && <5), utility-ht (>=0.0.10 && <0.1) [details]
License BSD-3-Clause
Copyright Copyright (c) 2014 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://hub.darcs.net/thielema/tfp/
this: darcs get http://hub.darcs.net/thielema/tfp/ --tag 1.0.1.1
Uploaded by HenningThielemann at Sat Jan 5 11:15:32 UTC 2019
Distributions LTSHaskell:1.0.1.1, NixOS:1.0.1.1, Stackage:1.0.1.1
Downloads 4802 total (183 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-01-05 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees