Gurkenglas

_goes to add "lambdabot: Add Control.Lens.Zipper"_ - oops, it's already here.

Also `asd >>= evalStateT § do dsa; sda`, or `>=>` in `>>=`'s place. Perhaps also `foo .= § f . g $ a` instead of `foo .= (f . g...

Beware boolean blindness. ``` f = whenM (not doesDirectoryExists path) $ do putStrLn $ "Creating directory " ++ path createDirectory path ``` ought to look like ``` directory = runMaybeT...

`getDirectoryMay :: FilePath -> IO (Maybe Directory)` http://lpaste.net/150858 ``` directory = runIdentityT $ (MaybeT (getDirectoryMay path) ) $ IdentityT $ do putStrLn $ "Creating directory " ++ path createDirectory path...

fmap read . [wordsBy](https://hackage.haskell.org/package/split-0.2.2/docs/Data-List-Split.html#v:wordsBy) [isAlpha](http://hackage.haskell.org/package/base-4.8.2.0/docs/Data-Char.html#v:isAlpha)

I use them pretty often, lots for example on http://lpaste.net/148381 (You might find some more on https://www.google.de/webhp?sourceid=chrome-instant&ion=1&espv=2&ie=UTF-8#q=site:lpaste.net+modifyT ). Have you ever used StateT as a function? The use cases are...

https://hackage.haskell.org/package/unification-fd solves the unification part of this, leaving specialization to Haskell as one project and expansion with utilities for another. Hooray!

Nevermind, apparently it only does "first-order" and Haskell requires "second-order".

Here's ~what code of mine I changed since I posted this issue. This change made debugging much easier, so this should be happening automatically behind the scenes. (Yes, this is...

The OP example fleshed out: `lens.Recur(Foo).GetAttr("id").F((str)).collect()` could compile to: ``` def lensRecurFooGetAttrIdFStrCollect(arg : Bar) -> List: collect : List = [] for recurFooArg : Foo in recur(Foo, arg): getAttrId :...