diff --git a/Control/Monad/Coroutine.hs b/Control/Monad/Coroutine.hs
new file mode 100644
--- /dev/null
+++ b/Control/Monad/Coroutine.hs
@@ -0,0 +1,214 @@
+{- 
+    Copyright 2009-2010 Mario Blazevic
+
+    This file is part of the Streaming Component Combinators (SCC) project.
+
+    The SCC project is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+    License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+    version.
+
+    SCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty
+    of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along with SCC.  If not, see
+    <http://www.gnu.org/licenses/>.
+-}
+
+-- | This module defines the 'Coroutine' monad transformer.
+-- 
+-- A 'Coroutine' monadic computation can 'suspend' its execution at any time, returning control to its invoker. The
+-- returned coroutine suspension is a 'Functor' containing the resumption of the coroutine. Here is an example of a
+-- coroutine in the 'IO' monad that suspends computation using the functor 'Yield' from the
+-- "Control.Monad.Coroutine.SuspensionFunctors" module:
+-- 
+-- @
+-- producer :: Coroutine (Yield Int) IO String
+-- producer = do yield 1
+--               lift (putStrLn \"Produced one, next is four.\")
+--               yield 4
+--               return \"Finished\"
+-- @
+-- 
+-- To continue the execution of a suspended 'Coroutine', apply its 'resume' method. The easiest way to run a coroutine
+-- to completion is by using the 'pogoStick' function, which keeps resuming the coroutine in trampolined style until it
+-- completes. Here is an example of 'pogoStick' applied to the /producer/ example above:
+-- 
+-- @
+-- printProduce :: Show x => Coroutine (Yield x) IO r -> IO r
+-- printProduce producer = pogoStick (\\(Yield x cont) -> lift (print x) >> cont) producer
+-- @
+-- 
+-- Multiple concurrent coroutines can be run as well, and this module provides two different ways. The function 'seesaw'
+-- can be used to run two interleaved computations. Another possible way is to use the functions 'couple' or 'merge' to
+-- weave together steps of different coroutines into a single coroutine, which can then be executed by 'pogoStick'.
+-- 
+-- For other uses of trampoline-style coroutines, see
+-- 
+-- > Trampolined Style - Ganz, S. E. Friedman, D. P. Wand, M, ACM SIGPLAN NOTICES, 1999, VOL 34; NUMBER 9, pages 18-27
+-- 
+-- and
+-- 
+-- > The Essence of Multitasking - William L. Harrison, Proceedings of the 11th International Conference on Algebraic
+-- > Methodology and Software Technology, volume 4019 of Lecture Notes in Computer Science, 2006
+
+{-# LANGUAGE ScopedTypeVariables, Rank2Types, EmptyDataDecls #-}
+
+module Control.Monad.Coroutine
+   (
+    -- * Coroutine definition
+    Coroutine(Coroutine),
+    resume, suspend,
+    -- * Coroutine operations
+    mapMonad, mapSuspension, 
+    -- * Running Coroutine computations
+    Naught, runCoroutine, pogoStick, foldRun, seesaw, SeesawResolver(..),
+    -- * Nested and coupled Coroutine computations
+    NestedFunctor (NestedFunctor), SomeFunctor(..), nest,
+    couple, merge
+   )
+where
+
+import Control.Monad (liftM, when)
+import Control.Monad.Trans (MonadTrans(..), MonadIO(..))
+import Data.Either (either, partitionEithers)
+import Data.Traversable (Traversable, sequence)
+
+import Control.Monad.Parallel
+
+-- | Suspending, resumable monadic computations.
+newtype Coroutine s m r = Coroutine {
+   -- | Run the next step of a `Coroutine` computation. The result of the step execution will be either a suspension or
+   -- the final coroutine result.
+   resume :: m (Either (s (Coroutine s m r)) r)
+   }
+
+type CoroutineStepResult s m r = Either (s (Coroutine s m r)) r
+
+instance (Functor s, Monad m) => Monad (Coroutine s m) where
+   return x = Coroutine (return (Right x))
+   t >>= f = Coroutine (resume t >>= apply f)
+      where apply f (Right x) = resume (f x)
+            apply f (Left s) = return (Left (fmap (>>= f) s))
+--   t >>= f = Coroutine (resume t >>= either (return . Left . fmap (>>= f)) (resume . f))
+
+instance (Functor s, MonadParallel m) => MonadParallel (Coroutine s m) where
+   bindM2 f t1 t2 = Coroutine (bindM2 combine (resume t1) (resume t2)) where
+      combine (Right x) (Right y) = resume (f x y)
+      combine (Left s) (Right y) = return $ Left (fmap (flip f y =<<) s)
+      combine (Right x) (Left s) = return $ Left (fmap (f x =<<) s)
+      combine (Left s1) (Left s2) = return $ Left (fmap (bindM2 f $ suspend s1) s2)
+
+instance Functor s => MonadTrans (Coroutine s) where
+   lift = Coroutine . liftM Right
+
+instance (Functor s, MonadIO m) => MonadIO (Coroutine s m) where
+   liftIO = lift . liftIO
+
+-- | The 'Naught' functor instance doesn't contain anything and cannot be constructed. Used for building non-suspendable
+-- coroutines.
+data Naught x
+instance Functor Naught where
+   fmap f _ = undefined
+
+-- | Combines two functors into one, applying both.
+newtype NestedFunctor l r x = NestedFunctor (l (r x))
+instance (Functor l, Functor r) => Functor (NestedFunctor l r) where
+   fmap f (NestedFunctor lr) = NestedFunctor ((fmap . fmap) f lr)
+
+-- | Combines two functors into one, applying either or both of them. Used for coupled coroutines.
+data SomeFunctor l r x = LeftSome (l x) | RightSome (r x) | Both (NestedFunctor l r x)
+instance (Functor l, Functor r) => Functor (SomeFunctor l r) where
+   fmap f (LeftSome l) = LeftSome (fmap f l)
+   fmap f (RightSome r) = RightSome (fmap f r)
+   fmap f (Both lr) = Both (fmap f lr)
+
+-- | Combines two values under two functors into a pair of values under a single 'NestedFunctor'.
+nest :: (Functor a, Functor b) => a x -> b y -> NestedFunctor a b (x, y)
+nest a b = NestedFunctor $ fmap (\x-> fmap ((,) x) b) a
+
+-- | Suspend the current 'Coroutine'.
+suspend :: (Monad m, Functor s) => s (Coroutine s m x) -> Coroutine s m x
+suspend s = Coroutine (return (Left s))
+
+-- | Change the base monad of a 'Coroutine'.
+mapMonad :: forall s m m' x. (Functor s, Monad m, Monad m') =>
+            (forall x. m x -> m' x) -> Coroutine s m x -> Coroutine s m' x
+mapMonad f cort = Coroutine {resume= liftM map' (f $ resume cort)}
+   where map' (Right r) = Right r
+         map' (Left s) = Left (fmap (mapMonad f) s)
+
+-- | Change the suspension functor of a 'Coroutine'.
+mapSuspension :: forall s s' m x. (Functor s, Monad m) => (forall x. s x -> s' x) -> Coroutine s m x -> Coroutine s' m x
+mapSuspension f cort = Coroutine {resume= liftM map' (resume cort)}
+   where map' (Right r) = Right r
+         map' (Left s) = Left (f $ fmap (mapSuspension f) s)
+
+-- | Convert a non-suspending 'Coroutine' to the base monad.
+runCoroutine :: Monad m => Coroutine Naught m x -> m x
+runCoroutine = pogoStick (error "runCoroutine can run only a non-suspending coroutine!")
+
+-- | Run a suspendable 'Coroutine', using a function that extracts the coroutine resumption from each suspension.
+pogoStick :: Monad m => (s (Coroutine s m x) -> Coroutine s m x) -> Coroutine s m x -> m x
+pogoStick reveal t = resume t
+                     >>= \s-> case s 
+                              of Right result -> return result
+                                 Left c -> pogoStick reveal (reveal c)
+
+-- | Runs a suspendable coroutine much like 'pogoStick', but allows the resumption function to thread an arbitrary
+-- state as well.
+foldRun :: Monad m => (a -> s (Coroutine s m x) -> (a, Coroutine s m x)) -> a -> Coroutine s m x -> m (a, x)
+foldRun f a t = resume t
+                >>= \s-> case s 
+                         of Right result -> return (a, result)
+                            Left c -> uncurry (foldRun f) (f a c)
+
+-- | Weaves two coroutines into one. The two coroutines suspend and resume in lockstep.
+couple :: forall s1 s2 m x y r. (Monad m, Functor s1, Functor s2) => 
+          (forall x y r. (x -> y -> m r) -> m x -> m y -> m r)
+       -> Coroutine s1 m x -> Coroutine s2 m y -> Coroutine (SomeFunctor s1 s2) m (x, y)
+couple runPair t1 t2 = Coroutine{resume= runPair proceed (resume t1) (resume t2)} where
+   proceed :: CoroutineStepResult s1 m x -> CoroutineStepResult s2 m y -> m (CoroutineStepResult (SomeFunctor s1 s2) m (x, y))
+   proceed (Right x) (Right y) = return $ Right (x, y)
+   proceed (Left s1) (Left s2) = return $ Left $ fmap (uncurry (couple runPair)) (Both $ nest s1 s2)
+   proceed (Right x) (Left s2) = return $ Left $ fmap (couple runPair (return x)) (RightSome s2)
+   proceed (Left s1) (Right y) = return $ Left $ fmap (flip (couple runPair) (return y)) (LeftSome s1)
+
+-- | Weaves a list of coroutines with the same suspension functor type into a single coroutine. The coroutines suspend
+-- and resume in lockstep.
+merge :: forall s m x. (Monad m, Functor s) =>
+         (forall x. [m x] -> m [x]) -> (forall x. [s x] -> s [x])
+      -> [Coroutine s m x] -> Coroutine s m [x]
+merge sequence1 sequence2 corts = Coroutine{resume= liftM step $ sequence1 (map resume corts)} where
+   step :: [CoroutineStepResult s m x] -> CoroutineStepResult s m [x]
+   step list = case partitionEithers list
+               of ([], ends) -> Right ends
+                  (suspensions, ends) -> Left $ fmap (merge sequence1 sequence2 . (map return ends ++)) $
+                                         sequence2 suspensions
+
+-- | A simple record containing the resolver functions for all possible coroutine pair suspensions.
+data SeesawResolver s1 s2 = SeesawResolver {
+   resumeLeft  :: forall t. s1 t -> t,    -- ^ resolves the left suspension functor into the resumption it contains
+   resumeRight :: forall t. s2 t -> t,    -- ^ resolves the right suspension into its resumption
+   resumeAny   :: forall t1 t2 r.
+                  (t1 -> r)       --  ^ continuation to resume only the left suspended coroutine
+               -> (t2 -> r)       --  ^ continuation to resume the right coroutine only
+               -> (t1 -> t2 -> r) --  ^ continuation to resume both coroutines
+               -> s1 t1           --  ^ left suspension
+               -> s2 t2           --  ^ right suspension
+               -> r
+   -- ^ invoked when both coroutines are suspended, resolves both suspensions or either one
+}
+
+-- | Runs two coroutines concurrently. The first argument is used to run the next step of each coroutine, the next to
+-- convert the left, right, or both suspensions into the corresponding resumptions.
+seesaw :: (Monad m, Functor s1, Functor s2) => 
+          (forall x y r. (x -> y -> m r) -> m x -> m y -> m r)
+       -> SeesawResolver s1 s2
+       -> Coroutine s1 m x -> Coroutine s2 m y -> m (x, y)
+seesaw runPair resolver t1 t2 = seesaw' t1 t2 where
+   seesaw' t1 t2 = runPair proceed (resume t1) (resume t2)
+   proceed (Right x) (Right y) = return (x, y)
+   proceed (Right x) (Left s2) = seesaw' (return x) (resumeRight resolver s2)
+   proceed (Left s1) (Right y) = seesaw' (resumeLeft resolver s1) (return y)
+   proceed (Left s1) (Left s2) =
+      resumeAny resolver (flip seesaw' (suspend s2)) (seesaw' (suspend s1)) seesaw' s1 s2
diff --git a/Control/Monad/Coroutine/Nested.hs b/Control/Monad/Coroutine/Nested.hs
new file mode 100644
--- /dev/null
+++ b/Control/Monad/Coroutine/Nested.hs
@@ -0,0 +1,111 @@
+{- 
+    Copyright 2010 Mario Blazevic
+
+    This file is part of the Streaming Component Combinators (SCC) project.
+
+    The SCC project is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+    License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+    version.
+
+    SCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty
+    of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along with SCC.  If not, see
+    <http://www.gnu.org/licenses/>.
+-}
+
+-- | This module defines nestable suspension functors for use with the 'Coroutine' monad transformer, as well as
+-- functions for running nested coroutines of this sort.
+-- 
+-- Coroutines can be run from within another coroutine. In this case, the nested coroutines always suspend to their
+-- invoker. If a function from this module, such as 'pogoStickNested', is used to run a nested coroutine, the parent
+-- coroutine can be automatically suspended as well. A single suspension can thus suspend an entire chain of nested
+-- coroutines.
+-- 
+-- Nestable coroutines of this kind should group their suspension functors into an 'EitherFunctor'. You can adjust a
+-- normal suspension, such as the one produced by 'yield', using functions 'mapSuspension' and 'liftOut'. To run nested
+-- coroutines, use functions 'pogoStickNested', 'seesawNested', and 'coupleNested'.
+
+{-# LANGUAGE ScopedTypeVariables, Rank2Types, MultiParamTypeClasses, TypeFamilies,
+             FlexibleContexts, FlexibleInstances, OverlappingInstances, UndecidableInstances
+ #-}
+
+module Control.Monad.Coroutine.Nested
+   (
+    pogoStickNested, coupleNested, seesawNested, 
+    AncestorFunctor,
+    liftOut
+   )
+where
+
+import Control.Monad (join, liftM)
+import Control.Monad.Trans (lift)
+
+import Control.Monad.Coroutine
+import Control.Monad.Coroutine.SuspensionFunctors
+
+-- | Run a nested 'Coroutine' that can suspend both itself and the current 'Coroutine'.
+pogoStickNested :: forall s1 s2 m x. (Functor s1, Functor s2, Monad m) => 
+                   (s2 (Coroutine (EitherFunctor s1 s2) m x) -> Coroutine (EitherFunctor s1 s2) m x)
+                   -> Coroutine (EitherFunctor s1 s2) m x -> Coroutine s1 m x
+pogoStickNested reveal t = 
+   Coroutine{resume= resume t
+                      >>= \s-> case s
+                               of Right result -> return (Right result)
+                                  Left (LeftF s) -> return (Left (fmap (pogoStickNested reveal) s))
+                                  Left (RightF c) -> resume (pogoStickNested reveal (reveal c))}
+
+-- | Weaves two nested coroutines into one.
+coupleNested :: forall s0 s1 s2 m x y r. (Monad m, Functor s0, Monad s0, Functor s1, Functor s2) => 
+                (forall x y r. (x -> y -> m r) -> m x -> m y -> m r)
+             -> Coroutine (EitherFunctor s0 s1) m x -> Coroutine (EitherFunctor s0 s2) m y
+             -> Coroutine (EitherFunctor s0 (SomeFunctor s1 s2)) m (x, y)
+coupleNested runPair = coupleNested' where
+   coupleNested' t1 t2 = Coroutine{resume= runPair (\ st1 st2 -> return (proceed st1 st2)) (resume t1) (resume t2)}
+   proceed (Right x) (Right y) = Right (x, y)
+   proceed (Left (RightF s)) (Right y) = Left $ RightF $ fmap (flip coupleNested' (return y)) (LeftSome s)
+   proceed (Right x) (Left (RightF s)) = Left $ RightF $ fmap (coupleNested' (return x)) (RightSome s)
+   proceed (Left (RightF s1)) (Left (RightF s2)) =
+      Left $ RightF $ fmap (uncurry coupleNested') (Both $ nest s1 s2)
+   proceed l (Left (LeftF s)) = Left $ LeftF $ fmap (coupleNested' (Coroutine $ return l)) s
+   proceed (Left (LeftF s)) r = Left $ LeftF $ fmap (flip coupleNested' (Coroutine $ return r)) s
+
+-- | Like 'seesaw', but for nested coroutines that are allowed to suspend the current coroutine as well as themselves.
+-- If both coroutines try to suspend the current coroutine in the same step, the left coroutine's suspension will have
+-- precedence.
+seesawNested :: (Monad m, Functor s0, Functor s1, Functor s2) =>
+                (forall x y r. (x -> y -> m r) -> m x -> m y -> m r)
+             -> SeesawResolver s1 s2
+             -> Coroutine (EitherFunctor s0 s1) m x -> Coroutine (EitherFunctor s0 s2) m y -> Coroutine s0 m (x, y)
+seesawNested runPair resolver t1 t2 = seesaw' t1 t2 where
+   seesaw' t1 t2 = Coroutine{resume= bouncePair t1 t2}
+   bouncePair t1 t2 = runPair proceed (resume t1) (resume t2)
+   proceed (Left (LeftF s1)) state2 = return $ Left $ fmap ((flip seesaw' (Coroutine $ return state2))) s1
+   proceed state1 (Left (LeftF s2)) = return $ Left $ fmap (seesaw' (Coroutine $ return state1)) s2
+   proceed (Right x) (Right y) = return $ Right (x, y)
+   proceed state1@(Right x) (Left (RightF s2)) = proceed state1 =<< resume (resumeRight resolver s2)
+   proceed (Left (RightF s1)) state2@(Right y) = flip proceed state2 =<< resume (resumeLeft resolver s1)
+   proceed state1@(Left (RightF s1)) state2@(Left (RightF s2)) =
+      resumeAny resolver ((flip proceed state2 =<<) . resume) ((proceed state1 =<<) . resume) bouncePair s1 s2
+
+-- | Class of functors that can contain another functor.
+class Functor c => ChildFunctor c where
+   type Parent c :: * -> *
+   wrap :: Parent c x -> c x
+instance (Functor p, Functor s) => ChildFunctor (EitherFunctor p s) where
+   type Parent (EitherFunctor p s) = p
+   wrap = LeftF
+
+-- | Class of functors that can be lifted.
+class (Functor a, Functor d) => AncestorFunctor a d where
+   -- | Convert the ancestor functor into its descendant. The descendant functor typically contains the ancestor.
+   liftFunctor :: a x -> d x
+
+instance Functor a => AncestorFunctor a a where
+   liftFunctor = id
+instance (Functor a, ChildFunctor d, d' ~ Parent d, AncestorFunctor a d') => AncestorFunctor a d where
+   liftFunctor = wrap . (liftFunctor :: a x -> d' x)
+
+-- | Converts a coroutine into a descendant nested coroutine.
+liftOut :: forall m a d x. (Monad m, Functor a, AncestorFunctor a d) => Coroutine a m x -> Coroutine d m x
+liftOut cort = mapSuspension liftFunctor cort
diff --git a/Control/Monad/Coroutine/SuspensionFunctors.hs b/Control/Monad/Coroutine/SuspensionFunctors.hs
new file mode 100644
--- /dev/null
+++ b/Control/Monad/Coroutine/SuspensionFunctors.hs
@@ -0,0 +1,62 @@
+{- 
+    Copyright 2010 Mario Blazevic
+
+    This file is part of the Streaming Component Combinators (SCC) project.
+
+    The SCC project is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+    License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+    version.
+
+    SCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty
+    of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along with SCC.  If not, see
+    <http://www.gnu.org/licenses/>.
+-}
+
+-- | This module defines suspension functors for use with the "Control.Monad.Coroutine" module.
+-- 
+
+module Control.Monad.Coroutine.SuspensionFunctors
+   (
+    -- * Suspension functors
+    Yield(Yield), Await(Await), Request(Request), EitherFunctor(LeftF, RightF),
+    yield, await, request
+   )
+where
+
+import Control.Monad (Monad)
+import Control.Monad.Coroutine (Coroutine, resume, suspend)
+
+-- | The 'Yield' functor instance is equivalent to (,) but more descriptive.
+data Yield x y = Yield x y
+instance Functor (Yield x) where
+   fmap f (Yield x y) = Yield x (f y)
+
+-- | The 'Await' functor instance is equivalent to (->) but more descriptive.
+newtype Await x y = Await (x -> y)
+instance Functor (Await x) where
+   fmap f (Await g) = Await (f . g)
+
+-- | The 'Request' functor instance combines a 'Yield' of a request with an 'Await' for a response.
+data Request request response x = Request request (response -> x)
+instance Functor (Request x f) where
+   fmap f (Request x g) = Request x (f . g)
+
+-- | Combines two alternative functors into one, applying one or the other. Used for nested coroutines.
+data EitherFunctor l r x = LeftF (l x) | RightF (r x)
+instance (Functor l, Functor r) => Functor (EitherFunctor l r) where
+   fmap f (LeftF l) = LeftF (fmap f l)
+   fmap f (RightF r) = RightF (fmap f r)
+
+-- | Suspend yielding a value.
+yield :: Monad m => x -> Coroutine (Yield x) m ()
+yield x = suspend (Yield x (return ()))
+
+-- | Suspend until a value is provided.
+await :: Monad m => Coroutine (Await x) m x
+await = suspend (Await return)
+
+-- | Suspend yielding a request and awaiting the response.
+request :: Monad m => x -> Coroutine (Request x y) m y
+request x = suspend (Request x return)
diff --git a/LICENSE.txt b/LICENSE.txt
new file mode 100644
--- /dev/null
+++ b/LICENSE.txt
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/Setup.lhs b/Setup.lhs
new file mode 100644
--- /dev/null
+++ b/Setup.lhs
@@ -0,0 +1,4 @@
+#! /usr/bin/env runhaskell
+ 
+> import Distribution.Simple
+> main = defaultMain
diff --git a/TestCoroutine.hs b/TestCoroutine.hs
new file mode 100644
--- /dev/null
+++ b/TestCoroutine.hs
@@ -0,0 +1,122 @@
+{- 
+    Copyright 2010 Mario Blazevic
+
+    This file is part of the Streaming Component Combinators (SCC) project.
+
+    The SCC project is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+    License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+    version.
+
+    SCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty
+    of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along with SCC.  If not, see
+    <http://www.gnu.org/licenses/>.
+-}
+
+-- | The "Control.Monad.Coroutine" tests.
+
+module Main where
+
+import Prelude hiding (sequence)
+import Control.Exception (assert)
+import Control.Monad (liftM, mapM, when)
+import Control.Monad.Identity (runIdentity)
+import Control.Parallel (pseq)
+import Data.List (find)
+import Data.Maybe (fromJust)
+import System.Environment (getArgs)
+
+import Control.Monad.Coroutine
+import Control.Monad.Coroutine.SuspensionFunctors
+import Control.Monad.Coroutine.Nested
+import Control.Monad.Parallel (MonadParallel(..), sequence)
+
+factors n = maybe [n] (\k-> (k : factors (n `div` k))) (find (\k-> n `mod` k == 0) [2 .. n - 1])
+
+fib x 0 | x >= 0 = 1
+fib _ 1 = 1
+fib x n = fib x (n - 2) + fib x (n - 1)
+
+factorFibs :: MonadParallel m => [Int] -> m Integer
+factorFibs nums = liftM snd $
+                  seesaw bindM2 (SeesawResolver resumeLeft resumeRight resumeAny)
+                     (mapM_ (yieldApply (fib 0)) nums)
+                     (factorize 0)
+   where factorize :: MonadParallel m => Integer -> Coroutine (Await (Maybe Integer)) m Integer
+         factorize sum = await
+                         >>= maybe
+                                (return sum)
+                                (\n-> factorize (sum + n {-product (factors n)-}))
+         resumeLeft (Yield _ c) = c
+         resumeRight (Await c) = c Nothing
+         resumeAny _ _ c (Yield x c1) (Await c2) = c c1 (c2 (Just x))
+
+twoFibs :: MonadParallel m => [Int] -> m Integer
+twoFibs nums = liftM (uncurry (+)) $
+               pogoStick
+                  resume
+                  (couple bindM2 (fibs 1) (fibs 2))
+   where resume :: SomeFunctor (Yield Integer) (Yield Integer) c -> c
+         resume (Both (NestedFunctor (Yield n1 (Yield n2 c)))) = assert (n1 == n2) c
+         fibs ix = mapM_ (yieldApply (fib ix)) nums >> return (fib ix $ last nums)
+
+twoFibsSeesaw :: MonadParallel m => [Int] -> m Integer
+twoFibsSeesaw nums = liftM (uncurry (+)) $
+                     seesaw bindM2 resolver (fibs 1) (fibs 2)
+   where resolver = SeesawResolver{
+                      resumeLeft= undefined,
+                      resumeRight= undefined,
+                      resumeAny= \resumeLeft resumeRight resumeBoth (Yield left c1) (Yield right c2)->
+                                 assert (left == right) $ resumeBoth c1 c2
+                    }
+         fibs ix = mapM_ (yieldApply (fib ix)) nums >> return (fib ix $ last nums)
+
+fibs :: MonadParallel m => Int -> [Int] -> m Integer
+fibs coroutineCount nums = liftM sum $
+                           pogoStick
+                              resume
+                              (merge sequence appendYields $ replicateIx coroutineCount fibs)
+   where resume :: Yield [Integer] (Coroutine (Yield [Integer]) m [Integer]) -> Coroutine (Yield [Integer]) m [Integer]
+         resume (Yield (x:xs) c) = assert (all (==x) xs) c
+         fibs ix = mapM_ (yieldApply ((:[]) . fib ix)) nums >> return (fib ix $ last nums)
+         appendYields :: [Yield [s] x] -> Yield [s] [x]
+         appendYields yields = uncurry Yield $ foldr (\(Yield s x) (ss, xs)-> (s ++ ss, x:xs)) ([], []) yields
+
+yieldApply f n = let result = f n in result `pseq` yield result
+
+replicateIx :: Int -> (Int -> x) -> [x]
+replicateIx n f = map f [1..n]
+
+nested :: (Monad m, Functor p) =>
+          Int -> (Integer -> Coroutine p m ()) -> Coroutine (EitherFunctor p (Yield Integer)) m ()
+nested level suspendParent = do mapSuspension RightF (yield 1)
+                                liftOut (suspendParent 2)
+                                when (level > 0) (pogoStickNested cont $ nested (pred level) (liftOut . suspendParent))
+   where cont (Yield x c) = c
+
+main = do args <- getArgs
+          if length args /= 4
+             then putStr help
+             else do let [taskName, monad, size, coroutineCount] = args
+                         task :: MonadParallel m => m Integer
+                         task = case taskName of "fib-factor" -> factorFibs [1 .. read size]
+                                                 "2fibs" -> twoFibs [1 .. read size]
+                                                 "2fibsSeesaw" -> twoFibsSeesaw [1 .. read size]
+                                                 "fibs" -> fibs (read coroutineCount) [1 .. read size]
+                                                 "nested" -> liftM fst $ foldRun add 0 (nested (read size) yield)
+                                                    where add s (LeftF (Yield n c)) = (s + n, c)
+                                                          add s (RightF (Yield n c)) = (s + 10 * n, c)
+                                                 _ -> error (help ++ "Bad task.")
+                     result <- case monad of "Maybe" -> return $ fromJust task
+                                             "[]" -> return $ head task
+                                             "Identity" -> return $ runIdentity task
+                                             "IO" -> task
+                                             _ -> error (help ++ "Bad monad.")
+                     print result
+
+help = "Usage: test-coroutine <task> <monad> <size> <coroutines>?\n"
+       ++ "  where <task>       is 'fib-factor' or 'fibs',\n"
+       ++ "        <monad>      is 'Identity', 'Maybe', '[]', or 'IO',\n"
+       ++ "        <size>       is the size of the task,\n"
+       ++ "    and <coroutines> is the number of coroutines to employ.\n"
diff --git a/monad-coroutine.cabal b/monad-coroutine.cabal
new file mode 100644
--- /dev/null
+++ b/monad-coroutine.cabal
@@ -0,0 +1,27 @@
+Name:                monad-coroutine
+Version:             0.5
+Cabal-Version:       >= 1.2
+Build-Type:          Simple
+Synopsis:            Coroutine monad transformer for suspending and resuming monadic computations
+Category:            Concurrency, Control, Monads
+Tested-with:         GHC
+Description:
+  This package defines a monad transformer, applicable to any monad, that allows the monadic computation to suspend and
+  to be later resumed. The transformer is parameterized by an arbitrary functor, used to store the suspended
+  computation's resumption.
+  
+License:             GPL
+License-file:        LICENSE.txt
+Copyright:           (c) 2010 Mario Blazevic
+Author:              Mario Blazevic
+Maintainer:          blamario@yahoo.com
+Homepage:            http://trac.haskell.org/SCC/wiki/monad-coroutine
+Extra-source-files:  TestCoroutine.hs
+-- Source-repository head
+--   type:              darcs
+--   location:          http://code.haskell.org/SCC/
+
+Library
+  Exposed-Modules:   Control.Monad.Coroutine, Control.Monad.Coroutine.SuspensionFunctors, Control.Monad.Coroutine.Nested
+  Build-Depends:     base < 5, monad-parallel, transformers
+  GHC-prof-options:  -auto-all