free-functors 0.1.1 → 0.1.2
raw patch · 2 files changed
+3/−4 lines, 2 filesdep ~voidPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: void
API changes (from Hackage documentation)
- Data.Functor.HFree: type :~> f g = forall b. f b -> g b
+ Data.Functor.HFree: type (:~>) f g = forall b. f b -> g b
- Data.Functor.Free: convertClosed :: c x => Free c Void -> x
+ Data.Functor.Free: convertClosed :: c r => Free c Void -> r
Files
- free-functors.cabal +2/−2
- src/Data/Functor/Free.hs +1/−2
free-functors.cabal view
@@ -1,5 +1,5 @@ name: free-functors-version: 0.1.1+version: 0.1.2 synopsis: Provides free functors that are adjoint to functors that forget class constraints. description: A free functor is a left adjoint to a forgetful functor. It used to be the case that the only category that was easy to work with in Haskell was Hask itself, so@@ -43,7 +43,7 @@ constraints >= 0.3.2 && < 0.4, transformers >= 0.2.0.0 && < 0.4, comonad >= 3.0 && < 3.1,- void >= 0.4 && < 0.6+ void >= 0.4 && < 0.7 source-repository head type: git
src/Data/Functor/Free.hs view
@@ -22,7 +22,6 @@ module Data.Functor.Free where import Control.Applicative-import Control.Monad import Control.Comonad import Data.Constraint@@ -89,5 +88,5 @@ convert :: (c (f a), Applicative f) => Free c a -> f a convert = rightAdjunct pure -convertClosed :: c x => Free c Void -> x+convertClosed :: c r => Free c Void -> r convertClosed = rightAdjunct absurd