Haskell Talks: Distributed Code, Graphs, and More

Join us for three excellent half-hour talks.

Matt DeLand - There's an App(licative) For That

Applicative functors fit in between functors and monads in terms of "power". I'll discuss enough haskellized category theory to motivate the definition of applicative functors from a couple different perspectives. We'll discuss examples, non-examples, benefits, and drawbacks. All ages.

Tikhon Jelvis - Purely Functional Graph Algorithms

In this talk we'll go beyond the standard imperative graph algorithms and examine the basic abstraction of inductive graphs. We'll use the functional graph library to write depth-first search.

John Chee - Just Haskell or Nothing

We'll talk about one simple way to represent failing computations and "nullable" types in Haskell. We'll also talk about elegant ways to deal with these slightly more complex types.

Agenda:

• 6pm doors open for mingling+food+drinks

• 7pm - 8:30pm talks

• More mingling until 9