diff --git a/hinquire.cabal b/hinquire.cabal
--- a/hinquire.cabal
+++ b/hinquire.cabal
@@ -2,7 +2,7 @@
 -- documentation, see http://haskell.org/cabal/users-guide/
 
 name:                hinquire
-version:             0.1.0.0
+version:             0.1.1
 synopsis:            Generate armet style query strings.
 description:         Hinquire is a formalization/testing bed for inquire.js
 homepage:            https://github.com/joneshf/hinquire
diff --git a/src/Network/Hinquire.hs b/src/Network/Hinquire.hs
--- a/src/Network/Hinquire.hs
+++ b/src/Network/Hinquire.hs
@@ -3,12 +3,10 @@
 import Prelude hiding (foldr)
 
 import Control.Applicative (Alternative (..), Applicative, pure, (<*>), (<$>))
-import Control.Monad
+
 import Data.Biapplicative
 import Data.Bifoldable
-import Data.Bifunctor
 import Data.Bitraversable
-import Data.Char
 import Data.Foldable
 import Data.Monoid
 import Data.Traversable
@@ -78,7 +76,7 @@
     traverse _ Atom = pure Atom
     traverse f (Predicate k r v) = Predicate <$> pure k <*> pure r <*> f v
     traverse f (Group i1 b i2) =
-        Group <$> traverse f i1 <*> pure b <*> traverse f i1
+        Group <$> traverse f i1 <*> pure b <*> traverse f i2
     traverse f (Wrap b i) = Wrap <$> pure b <*> traverse f i
 
 instance Monoid k => Monad (Inquire k) where
@@ -111,7 +109,7 @@
     (Predicate f _ g) <<*>> (Predicate k2 r v2) = Predicate (f k2) r (g v2)
     p@Predicate {} <<*>> (Group i1 b i2) = Group (p <<*>> i1) b (p <<*>> i2)
     p@Predicate {} <<*>> (Wrap b i) = Wrap b (p <<*>> i)
-    (Group i1 b i2) <<*>> i3 = Group (i1 <<*>> i3) b (i1 <<*>> i3)
+    (Group i1 b i2) <<*>> i3 = Group (i1 <<*>> i3) b (i2 <<*>> i3)
     (Wrap b i1) <<*>> i2 = Wrap b (i1 <<*>> i2)
 
 instance Bitraversable Inquire where