free-functors 0.7.2 → 0.8
raw patch · 4 files changed
+14/−7 lines, 4 filesdep ~algebraic-classesdep ~basedep ~template-haskellPVP ok
version bump matches the API change (PVP)
Dependency ranges changed: algebraic-classes, base, template-haskell
API changes (from Hackage documentation)
- Data.Constraint.Class1: containsSelf :: HasSuperClasses c => FoldConstraints '[c] x :- c x
+ Data.Constraint.Class1: containsSelf :: (HasSuperClasses c, SuperClasses c ~ '[c]) => FoldConstraints (SuperClasses c) x :- c x
- Data.Constraint.Class1: superClasses :: HasSuperClasses c => c x :- FoldConstraints '[c] x
+ Data.Constraint.Class1: superClasses :: (HasSuperClasses c, SuperClasses c ~ '[c]) => c x :- FoldConstraints (SuperClasses c) x
Files
- CHANGELOG +6/−0
- free-functors.cabal +4/−4
- src/Data/Constraint/Class1.hs +2/−2
- src/Data/Functor/HHFree.hs +2/−1
CHANGELOG view
@@ -1,5 +1,11 @@ CHANGELOG +0.7.2 -> 0.8+ - Updated for GHC 8.2+ - Updated to base-4.10+ - Updated to template-haskell-2.12+ - Updated to algebraic-classes-0.8+ 0.7.1 -> 0.7.2 - Fixed Traversable instance of `Free c`
free-functors.cabal view
@@ -1,5 +1,5 @@ name: free-functors-version: 0.7.2+version: 0.8 synopsis: Free functors, 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,12 +43,12 @@ Haskell2010 build-depends:- base == 4.9.*,- template-haskell == 2.11.*,+ base >= 4.9 && < 4.11,+ template-haskell >= 2.11 && < 2.13, constraints == 0.9.*, transformers == 0.5.*, comonad == 5.*,- algebraic-classes == 0.7.*,+ algebraic-classes >= 0.7 && < 0.9, contravariant == 1.4.*, bifunctors == 5.*, profunctors == 5.*
src/Data/Constraint/Class1.hs view
@@ -46,10 +46,10 @@ type SuperClasses c :: [k -> Constraint] type SuperClasses c = '[c] superClasses :: c x :- FoldConstraints (SuperClasses c) x- default superClasses :: c x :- FoldConstraints '[c] x+ default superClasses :: (SuperClasses c ~ '[c]) => c x :- FoldConstraints (SuperClasses c) x superClasses = Sub Dict containsSelf :: FoldConstraints (SuperClasses c) x :- c x- default containsSelf :: FoldConstraints '[c] x :- c x+ default containsSelf :: (SuperClasses c ~ '[c]) => FoldConstraints (SuperClasses c) x :- c x containsSelf = Sub Dict instance HasSuperClasses Functor
src/Data/Functor/HHFree.hs view
@@ -1,6 +1,7 @@ {-# LANGUAGE RankNTypes , TypeOperators+ , MonoLocalBinds , ConstraintKinds , FlexibleContexts , ScopedTypeVariables@@ -18,7 +19,7 @@ -- A free functor is left adjoint to a forgetful functor. -- In this package the forgetful functor forgets class constraints. ----- Compared to @Data.Functor.HHFree@ we have 2 two parameters.+-- Compared to @Data.Functor.HFree@ we have 2 two parameters. ----------------------------------------------------------------------------- module Data.Functor.HHFree where