A value-level representation of a natural number n.
Modulenatural-arithmetic-0.2.1.0Haskell2010
Arithmetic.Types
- 14 types
- Packagenatural-arithmetic-0.2.1.0
- Exports16
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceUnsafe.hs
Unboxed variant of Nat.
Proof that the first argument can be expressed as the sum of the second argument and some other natural number.
Constructors
Difference :: Nat c -> (c + b) :=: a -> Difference a b
A finite set of n elements. 'Fin n = { 0 .. n - 1 }'
Finite numbers without the overhead of carrying around a proof.
Variant of Fin# that only allows 32-bit integers.
Maybe Fin
3 declarationsEither a Fin# or Nothing. Internally, this uses negative
one to mean Nothing.
Infix Operators
6 declarationsProof that the first argument is strictly less than the second argument.
Proof that the first argument is less than or equal to the second argument.
Proof that the first argument is equal to the second argument.