Cabal revisions of tfp-0.8

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

-name:           tfp-version:        0.8-build-type:     Simple-license:        BSD3-license-file:   LICENSE-copyright:      Copyright (c) 2013 Henning Thielemann, 2008 Peter Gavin-author:         Peter Gavin, Henning Thielemann-maintainer:     haskell@henning-thielemann.de-homepage:       http://www.haskell.org/haskellwiki/Type_arithmetic-stability:      alpha-synopsis:       Type-level integers, booleans, lists using type families-description:-  TFP is an abbreviation for Type Family Programming.-  It provides implementations of type-level integers and booleans,-  and (eventually) simple type-level data structures.-  It uses type families as functions to produce new types,-  which provides an intuitive way to parameterize data types-  and functions on numerical values at compile time.-category:       Type System-tested-with:    GHC == 7.4.2, GHC == 7.6.3-cabal-version:  >= 1.14--source-repository head-  type:         darcs-  location:     http://code.haskell.org/~thielema/tfp/--source-repository this-  tag:          0.8-  type:         darcs-  location:     http://code.haskell.org/~thielema/tfp/---flag build-test-  description: Build the tfp-test test program-  default: False--library {-  default-language: Haskell2010-  build-depends:  base >= 3.0 && < 5-  ghc-options:    -Wall-  hs-source-dirs: src-  exposed-modules:-    Data.SizedInt-    Data.SizedWord-    Types-    Types.Base-    Types.Data.Bool-    Types.Data.Num-    Types.Data.Num.Ops-    Types.Data.Num.Decimal-    Types.Data.Num.Decimal.Literals-    Types.Data.Num.Decimal.Digits-    Types.Data.List-    Types.Data.Ord-  other-modules:-    Types.Data.Num.Decimal.Ops-}---executable tfp-test {-  if flag(build-test) {-    buildable: True-    build-depends:-      tfp,-      QuickCheck >= 1.2.0.0,-      base >= 3.0 && < 5-  } else {-    buildable: False-  }-  default-language: Haskell2010-  ghc-options:    -Wall-  main-is: Test.hs-  hs-source-dirs: test-}+name:           tfp
+version:        0.8
+x-revision: 1
+build-type:     Simple
+license:        BSD3
+license-file:   LICENSE
+copyright:      Copyright (c) 2013 Henning Thielemann, 2008 Peter Gavin
+author:         Peter Gavin, Henning Thielemann
+maintainer:     haskell@henning-thielemann.de
+homepage:       http://www.haskell.org/haskellwiki/Type_arithmetic
+stability:      alpha
+synopsis:       Type-level integers, booleans, lists using type families
+description:
+  TFP is an abbreviation for Type Family Programming.
+  It provides implementations of type-level integers and booleans,
+  and (eventually) simple type-level data structures.
+  It uses type families as functions to produce new types,
+  which provides an intuitive way to parameterize data types
+  and functions on numerical values at compile time.
+category:       Type System
+tested-with:    GHC == 7.4.2, GHC == 7.6.3
+cabal-version:  >= 1.14
+
+source-repository head
+  type:         darcs
+  location:     http://code.haskell.org/~thielema/tfp/
+
+source-repository this
+  tag:          0.8
+  type:         darcs
+  location:     http://code.haskell.org/~thielema/tfp/
+
+
+flag build-test
+  description: Build the tfp-test test program
+  default: False
+
+library {
+  default-language: Haskell2010
+  build-depends:  base >= 4.4 && < 5
+  ghc-options:    -Wall
+  hs-source-dirs: src
+  exposed-modules:
+    Data.SizedInt
+    Data.SizedWord
+    Types
+    Types.Base
+    Types.Data.Bool
+    Types.Data.Num
+    Types.Data.Num.Ops
+    Types.Data.Num.Decimal
+    Types.Data.Num.Decimal.Literals
+    Types.Data.Num.Decimal.Digits
+    Types.Data.List
+    Types.Data.Ord
+  other-modules:
+    Types.Data.Num.Decimal.Ops
+}
+
+
+executable tfp-test {
+  if flag(build-test) {
+    buildable: True
+    build-depends:
+      tfp,
+      QuickCheck >= 1.2.0.0,
+      base >= 3.0 && < 5
+  } else {
+    buildable: False
+  }
+  default-language: Haskell2010
+  ghc-options:    -Wall
+  main-is: Test.hs
+  hs-source-dirs: test
+}