Video and slides from Bryan O’Sullivan’s talk
Here are the video and slides from Bryan’s talk.

This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
Here are the video and slides from Bryan’s talk.

This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
Our next BayFP meeting will be this Thursday, May 8th, 2008 at 7:30pm. We’ll feature Bryan O’Sullivan on Concurrent and multicore programming in Haskell. Bryan is a co-author of the upcoming O’Reilly book Real World Haskell. (among all sorts of other snazzy endeavors)
Many thanks to Alex Payne at Twitter for hosting this month’s meeting. They’ve been very supportive of BayFP and we appreciate their continued hosting. Twitter’s address is:
164 South Park St
San Francisco, CA 94107
Alex says:
It’s a building with a dark green door. People can just come on in and walk to their right to a large conference room.
We’ll start at 7:30pm. As always, this is a free event.
If you want pizza, please select which type here (and bring a few $$s): Pizza Selection Form
Here are the video and slides from the April 17th meeting.

The April meeting of BayFP is Thursday the 17th at 7:30pm at Citizen Space, 425 2nd Street, #300, San Francisco:
Jake Donham will be giving his talk on Twelf that was postponed from last month.
Twelf is a proof assistant and programming language based on typed logic programming.
It is full of interesting and beautiful ideas. I’m going to use Twelf as a jumping-off point to talk about some of those ideas: judgments and inference rules; proof search and logic programming; proofs as programs; dependent types; higher-order abstract syntax. I won’t go too deep into the technicalities of Twelf but I’ll try to explain why Twelf is interesting in comparison with other proof assistants like Coq.
As always, the talk is free and open to all
Sorry for the last minute notice, but tonight’s talk must be postponed.
In its place, let’s meet for pizza at 7:30 at Amici’s, 216 King St. @ 3rd street (we met there in September).
I apologize for the inconvenience of this change coming with just a few hours notice.
UPDATE: This meeting has been relocated and the talk postponed. We’ll meet for pizza instead at Amici’s, 216 King St. @ 3rd street in San Francisco.
Twelf is a proof assistant and programming language based on typed logic programming.
It is full of interesting and beautiful ideas. I’m going to use Twelf as a jumping-off point to talk about some of those ideas: judgments and inference rules; proof search and logic programming; proofs as programs; dependent types; higher-order abstract syntax. I won’t go too deep into the technicalities of Twelf but I’ll try to explain why Twelf is interesting in comparison with other proof assistants like Coq.
Twitter: 164 South Park St, San Francisco, CA 94107
It’s a building with a dark green door. People can just come on in and walk to their right to a large conference room.
Here are the video and slides from the talk on February 13, 2008. Burak’s homepage has a bunch of the papers he referred to at the end of his talk. Many thanks to our hosts at Twitter.

This work is licensed under a
Creative Commons Attribution-Share Alike 3.0 Unported License.Please link to this page directly when passing this on rather than the video or slides, as they may need to be moved in the future.
Many thanks to Alex Payne at Twitter for arranging to host this month’s meeting. Twitter’s address is:
164 South Park St
San Francisco, CA 94107
Alex says:
It’s a building with a dark green door. People can just come on in and walk to their right to a large conference room.
We’ll start at 7:30pm. You can find more details about the talk in the previous post.
Hope to see you Wednesday.
The next meeting of BayFP is Wednesday, February 13th. We’re still ironing out the location details, but I wanted to send out the topic and dateThe meeting will be hosted at Twitter, 164 South Park St., San Francisco, CA. Burak Emir will be our speaker.
“Extraction and Pure Scala — from object-oriented pattern matching back to functional programming”
Extractions are a way to harness the conciseness of pattern matching known from functional programming with the versatility of object-oriented progamming. They are user-definable patterns which can match and deconstruct any data into subcomponents, without imposing constraints on the way data is defined. The flexibility comes at a price though, since user-defined code cannot be optimized as well as hardwired pattern matching logic.
In this talk, I will describe how extractions are used in Scala programs and how they relate to case classes, followed by just enough theory to see what kind of optimizations is done. These optimizations
have been proven correct (which does not happen too often in compiler construction) using a purely functional calculus that models Scala, as in fact extraction is a purely functional construct. At the end of this talk, I will make the connection to generic pattern matching and why I think it would be a good idea to start a purely functional dialect of Scala (Pure Scala).
Burak added unicode support to Scala, wrote Scala’s XML libraries, added XML expressions to the Scala compiler and wrote and maintained the Scala bugtracking system (before it was replaced with trac). He wrote his thesis on “Object-Oriented Pattern Matching” at the Programming Methods Lab at EPFL, under supervision of Martin Odersky, and now works for Google.
The slides and video from Philip Wadler’s talk at the January 9th, 2008 BayFP meeting are available.
