Cabal revisions of ersatz-0.1

Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.

-name:           ersatz-version:        0.1-license:        BSD3-license-file:   LICENSE-author:         Edward A. Kmett, Johan Kiviniemi-maintainer:     Edward A. Kmett <ekmett@gmail.com>-stability:      experimental-homepage:       http://comonad.com/reader-category:       Logic, Algorithms-synopsis:       A monad for expressing SAT or QSAT problems using observable sharing.-description:    A monad for expressing SAT or QSAT problems using observable sharing.-  .-  For example, we can express a full-adder with:-  .-  > full_adder :: Bit -> Bit -> Bit -> (Bit, Bit)-  > full_adder a b cin = (s2, c1 || c2)-  >   where (s1,c1) = half_adder a b-  >         (s2,c2) = half_adder s1 cin-  .-  > half_adder :: Bit -> Bit -> (Bit, Bit)-  > half_adder a b = (a `xor` b, a && b)-copyright:      (c) 2010-2013 Edward Kmett, (c) 2013 Johan Kiviniemi-build-type:     Custom-cabal-version:  >= 1.10-tested-with:    GHC == 7.6.2-extra-source-files:-  AUTHORS.md-  README.md-  CHANGELOG.md--library-  ghc-options: -Wall-  hs-source-dirs: src-  default-language: Haskell2010--  build-depends:-    array >= 0.2 && < 0.5,-    base >= 4 && < 6,-    containers >= 0.2.0.1,-    data-default >= 0.5 && < 0.6,-    ghc-prim,-    mtl >= 1.1 && < 2.2,-    process == 1.1.*,-    temporary == 1.1.*,-    transformers == 0.3.*,-    unordered-containers == 0.2.*--  exposed-modules:-    Ersatz-    Ersatz.Bit-    Ersatz.Bits-    Ersatz.Decoding-    Ersatz.Equatable-    Ersatz.Encoding-    Ersatz.Internal.Circuit-    Ersatz.Internal.Formula-    Ersatz.Internal.Literal-    Ersatz.Monad-    Ersatz.Problem-    Ersatz.Solution-    Ersatz.Solver-    Ersatz.Solver.Minisat-    Ersatz.Variable--  other-modules:-    Ersatz.Internal.Parser-    Ersatz.Internal.StableName--test-suite properties-  type: exitcode-stdio-1.0-  ghc-options: -Wall-  default-language: Haskell2010-  build-depends:-    ersatz,-    base >= 4 && < 6,-    mtl >= 1.1 && < 2.2,-    transformers == 0.3.*,-    containers >= 0.2.0.1,-    array >= 0.2 && < 0.5,-    data-reify >= 0.5 && < 0.7,-    test-framework >= 0.2.4 && < 0.9,-    test-framework-quickcheck >= 0.2.4 && < 0.4,-    test-framework-hunit >= 0.2.4 && < 0.4,-    QuickCheck >= 1.2.0.0 && < 2.6,-    HUnit >= 1.2.2.1 && < 1.3--  hs-source-dirs: tests-  Main-is: properties.hs--test-suite doctests-  type:    exitcode-stdio-1.0-  main-is: doctests.hs-  default-language: Haskell2010-  build-depends:-    base < 5,-    directory >= 1.0,-    doctest >= 0.9.1,-    filepath-  ghc-options: -Wall -threaded-  if impl(ghc<7.6.1)-    ghc-options: -Werror-  hs-source-dirs: tests+name:           ersatz
+version:        0.1
+x-revision: 1
+license:        BSD3
+license-file:   LICENSE
+author:         Edward A. Kmett, Johan Kiviniemi
+maintainer:     Edward A. Kmett <ekmett@gmail.com>
+stability:      experimental
+homepage:       http://comonad.com/reader
+category:       Logic, Algorithms
+synopsis:       A monad for expressing SAT or QSAT problems using observable sharing.
+description:    A monad for expressing SAT or QSAT problems using observable sharing.
+  .
+  For example, we can express a full-adder with:
+  .
+  > full_adder :: Bit -> Bit -> Bit -> (Bit, Bit)
+  > full_adder a b cin = (s2, c1 || c2)
+  >   where (s1,c1) = half_adder a b
+  >         (s2,c2) = half_adder s1 cin
+  .
+  > half_adder :: Bit -> Bit -> (Bit, Bit)
+  > half_adder a b = (a `xor` b, a && b)
+copyright:      (c) 2010-2013 Edward Kmett, (c) 2013 Johan Kiviniemi
+build-type:     Custom
+cabal-version:  >= 1.10
+tested-with:    GHC == 7.6.2
+extra-source-files:
+  AUTHORS.md
+  README.md
+  CHANGELOG.md
+
+library
+  ghc-options: -Wall
+  hs-source-dirs: src
+  default-language: Haskell2010
+
+  build-depends:
+    array >= 0.2 && < 0.5,
+    base >= 4.5 && < 6,
+    containers >= 0.2.0.1,
+    data-default >= 0.5 && < 0.6,
+    ghc-prim,
+    mtl >= 1.1 && < 2.2,
+    process == 1.1.*,
+    temporary == 1.1.*,
+    transformers == 0.3.*,
+    unordered-containers == 0.2.*
+
+  exposed-modules:
+    Ersatz
+    Ersatz.Bit
+    Ersatz.Bits
+    Ersatz.Decoding
+    Ersatz.Equatable
+    Ersatz.Encoding
+    Ersatz.Internal.Circuit
+    Ersatz.Internal.Formula
+    Ersatz.Internal.Literal
+    Ersatz.Monad
+    Ersatz.Problem
+    Ersatz.Solution
+    Ersatz.Solver
+    Ersatz.Solver.Minisat
+    Ersatz.Variable
+
+  other-modules:
+    Ersatz.Internal.Parser
+    Ersatz.Internal.StableName
+
+test-suite properties
+  type: exitcode-stdio-1.0
+  ghc-options: -Wall
+  default-language: Haskell2010
+  build-depends:
+    ersatz,
+    base >= 4 && < 6,
+    mtl >= 1.1 && < 2.2,
+    transformers == 0.3.*,
+    containers >= 0.2.0.1,
+    array >= 0.2 && < 0.5,
+    data-reify >= 0.5 && < 0.7,
+    test-framework >= 0.2.4 && < 0.9,
+    test-framework-quickcheck >= 0.2.4 && < 0.4,
+    test-framework-hunit >= 0.2.4 && < 0.4,
+    QuickCheck >= 1.2.0.0 && < 2.6,
+    HUnit >= 1.2.2.1 && < 1.3
+
+  hs-source-dirs: tests
+  Main-is: properties.hs
+
+test-suite doctests
+  type:    exitcode-stdio-1.0
+  main-is: doctests.hs
+  default-language: Haskell2010
+  build-depends:
+    base < 5,
+    directory >= 1.0,
+    doctest >= 0.9.1,
+    filepath
+  ghc-options: -Wall -threaded
+  if impl(ghc<7.6.1)
+    ghc-options: -Werror
+  hs-source-dirs: tests