Data.Zip.FoldL

Zipping of non-strict left folds.

Based on Beautiful Folds by Max Rabkin http://squing.blogspot.com/2008/11/beautiful-folding.html

See also http://conal.net/blog/posts/more-beautiful-fold-zipping

Documentation

data Fold b a

Data representation of a left fold

Constructors

F (a -> b -> a) a

Instances

Pair (Fold b)

Pair' (Fold b)

cfoldl :: Fold b a -> [b] -> a

Interpretation of a Fold as non-strict

cfoldl' :: Fold b a -> [b] -> a

Interpretation of a Fold as non-strict

data WithCont h b c

Add a continuation.

Instances

Functor (WithCont h b)

Pair (h b) => Applicative (WithCont h b)

type FoldC = WithCont Fold

Non-strict left fold with continuation.

cfoldlc :: FoldC b a -> [b] -> a

Interpretation of a FoldC

data WithCont' h b c

Like WithCont but with pair-strict '(*)'

Instances

Functor (WithCont' h b)

Pair' (h b) => Applicative (WithCont' h b)

type FoldC' = WithCont' Fold

Strict left fold with continuation.

cfoldlc' :: FoldC' b a -> [b] -> a

Interpretation of a FoldC

class Pair' f where

Strict generalized pair

Methods

pair' :: f a -> f b -> f (P a b)

Instances

Pair' []

Pair' IO

Pair' ((->) u)

Monoid u => Pair' ((,) u)

Pair' (Fold b)

data P c c'

Strict pairs