3 presentations this week. Data structures, Haskell and ClojureScript. Should be appropriate for all experience levels.
Edward Ross will give an introduction to efficient immutable data structures. Immutable data is a core feature of (purely) functional programming, but the most well-know data structures in computer science are constructed via mutation. You will learn how to construct immutable queues and treaps as asymptotically efficient as their mutable counterparts. You will also glimpse some more advanced data structures (such as finger trees), and some fundamental limits in converting mutable structures into immutable ones.
Lyndon Maydwell will conscript you into the world of command line programming. Making you an opt-parse commando. He's going to talk about some unix utils he wrote in Haskell. Who knew it could be used for anything other than getting a PHD?
Logan Campbell will be talking about the work he's been doing on a promise list library for ClojureScript. Promise lists are a functional way of representing a sequence of data, or events, that don't exist yet. They can be used to model things like network traffic or user input. Logan hopes that his library will be a step towards a practical clientside Functional Reactive Programming system. But we might not have time for that guy, so don't get your hopes up.
The doors to get into the office lock at 6pm. If you come later than that you'll need to give me (logan) a call on[masked] to let you in.