Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
Documentation
A value-level representation of a natural number n
.
data Difference :: Nat -> Nat -> Type where Source #
Proof that the first argument can be expressed as the sum of the second argument and some other natural number.
Difference :: forall a b c. Nat c -> ((c + b) :=: a) -> Difference a b |
data Fin :: Nat -> Type where Source #
A finite set of n
elements. 'Fin n = { 0 .. n - 1 }'
data (<) :: Nat -> Nat -> Type infix 4 Source #
Proof that the first argument is strictly less than the second argument.