Azad Bolour believes that monad transformers are usually explained with insufficient motivation. He presents them in relation to ordinary function composition, using a novel perspective gained from participating in a monad transformer study group. His talk has three parts: Motivation - why use transformers, how to derive them from first principles Implementation - getting into the specifics of May

“Typed, elegant and efficient – we can have all three.” Gabriel Gonzalez introduces his new regular expression library which breaks away from the conventional way of using strings to represent regexes. Gabriel’s library treats regexes as algebraic objects that can be combined together much like numbers. Not only is the library beautiful, it’s fast. The latest version approaches the speed of GNU gr

Gabriel Gonzalez explains how to compile a subset of Haskell into typed lambda calculus and share the pieces safely online. He believes that rather than distributing packages or modules we can distibute typed program fragments. This allows programs to be built safely and flexibly. Watch him give an actual demo of building programs from this code ocean. Summary Key idea: we can make it much easier

Manipulating graphs has traditionally been seen as a place where imperative programming reigns supreme. Tikhon Jelvis begs to differ, and shows a trick where graph traversal can be expressed by a form of pattern matching. After explaining the approach he simulates how it works on a sample graph. Summary Traditionally graph algorithms are seen as one of the things that are really hard in functional