Cabal revisions of constrained-normal-1.0.0

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

-Name:                constrained-normal-Version:             1.0.0-Synopsis:            Normalised Deep Embeddings for Constrained Type-Class Instances-Description:	     The package provides normal forms for monads and related structures, similarly to the Operational package.-                     The difference is that we parameterise the normal forms on a constraint, and apply that constraint to all-                     existential types within the normal form.-                     This allows monad (and other) instances to be generated for underlying types that require constraints on-                     their return-like and bind-like operations, e.g. Set.-                     .-                     This is documented in the following paper:-                     .-                     The Constrained-Monad Problem.  Neil Sculthorpe and Jan Bracker and George Giorgidze and Andy Gill.  2013.-                     <http://www.ittc.ku.edu/~neil/papers_and_talks/constrained-monad-problem.pdf>-                     .-                     The functionality exposed by this library is also used internally by the Set-Monad and RMonad packages.--Category:            Control-License:             BSD3-License-file:        LICENSE-Author:              Neil Sculthorpe-Maintainer:          Neil Sculthorpe <neil@ittc.ku.edu>-Copyright:           (c) 2013 The University of Kansas-Homepage:            http://www.ittc.ku.edu/csdl/fpg/theory/constrained-monad-problem.html-Stability:	     alpha-build-type: 	     Simple-Cabal-Version:       >= 1.6--Library-  Build-Depends: base >= 4.5 && < 5-  Ghc-Options: -Wall-  Exposed-modules:-       Control.Monad.ConstrainedNormal-----+Name:                constrained-normal
+Version:             1.0.0
+x-revision: 1
+Synopsis:            Normalised Deep Embeddings for Constrained Type-Class Instances
+Description:	     The package provides normal forms for monads and related structures, similarly to the Operational package.
+                     The difference is that we parameterise the normal forms on a constraint, and apply that constraint to all
+                     existential types within the normal form.
+                     This allows monad (and other) instances to be generated for underlying types that require constraints on
+                     their return-like and bind-like operations, e.g. Set.
+                     .
+                     This is documented in the following paper:
+                     .
+                     The Constrained-Monad Problem.  Neil Sculthorpe and Jan Bracker and George Giorgidze and Andy Gill.  2013.
+                     <http://dx.doi.org/10.1145/2500365.2500602>
+                     .
+                     The functionality exposed by this library is also used internally by the Set-Monad and RMonad packages.
+
+Category:            Control
+License:             BSD3
+License-file:        LICENSE
+Author:              Neil Sculthorpe
+Maintainer:          Neil Sculthorpe <neil.sculthorpe@ntu.ac.uk>
+Copyright:           (c) 2013 The University of Kansas
+Homepage:            http://www.ittc.ku.edu/csdl/fpg/theory/constrained-monad-problem.html
+Stability:	     alpha
+build-type: 	     Simple
+Cabal-Version:       >= 1.6
+
+Library
+  Build-Depends: base >= 4.5 && < 5
+  Ghc-Options: -Wall
+  Exposed-modules:
+       Control.Monad.ConstrainedNormal
+
+
+
+
+