monadic-recursion-schemes 0.1.6.0 → 0.1.6.1
raw patch · 3 files changed
+6/−1 lines, 3 filesPVP: minor bump suggested
API additions: PVP suggests at least a minor version bump
API changes (from Hackage documentation)
+ Data.Functor.Foldable.Monadic: postproM :: (Monad m, Traversable (Base t), Recursive t, Corecursive t) => (Base t t -> m (Base t t)) -> (a -> m (Base t a)) -> a -> m t
+ Data.Functor.Foldable.Monadic: preproM :: (Monad m, Traversable (Base t), Recursive t, Corecursive t) => (Base t t -> m (Base t t)) -> (Base t a -> m a) -> t -> m a
Files
CHANGELOG.md view
@@ -1,5 +1,9 @@ # Revision history for monadic-recursion-schemes +## 0.1.6.1 -- 2020-05-15++* bugfix: export preproM and postproM.+ ## 0.1.6.0 -- 2020-05-15 * add preproM and postproM.
monadic-recursion-schemes.cabal view
@@ -4,7 +4,7 @@ -- http://haskell.org/cabal/users-guide/ name: monadic-recursion-schemes-version: 0.1.6.0+version: 0.1.6.1 synopsis: Recursion Schemes for Monadic version. description: Yet another recursion schemes for monadic style, depends on recursion-schemes. homepage: https://github.com/cutsea110/monadic-recursion-schemes.git
src/Data/Functor/Foldable/Monadic.hs view
@@ -21,6 +21,7 @@ , dynaM'', codynaM'' , mutuM, comutuM , mutuM', comutuM'+ , preproM, postproM ) where import Control.Comonad (Comonad (..))