Please note: for security reasons, Palantir Security asks that you show identification at the door. If you prefer not to show identification, you can have a visitor badge created (with your photo) when you arrive.
If you've heard about the delimited continuations plugin in Scala 2.8+, but been intimidated by them then this talk is for you. Matthew Neeley and James Douglas will explain what delimited continuations are and how they can be used with some real-world scenarios to solve interesting problems.
Matthew will start with introductory material and examples, including delimited continuations for action composition with Play 2, Akka's data flow feature, C#-style async/await) and resource management. James will then discuss his "imperatively" project, which uses delimited continuations to build complex, multi-step Web workflows out of easy to follow imperative code. There will be a shared Q & A session at the end. Matthew and James encourage questions throughout.
The schedule for the event is:
6:30 - networking, food
7:00 - announcements
7:10 - Matthew presents
8:10 - James presents
8:40 - Q&A
Palantir is providing water, soda, beer and food.
We will give away two copies of IntelliJ IDEA 11 for personal use, and two copies of JRebel. Two free PDF copies of "Actors in Scala" by Philipp Haller and Frank Sommers and published by Artima will also be given away. If you did not register with your full name you will not be eligible to win anything. You can edit your name by going to Members / My Profile / Edit Profile.
This event will be recorded.
Matthew Neeley has a PhD in physics from UCSB, where he worked on quantum computing with superconducting qubits. He continued his research at MIT Lincoln Laboratory before deciding that the most enjoyable part of experimental physics was writing code, so why not do that full time? He now works at NetWallet in Palo Alto.
James Douglas is a Forward Deployed Engineer at Palantir, where he focuses on functional Web APIs built on a variety of JVM-based stacks. He has a special interest in theoretical computer science, including delimited continuations and how they are useful to applied programming.