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

[ bsd3, library, type-system ] [ Propose Tags ] [ Report a vulnerability ]

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.

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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, 1.0.2
Change log CHANGES
Dependencies base (>=4.4 && <5), utility-ht (>=0.0.10 && <0.1) [details]
Tested with ghc ==7.4.2, ghc ==7.6.3, ghc ==7.8.4, ghc ==8.0.1
License BSD-3-Clause
Copyright Copyright (c) 2014 Henning Thielemann, 2008 Peter Gavin
Author Peter Gavin, Henning Thielemann
Maintainer haskell@henning-thielemann.de
Revised Revision 1 made by HerbertValerioRiedel at 2019-01-05T10:49:05Z
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.0.2
Uploaded by HenningThielemann at 2016-01-09T23:52:59Z
Distributions LTSHaskell:1.0.2, NixOS:1.0.2, Stackage:1.0.2
Reverse Dependencies 17 direct, 13 indirect [details]
Downloads 10923 total (81 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2016-01-09 [all 1 reports]