CC-delcont-cxe 0.1.0.1 → 0.1.0.2

raw patch · 2 files changed

+6/−6 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• CC-delcont-cxe.cabal +5/−5
• Control/Monad/CC/CCCxe.hs +1/−1

@@ -1,5 +1,5 @@ name:               CC-delcont-cxe
-version:            0.1.0.1
+version:            0.1.0.2
 author:             Oleg Kiselyov
 maintainer:         shelarcy <shelarcy@gmail.com>
 license:            BSD3
@@ -15,13 +15,13 @@                        JFP, v17, N6, pp. 687--730, 2007.
                        <http://www.cs.indiana.edu/cgi-bin/techreports/TRNNN.cgi?trnum=TR615>
                     .
-                    This library's "Control.Monad.CC.CCcxe" is derived as a CPS version of
+                    This library's "Control.Monad.CC.CCCxe" is derived as a CPS version of
                     <http://hackage.haskell.org/package/CC-delcont-exc>'s Control.Monad.CC.CCExc.
-                    "Control.Monad.CC.CCcxe" is sometimes more efficient; it is always less perspicuous.
+                    "Control.Monad.CC.CCCxe" is sometimes more efficient; it is always less perspicuous.
                     Both libraries provide the identical interface and are interchangeable. It seems
                     that CC-delcont-exc's  Control.Monad.CC.CCExc is faster at delimited control but
-                    imposes more overhead on the conventional code; "Control.Monad.CC.CCcxe" is dual.
-                    It pays to use "Control.Monad.CC.CCcxe" in code with long stretches of determinism
+                    imposes more overhead on the conventional code; "Control.Monad.CC.CCCxe" is dual.
+                    It pays to use "Control.Monad.CC.CCCxe" in code with long stretches of determinism
                     punctuated by fits and restarts.
                     .
                     See the original article at <http://okmij.org/ftp/continuations/implementations.html#CC-monads>

@@ -182,7 +182,7 @@   P2 (Either (CCT (P2 w1 w2) m x w1) (CCT (P2 w1 w2) m x w2))  --- | There are two generalized prompts of the flavor P2"+-- | There are two generalized prompts of the flavor P2 p2L :: Prompt (P2 w1 w2) m w1 p2L = (inj, prj)  where