RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://hackage.haskell.org/package/base/docs/Data-Bitraversable.html below:

Data.Bitraversable

Bitraversable Arg Source #

Since: base-4.10.0.0

Instance details

Defined in Data.Semigroup

Bitraversable Either Source #

Since: base-4.10.0.0

Instance details

Defined in Data.Bitraversable

Bitraversable (,) Source #

Class laws for tuples hold only up to laziness. The Bitraversable methods are lazier than their Traversable counterparts. For example the law bitraverse pure ≡ traverse does not hold for tuples if laziness is exploited:

>>> (bitraverse pure pure undefined :: IO (Int, Word)) `seq` ()
()
>>> (traverse pure (errorWithoutStackTrace "error!") :: IO (Int, Word)) `seq` ()
*** Exception: error!

Since: base-4.10.0.0

Instance details

Defined in Data.Bitraversable

Bitraversable (Const :: Type -> Type -> Type) Source #

Since: base-4.10.0.0

Instance details

Defined in Data.Bitraversable

Bitraversable ((,,) x) Source #

Since: base-4.10.0.0

Instance details

Defined in Data.Bitraversable

Bitraversable (K1 i :: Type -> Type -> Type) Source #