bound 1.0.5 → 1.0.6

raw patch · 7 files changed

+23/−10 lines, 7 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Bound.Scope: bitransverseScope :: Applicative f => (forall a a'. (a -> f a') -> t a -> f (u a')) -> (a -> f a') -> Scope b t a -> f (Scope b u a')

+ Bound.Scope: bitransverseScope :: Applicative f => (forall a a'. (a -> f a') -> t a -> f (u a')) -> (c -> f c') -> Scope b t c -> f (Scope b u c')

Files

CHANGELOG.markdown +4/−0
README.markdown +1/−1
bound.cabal +1/−5
src/Bound/Class.hs +5/−2
src/Bound/Name.hs +5/−1
src/Bound/Scope.hs +1/−1
src/Bound/Var.hs +6/−0

CHANGELOG.markdown view

@@ -1,3 +1,7 @@+1.0.6+-----+* Compiles warning-free on GHC 7.10+ 1.0.5 ----- * Widened version bound on `bifunctors`.

README.markdown view

@@ -7,7 +7,7 @@ -----  This library provides convenient combinators for working with "locally-nameless" terms. These can be useful-when writing a type checker, evalator, parser, or pretty printer for terms that contain binders like forall+when writing a type checker, evaluator, parser, or pretty printer for terms that contain binders like forall or lambda, as they ease the task of avoiding variable capture and testing for alpha-equivalence.  See [the documentation](http://hackage.haskell.org/package/bound) on hackage for more information, but here is an example:

bound.cabal view

@@ -1,6 +1,6 @@ name:          bound category:      Language, Compilers/Interpreters-version:       1.0.5+version:       1.0.6 license:       BSD3 cabal-version: >= 1.9.2 license-file:  LICENSE@@ -87,8 +87,6 @@   main-is: Simple.hs   hs-source-dirs: examples   ghc-options: -Wall -threaded-  if impl(ghc<7.6.1)-    ghc-options: -Werror   build-depends:     base,     bound,@@ -100,8 +98,6 @@   main-is: doctests.hs   hs-source-dirs: tests   ghc-options: -Wall -threaded-  if impl(ghc<7.6.1)-    ghc-options: -Werror   build-depends:     base,     directory >= 1.0 && < 1.3,

src/Bound/Class.hs view

@@ -2,9 +2,10 @@ #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 704 {-# LANGUAGE DefaultSignatures #-} #endif+{-# OPTIONS -fno-warn-deprecations #-} ----------------------------------------------------------------------------- -- |--- Copyright   :  (C) 2012 Edward Kmett+-- Copyright   :  (C) 2012-2015 Edward Kmett -- License     :  BSD-style (see the file LICENSE) -- -- Maintainer  :  Edward Kmett <ekmett@gmail.com>@@ -19,10 +20,12 @@   , (=<<<)   ) where -#if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 704+#if __GLASGOW_HASKELL__ >= 704 import Control.Monad.Trans.Class #endif+#if __GLASGOW_HASKELL__ < 710 import Data.Monoid+#endif import Control.Monad.Trans.Cont import Control.Monad.Trans.Error import Control.Monad.Trans.Identity

src/Bound/Name.hs view

@@ -43,12 +43,16 @@  import Bound.Scope import Bound.Var+#if __GLASGOW_HASKELL__ < 710 import Control.Applicative+#endif import Control.Comonad import Control.Monad (liftM, liftM2)+#if __GLASGOW_HASKELL__ < 710 import Data.Foldable-import Data.Traversable import Data.Monoid+import Data.Traversable+#endif import Data.Bifunctor import Data.Bifoldable import qualified Data.Binary as Binary

src/Bound/Scope.hs view

@@ -409,7 +409,7 @@                 -> Scope b g a -> f (Scope b h a) transverseScope tau (Scope e) = Scope <$> (tau =<< traverse (traverse tau) e) -bitransverseScope :: Applicative f => (forall a a'. (a -> f a') -> t a -> f (u a')) -> (a -> f a') -> Scope b t a -> f (Scope b u a')+bitransverseScope :: Applicative f => (forall a a'. (a -> f a') -> t a -> f (u a')) -> (c -> f c') -> Scope b t c -> f (Scope b u c') bitransverseScope tau f = fmap Scope . tau (_F (tau f)) . unscope {-# INLINE bitransverseScope #-}

src/Bound/Var.hs view

@@ -29,11 +29,15 @@   , _F   ) where +#if __GLASGOW_HASKELL__ < 710 import Control.Applicative+#endif import Control.Monad (liftM, ap)+#if __GLASGOW_HASKELL__ < 710 import Data.Foldable import Data.Traversable import Data.Monoid (mempty)+#endif import Data.Hashable import Data.Hashable.Extras import Data.Bifunctor@@ -53,7 +57,9 @@ import Data.Profunctor import qualified Data.Serialize as Serialize import Data.Serialize (Serialize)+#if __GLASGOW_HASKELL__ < 710 import Data.Word+#endif import Prelude.Extras  ----------------------------------------------------------------------------