diff --git a/result.cabal b/result.cabal
--- a/result.cabal
+++ b/result.cabal
@@ -1,5 +1,5 @@
 name:                result
-version:             0.2.5.1
+version:             0.2.6.0
 synopsis:            Encode success or at least one error
 homepage:            https://github.com/srijs/haskell-result
 license:             MIT
diff --git a/src/Control/Monad/Trans/Result.hs b/src/Control/Monad/Trans/Result.hs
--- a/src/Control/Monad/Trans/Result.hs
+++ b/src/Control/Monad/Trans/Result.hs
@@ -3,7 +3,7 @@
 module Control.Monad.Trans.Result
   ( ResultT, runResultT, hoist
   , raiseT, raiseAllT
-  , accumulateT
+  , accumulateT, accumulateT_
   , fromExceptT
   ) where
 
@@ -67,6 +67,11 @@
 accumulateT :: (Traversable t , Applicative f) => t (ResultT e f a) -> ResultT e f (t a)
 accumulateT results =
   ResultT (accumulate <$> traverse runResultT results)
+
+
+accumulateT_ :: (Traversable t , Applicative f) => t (ResultT e f a) -> ResultT e f ()
+accumulateT_ results =
+  ResultT (accumulate_ <$> traverse runResultT results)
 
 
 fromExceptT :: Functor f => ExceptT e f a -> ResultT e f a
diff --git a/src/Data/Result.hs b/src/Data/Result.hs
--- a/src/Data/Result.hs
+++ b/src/Data/Result.hs
@@ -4,7 +4,7 @@
   ( Result
   , get, errors
   , raise, raiseAll
-  , accumulate
+  , accumulate, accumulate_
   , fromEither
   ) where
 
@@ -12,6 +12,7 @@
 import Data.Bifunctor
 import Data.Bifoldable
 import Data.Bitraversable
+import Data.Foldable (traverse_)
 import Data.Key
 import Data.Monoid
 
@@ -130,3 +131,8 @@
 accumulate :: Traversable t => t (Result e a) -> Result e (t a)
 accumulate t =
   getResult (traverse AccRes t)
+
+
+accumulate_ :: Foldable t => t (Result e a) -> Result e ()
+accumulate_ t =
+  getResult (traverse_ AccRes t)