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.

Downloads

Maintainer's Corner

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.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 https://hub.darcs.net/thielema/tfp/
this: darcs get https://hub.darcs.net/thielema/tfp/ --tag 1.0.2
Uploaded by HenningThielemann at 2021-03-14T21:11:46Z
Distributions LTSHaskell:1.0.2, NixOS:1.0.2, Stackage:1.0.2
Downloads 10001 total (32 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-03-14 [all 1 reports]