diff --git a/LICENSE b/LICENSE
new file mode 100644
--- /dev/null
+++ b/LICENSE
@@ -0,0 +1,13 @@
+Copyright (c) 2014, Kirstin Penelope Rhys
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
diff --git a/Setup.hs b/Setup.hs
new file mode 100644
--- /dev/null
+++ b/Setup.hs
@@ -0,0 +1,2 @@
+import Distribution.Simple
+main = defaultMain
diff --git a/nestedmap.cabal b/nestedmap.cabal
new file mode 100644
--- /dev/null
+++ b/nestedmap.cabal
@@ -0,0 +1,45 @@
+-- Initial nestedmap.cabal generated by cabal init.  For further
+-- documentation, see http://haskell.org/cabal/users-guide/
+
+name:                nestedmap
+version:             0.1.0.1
+synopsis:            A library for nested maps
+description:         This library supports deeply nested key to value mapping.
+                     Very much like Data.Map, but for heigher, hierarchial dimensions.
+                     It could be used for thing such as markov chains, sparse tensors
+                     or matricies which could contain non-numeric data, file systems, etc.
+license:             LGPL-3
+license-file:        LICENSE
+author:              kirstin penelope rhys
+maintainer:          kirstin.rhys@gmail.com
+-- copyright:
+category:            Data
+build-type:          Simple
+-- extra-source-files:
+cabal-version:       >=1.10
+
+source-repository head
+  type:                git
+  location:            https://github.com/kirstin-rhys/nestedmap
+
+library
+  exposed-modules:     Data.Nested.Tree, Data.Nested.Forest
+  -- other-modules:
+  -- other-extensions:
+  hs-source-dirs:      src
+  default-language:    Haskell2010
+  build-depends:       base >=4.7 && <4.9
+                     , containers >= 0.5.5.1
+                     , base-unicode-symbols >= 0.2 && < 0.4
+
+test-suite spec
+  type:                exitcode-stdio-1.0
+  main-is:             Spec.hs
+  hs-source-dirs:      src, test
+  default-language:    Haskell2010
+  build-depends:       QuickCheck >= 2.7 && < 2.8
+                     , base >=4.7 && <4.9
+                     , containers >= 0.5.5.1
+                     , hspec >= 2.0 && < 2.1
+                     , base-unicode-symbols >= 0.2 && < 0.4
+                     , data-ordlist >= 0.4.7 && < 0.5
diff --git a/src/Data/Nested/Forest.hs b/src/Data/Nested/Forest.hs
new file mode 100644
--- /dev/null
+++ b/src/Data/Nested/Forest.hs
@@ -0,0 +1,64 @@
+{-# LANGUAGE GADTs, NoImplicitPrelude, UnicodeSyntax #-}
+
+module Data.Nested.Forest
+       ( -- * Forest type
+         Forest
+         -- * Query
+       , trees, treeAssocs
+       , null, size
+       , lookup, member
+         -- * Construction
+       , empty
+       , singleton
+       , fromFoldable
+       , fromList
+         -- * List
+       , toList
+       ) where
+
+import Data.Function (flip)
+import Data.Maybe (Maybe)
+import Data.Ord (Ord)
+import Data.Int (Int)
+import Data.Bool (Bool)
+import Data.Foldable (Foldable)
+import Data.Traversable (Traversable)
+import Data.Nested.Internal ( Forest
+                            , trees, treeAssocs
+                            , nullForest
+                            , sizeForest
+                            , emptyForest
+                            , singletonForest
+                            , fromFoldableForest
+                            , fromListForest
+                            , toListForest
+                            , lookupForest
+                            , memberForest                              
+                            )
+
+empty ∷ Forest κ α
+empty = emptyForest
+
+null ∷ Forest κ α → Bool
+null = nullForest
+
+size ∷ Forest κ α → Int
+size = sizeForest
+
+singleton ∷ Foldable φ ⇒ φ (κ,α) → Forest κ α
+singleton = singletonForest
+
+fromFoldable ∷ (Foldable φ, Foldable ψ, Ord κ) ⇒ ψ (φ (κ, α)) → Forest κ α
+fromFoldable = fromFoldableForest
+
+fromList ∷ (Ord κ) ⇒ [[(κ, α)]] → Forest κ α
+fromList = fromListForest
+
+toList ∷ Forest κ α → [[(κ, α)]]
+toList = toListForest
+
+lookup ∷ (Traversable φ, Ord κ) ⇒ φ κ → Forest κ α → φ (Maybe α)
+lookup = flip lookupForest
+
+member ∷ (Traversable φ, Ord κ) ⇒ φ κ → Forest κ α → φ Bool
+member = flip memberForest
diff --git a/src/Data/Nested/Tree.hs b/src/Data/Nested/Tree.hs
new file mode 100644
--- /dev/null
+++ b/src/Data/Nested/Tree.hs
@@ -0,0 +1,65 @@
+{-# LANGUAGE GADTs, NoImplicitPrelude, UnicodeSyntax #-}
+
+module Data.Nested.Tree
+       ( -- * Tree type
+         Tree
+         -- * Query
+       , fruit, forest
+       , null, size
+       , lookup, member
+         -- * Construction
+       , empty
+       , singleton
+       , fromFoldable
+       , fromList
+         -- * List
+       , toList
+       ) where
+
+
+import Data.Function (flip)
+import Data.Maybe (Maybe)
+import Data.Ord (Ord)
+import Data.Int (Int)
+import Data.Bool (Bool)
+import Data.Foldable (Foldable)
+import Data.Traversable (Traversable)
+
+import Data.Nested.Internal ( Tree
+                            , nullTree, fruit, forest
+                            , sizeTree
+                            , emptyTree
+                            , singletonTree
+                            , fromFoldableTree
+                            , fromListTree
+                            , toListTree
+                            , lookupTree
+                            , memberTree
+                            )
+
+empty ∷ α → Tree κ α
+empty = emptyTree
+
+null ∷ Tree κ α → Bool
+null = nullTree
+
+size ∷ Tree κ α → Int
+size = sizeTree
+
+lookup ∷ (Traversable φ, Ord κ) ⇒ φ κ → Tree κ α → (α, φ (Maybe α))
+lookup = flip lookupTree
+
+member ∷ (Traversable φ, Ord κ) ⇒ φ κ → Tree κ α → φ Bool
+member = flip memberTree
+
+singleton ∷ Foldable φ ⇒ α → φ (κ,α) → Tree κ α
+singleton = singletonTree
+
+fromFoldable ∷ (Foldable φ, Foldable ψ, Ord κ) ⇒ α → ψ (φ (κ, α)) → Tree κ α
+fromFoldable = fromFoldableTree
+
+fromList ∷ (Ord κ) ⇒ α → [[(κ, α)]] → Tree κ α
+fromList = fromListTree
+
+toList ∷ Tree κ α → (α, [[(κ, α)]])
+toList = toListTree
diff --git a/test/Spec.hs b/test/Spec.hs
new file mode 100644
--- /dev/null
+++ b/test/Spec.hs
@@ -0,0 +1,14 @@
+{-# OPTIONS_GHC -F -pgmF hspec-discover #-}
+
+-- module Main (main) where
+
+-- import Test.Hspec
+-- import Test.QuickCheck
+
+-- import qualified  Data.Nested.TreeSpec as DNT
+-- import qualified  Data.Nested.ForestSpec as DNF
+
+-- main :: IO ()
+-- main = hspec $ do
+--   DNT.spec
+--   DNF.spec