equational-reasoning 0.2.0.5 → 0.2.0.6
raw patch · 1 files changed
+8/−3 lines, 1 filesdep ~singletonsPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: singletons
API changes (from Hackage documentation)
- Proof.Equational: apply :: Leibniz a b -> forall f. f a -> f b
- Proof.Equational: instance Equality (:=:)
- Proof.Equational: instance Equality Leibniz
- Proof.Equational: instance Preorder (->)
- Proof.Equational: instance Preorder (:=:)
- Proof.Equational: instance Preorder Leibniz
+ Proof.Equational: [apply] :: Leibniz a b -> forall f. f a -> f b
+ Proof.Equational: instance Proof.Equational.Equality (Proof.Equational.:=:)
+ Proof.Equational: instance Proof.Equational.Equality Proof.Equational.Leibniz
+ Proof.Equational: instance Proof.Equational.Preorder (->)
+ Proof.Equational: instance Proof.Equational.Preorder (Proof.Equational.:=:)
+ Proof.Equational: instance Proof.Equational.Preorder Proof.Equational.Leibniz
- Proof.Equational: Refl :: (:~:) k a1 a1
+ Proof.Equational: Refl :: (:~:) k b b
Files
equational-reasoning.cabal view
@@ -2,7 +2,7 @@ -- documentation, see http://haskell.org/cabal/users-guide/ name: equational-reasoning-version: 0.2.0.5+version: 0.2.0.6 synopsis: Proof assistant for Haskell using DataKinds & PolyKinds description: A simple convenient library to write equational / preorder proof as in Agda. license: BSD3@@ -12,7 +12,9 @@ copyright: (c) Hiromi ISHII 2013-2014 category: Math build-type: Simple-tested-with: GHC == 7.6.1, GHC == 7.6.2, GHC == 7.6.3, GHC == 7.8.1+tested-with: GHC == 7.6.3,+ GHC == 7.8.3, GHC == 7.8.4,+ GHC == 7.10.2 cabal-version: >=1.8 source-repository head@@ -27,7 +29,10 @@ if impl(ghc < 7.8) build-depends: singletons == 0.8.* , tagged >= 0.6- else+ if impl(ghc < 7.10) build-depends: singletons >= 0.8 && < 1.2+ else+ build-depends: singletons == 2.0.*+