Type-level integers, booleans, lists using type families
|Version on this page:||18.104.22.168|
|LTS Haskell 20.23:||1.0.2|
|Stackage Nightly 2023-05-31:||1.0.2|
|Latest on Hackage:||1.0.2|
Module documentation for 22.214.171.124
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.
Change representation of decimals to an inherently normalized form that is symmetric with respect to positive and negative numbers.
singularize module names
separate Decimal and general representation
use Proxys instead of plain types for data functions This is also consistent with new Nat kind, where types of kind Nat have no data values.
Ord: make infix operators classes and prefix functions type functions It seems to be more natural to me to write x :<: y and GTT x y ~ True
Num, Bool, Ord: remove T suffixes from functions Use qualification instead.