tfp: Type-level integers, booleans, lists using type families
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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.
Properties
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, 1.0.1, 1.0.1, 1.0.1.1, 1.0.2 |
---|---|
Change log | Changes.md |
Dependencies | base (>=3.0 && <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 |
Uploaded | by HenningThielemann at 2019-01-05T09:16:49Z |
Modules
[Index] [Quick Jump]
- Data
- Type
- Base
- Data
Downloads
- tfp-1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees