Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
Proof that a given type is a Nat. With this fact, you can do type-directed computation.
natRecursion :: (forall m. b -> a m -> a (S m)) -> (b -> a Z) -> (b -> b) -> b -> a n Source
Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Proof that a given type is a Nat. With this fact, you can do type-directed computation.
natRecursion :: (forall m. b -> a m -> a (S m)) -> (b -> a Z) -> (b -> b) -> b -> a n Source