diff --git a/app/Main.hs b/app/Main.hs
--- a/app/Main.hs
+++ b/app/Main.hs
@@ -6,4 +6,4 @@
 main :: IO ()
 main = do
     S.solveEasyPuzzle
-    NQ.solve 8
+    NQ.nQueens 8
diff --git a/mad-props.cabal b/mad-props.cabal
--- a/mad-props.cabal
+++ b/mad-props.cabal
@@ -4,10 +4,10 @@
 --
 -- see: https://github.com/sol/hpack
 --
--- hash: 663fc348378bb0879419e139117b3cb738781875d627cbe8259dded81e0fd92b
+-- hash: a42c235991d5a051d2c2e06b557284432c12645b78bd3e0c94de36ef67c038bb
 
 name:           mad-props
-version:        0.2.0.0
+version:        0.2.1.0
 synopsis:       Monadic DSL for building constraint solvers using basic propagators.
 description:    Please see the README on GitHub at <https://github.com/ChrisPenner/mad-props#readme>
 category:       Propagators
diff --git a/src/Props.hs b/src/Props.hs
--- a/src/Props.hs
+++ b/src/Props.hs
@@ -15,6 +15,8 @@
     , newPVar
 
     -- * Finding Solutions
+    , solveT
+    , solveAllT
     , solve
     , solveAll
 
diff --git a/src/Props/Internal/PropT.hs b/src/Props/Internal/PropT.hs
--- a/src/Props/Internal/PropT.hs
+++ b/src/Props/Internal/PropT.hs
@@ -13,6 +13,8 @@
     , PropT
     , newPVar
     , constrain
+    , solveT
+    , solveAllT
     , solve
     , solveAll
     , readPVar
@@ -112,7 +114,9 @@
 > initNQueens = ...
 >
 > solution :: [Coord]
-> solution = solve (initNQueens 8) (\readPVar vars -> fmap readPVar vars)
+> solution = solve (\readPVar vars -> fmap readPVar vars) (initNQueens 8)
+> -- or more simply:
+> solution = solve fmap (initNQueens 8)
 which converts 'PVar's into a result.Given an action which initializes and constrains a problem 'solveT' will  and returns some container of 'PVar's, 'solveT' will attempt to find a solution which passes all valid constraints.
 -}
 solveT :: forall m a r.