Data.Laxer

Some laxer operations. See http://conal.net/blog/posts/lazier-functional-programming-part-2/

Documentation

eitherL :: (HasLub c, HasGlb c) => (a -> c) -> (b -> c) -> Either a b -> c

Laxer variant of either

condL :: (HasLub a, HasGlb a) => a -> a -> Bool -> a

Laxer if-then-else, due to Luke Palmer.

condL a a undefined = a
condL (Left 3) (Left undefined) undefined = Left undefined

foldrL :: (HasLub b, HasGlb b) => (a -> b -> b) -> b -> [a] -> b

Laxer variant of foldr for lists

maybeL :: (HasLub b, HasGlb b) => b -> (a -> b) -> Maybe a -> b

Laxer variant of maybe

fairZipWith :: (a -> b -> c) -> [a] -> [b] -> [c]

A version of zipWith that succeeds if either list ends at the same time the other one bottoms out.

Laws:

fairZipWith >= zipWith
flip . fairZipWith = fairZipWith . flip

fairZip :: [a] -> [b] -> [(a, b)]

fairZip = fairZipWith (,)