diff --git a/LICENSE b/LICENSE
new file mode 100644
--- /dev/null
+++ b/LICENSE
@@ -0,0 +1,165 @@
+		   GNU LESSER 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.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser 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
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
diff --git a/Setup.hs b/Setup.hs
new file mode 100644
--- /dev/null
+++ b/Setup.hs
@@ -0,0 +1,4 @@
+module Main where
+
+import Distribution.Simple
+main = defaultMain
diff --git a/data-clist.cabal b/data-clist.cabal
new file mode 100644
--- /dev/null
+++ b/data-clist.cabal
@@ -0,0 +1,27 @@
+Name: data-clist
+Synopsis: Simple functional ring type.
+Description: Simple functional bidirectional ring type.
+
+             Given that the ring terminiology
+             clashes with certain mathematical branches, we're using the term
+             CList or CircularList instead.
+Version: 0.0.1
+License: LGPL
+License-File: LICENSE
+Author: John Van Enk <vanenkj@gmail.com>
+Maintainer: John Van Enk <vanenkj@gmail.com>
+Stability: experimental
+Category: Data Structures
+Cabal-Version: >= 1.6
+Build-Type: Simple
+Package-URL: http://github.com/sw17ch/data-ring
+
+Library
+    Build-Depends: base >= 4 && < 5,
+                   QuickCheck >= 2.1 && < 2.2
+
+    Exposed-Modules:
+        Data.CircularList
+
+    ghc-options:        -Wall
+    hs-source-dirs:     src
diff --git a/src/Data/CircularList.hs b/src/Data/CircularList.hs
new file mode 100644
--- /dev/null
+++ b/src/Data/CircularList.hs
@@ -0,0 +1,218 @@
+{- |
+A simple purely functional circular list, or ring, data type.
+
+Lets describe what we mean by 'ring'. A ring is a circular data structure
+such that if you continue rotating the ring, you'll eventually return to
+the element you first observed.
+
+All of our analogies involve sitting at a table who's top surface rotates
+about its center axis (think of those convenient rotating platforms one
+often finds in an (Americanized) Chinese Restaurant).
+
+Only the closest item on the table is avialable to us. In order to reach
+other elements on the table, we need to rotate the table to the left or 
+the right.
+
+Our convention for this problem says that rotations to the right are a
+forward motion while rotations to the left are backward motions.
+
+We'll use the following circular list for our examples:
+
+>   8 7 6
+>  9     5
+> A       4
+> B       3
+>  C     2
+>   D 0 1
+>     ^
+
+The pointer at the bottom represents our position at the table. The element
+currently in front of is is referred to as the `focus`. So, in this case, our
+focus is 0.
+
+If we were to rotate the table to the right using the `rotR` operation, we'd
+have the following table.
+
+>   9 8 7
+>  A     6
+> B       5
+> C       4
+>  D     3
+>   0 1 2
+>     ^
+
+This yeilds 1 as our new focus. Rotating this table left would return 0 to the
+focus position.
+
+-}
+module Data.CircularList (
+    -- * Data Types
+    CList,
+    -- * Functions
+    -- ** Creation of CLists
+    empty, fromList,
+    -- ** Converting CLists to Lists
+    leftElements, rightElements, toList, toInfList,
+    -- ** Extraction and Accumulation
+    focus, insertL, insertR,
+    removeL, removeR,
+    -- ** Manipulation of Focus
+    rotR, rotL,
+    -- ** Manipulation of Packing
+    balance, packL, packR,
+    -- ** Information
+    isEmpty, size,
+) where
+
+import Test.QuickCheck.Arbitrary
+import Test.QuickCheck.Gen
+
+-- | A functional ring type.
+data CList a = Empty
+             | CList [a] a [a]
+    deriving (Eq)
+
+{- Creating CLists -}
+
+-- | An empty CList.
+empty :: CList a
+empty = Empty
+
+-- |Make a (balanced) CList from a list.
+fromList :: [a] -> CList a
+fromList [] = Empty
+fromList a@(i:is) = let len = length a
+                        (r,l) = splitAt (len `div` 2) is
+                    in CList (reverse l) i r
+
+{- Creating Lists -}
+
+-- |Starting with the focus, go left and accumulate all
+-- elements of the CList in a list.
+leftElements :: CList a -> [a]
+leftElements Empty = []
+leftElements (CList l f r) = f : (l ++ (reverse r))
+
+-- |Starting with the focus, go right and accumulate all
+-- elements of the CList in a list.
+rightElements :: CList a -> [a]
+rightElements Empty = []
+rightElements (CList l f r) = f : (r ++ (reverse l))
+
+-- |Make a list from a CList.
+toList :: CList a -> [a]
+toList = rightElements
+
+-- |Make a CList into an infinite list.
+toInfList :: CList a -> [a]
+toInfList = cycle . toList
+
+{- Extraction and Accumulation -}
+
+-- |Return the focus of the CList.
+focus :: CList a -> Maybe a
+focus Empty = Nothing
+focus (CList _ f _) = Just f
+
+-- |Insert an element into the CList as the new focus. The
+-- old focus is now the next element to the right.
+insertR :: a -> CList a -> CList a
+insertR i Empty = CList [] i []
+insertR i (CList l f r) = CList l i (f:r)
+
+-- |Insert an element into the CList as the new focus. The
+-- old focus is now the next element to the left.
+insertL :: a -> CList a -> CList a
+insertL i Empty = CList [] i []
+insertL i (CList l f r) = CList (f:l) i r
+
+-- |Remove the focus from the CList. The new focus is the
+-- next element to the left.
+removeL :: CList a -> CList a
+removeL Empty = Empty
+removeL (CList [] _ []) = Empty
+removeL (CList (l:ls) _ rs) = CList ls l rs
+removeL (CList [] _ rs) = let (f:ls) = reverse rs
+                          in CList ls f [] 
+
+-- |Remove the focus from the CList.
+removeR :: CList a -> CList a
+removeR Empty = Empty
+removeR (CList [] _ []) = Empty
+removeR (CList l _ (r:rs)) = CList l r rs
+removeR (CList l _ []) = let (f:rs) = reverse l
+                         in CList [] f rs
+
+{- Manipulating Rotation -}
+
+-- |Rotate the focus to the previous (left) element.
+rotL :: CList a -> CList a
+rotL Empty = Empty
+rotL r@(CList [] _ []) = r
+rotL (CList (l:ls) f rs) = CList ls l (f:rs)
+rotL (CList [] f rs) = let (l:ls) = reverse rs
+                       in CList ls l [f]
+
+-- |Rotate the focus to the next (right) element.
+rotR :: CList a -> CList a
+rotR Empty = Empty
+rotR r@(CList [] _ []) = r
+rotR (CList ls f (r:rs)) = CList (f:ls) r rs
+rotR (CList ls f []) = let (r:rs) = reverse ls
+                       in CList [f] r rs
+
+{- Manipulating Packing -}
+
+-- |Balance the CList. Equivalent to `fromList . toList`
+balance :: CList a -> CList a
+balance = fromList . toList
+
+-- |Move all elements to the left side of the CList.
+packL :: CList a -> CList a
+packL Empty = Empty
+packL (CList l f r) = CList (l ++ (reverse r)) f []
+
+-- |Move all elements to the right side of the CList.
+packR :: CList a -> CList a
+packR Empty = Empty
+packR (CList l f r) = CList [] f (r ++ (reverse l))
+
+{- Information -}
+
+-- |Returns true if the CList is empty.
+isEmpty :: CList a -> Bool
+isEmpty Empty = True
+isEmpty _ = False
+
+-- |Return the size of the CList.
+size :: CList a -> Int
+size Empty = 0
+size (CList l _ r) = 1 + (length l) + (length r)
+
+{- Instances -}
+
+-- | The show instance prints a tuple of the
+-- balanced CList where the left list's right-most
+-- element is the first element to the left. The
+-- left most-most element of the right list is the
+-- next element to the right.
+instance (Show a) => Show (CList a) where
+    show cl = case balance cl of
+                     (CList l f r) -> show (reverse l,f,r)
+                     Empty -> "Empty"
+
+instance Arbitrary a => Arbitrary (CList a) where
+    arbitrary = frequency [(1, return Empty), (10, arbCList)]
+        where arbCList = do
+                l <- arbitrary
+                f <- arbitrary
+                r <- arbitrary
+                return $ CList l f r
+    shrink (CList l f r) = Empty : [ CList l' f' r' | l' <- shrink l,
+                                                    f' <- shrink f,
+                                                    r' <- shrink r]
+    shrink Empty = []
+
+instance Functor CList where
+    fmap _ Empty = Empty
+    fmap fn (CList l f r) = (CList (fmap fn l) (fn f) (fmap fn r))