typenums
Type level numbers using existing Nat functionality
https://github.com/adituv/typenums#readme
| LTS Haskell 22.42: | 0.1.4 |
| Stackage Nightly 2024-11-18: | 0.1.4 |
| Latest on Hackage: | 0.1.4 |
typenums-0.1.4@sha256:1e7ed4d18db4a5d485716978bb588863fa1ff40afe7098e3b304f0f2b4b3687a,1933Module documentation for 0.1.4
- Data
- Data.TypeLits
- Data.TypeNums
- Data.TypeNums.Arithmetic
- Data.TypeNums.Ints
- Data.TypeNums.Rats
typenums
Type level numbers using existing Nat functionality. Uses kind-polymorphic typeclasses and type families to facilitate more general code compatible with existing code using type-level Naturals.
Usage
Import either Data.TypeNums or Data.TypeLits instead of GHC.TypeLits. Some definitions conflict with GHC.TypeLits, so if you really must import it, use an explicit import list.
This library is intended to be used in a kind-polymorphic way, such that a type-level integer parameter can be written as a natural, and a rational can be written as either of the other two. As an example:
{-# LANGUAGE PolyKinds #-}
data SomeType (n :: k) = SomeType
useSomeType :: KnownInt n => SomeType n -> _
useSomeType = -- ...
Syntax
- Positive integers are written as natural numbers, as before. Optionally
they can also be written as
Pos n. - Negative integers are written as
Neg n. - Ratios are written as
n :% d, wherencan be a natural number,Pos n, orNeg n, anddis a natural number.
Addition, subtraction and multiplication at type level are all given as infix operators with standard notation, and are compatible with any combination of the above types. Equality and comparison constraints are likewise available for any combination of the above types.
N.B. The equality constraint conflicts with that in Data.Type.Equality. The (==) operator from Data.Type.Equality is re-exported as (==?) from both Data.TypeNums and Data.TypeLits.