:next-meeting Monday May 26, 2009 18:00 (6pm)
As the numbers indicate, this is in Building 34, on the 4th floor. The is the usual location on 50 Vassar Street, Cambridge
Many thanks go to Alexey Radul for arranging for the room, and to MIT for welcoming us.
ITA Software, a fine employer of Lisp hackers, is kindly purchasing a buffet to accompany our monthly Boston Lisp meeting. Anyone who attends is welcome to partake. We appreciate it if you let us know you're coming, and what food taboos you have, so that we can order the right amount of food. Tell us by sending email to boston-lisp-meeting-register at common-lisp.net. We won't send any acknowledgement unless requested; importantly, we'll keep your identity and address confidential and won't communicate any such information to anyone, not even to our sponsors.
Norman Ramsey will speak about Using Higher-Order Functions and Continuation-Passing Style to Make Dataflow Optimization Simple.
Norman Ramsey's research spans theory (a foundational model for probabilistic programming languages) and practice (methods for making code generators reusable). While he has contributed to a variety of topics in programming languages and software engineering, his primary interests lie in functional programming and programming-language infrastructure. His introduction to functional programming came on a Symbolics Lisp machine, but shortly afterward he was seduced by the beauty of algebraic data types and pattern matching. These days his favorite programmable programming systems are Haskell (look! it has Prolog in the type checker and will generate your code for you!) and Lua (the best of scripting, metaobjects, and C rolled up into a tiny package). He is currently Associate Professor of computer science at Tufts University, a job which he enjoys tremendously except that it does not leave him time for enough programming.
His website is at http://www.cs.tufts.edu/~nr/
Having observed the success of the formula at ILC'2009, we have instituted Lightning Talks at the Boston Lisp Meeting. At every meeting, before the main talk, there are two slots for strictly timed 5-minute talks followed by 2-minute for questions and answers.
The slots for next meeting are still open. Step up and come talk about your pet project!
:past-meetings
- 2008-03-03 at the CBC
- 2008-03-31 at MIT
- Faré's announcement
- Video of Rahul Jain talking about DefDoc (thanks to Mark Dulcey)
- Audio of both Alexey Radul's and Rahul Jain's talks (thanks to Rob Levy)
- Powerpoint of Rahul Jain's talk on DefDoc
- Slides from Alexey Radul's talk on Scheme
- Photos from the event (thanks to brlewis)
- (update) Alexey Radul's matrix of Scheme implementation capabilities
- 2008-04-22 at MIT
- Faré's announcement
- Photos from the event (thanks to brlewis)
- Write up by Hans Hübner
- Audio of the presentations (thanks to Rob Levy)
- 2008-05-27 at MIT
- Faré's announcement
- Audio recording of Greg Cooper's talk on FrTime (thanks to Rob Levy)
- 2008-06-25 at NEU
- Faré's announcement
- Audio recording of Danny Yoo's talk on DivaScheme (thanks to Rob Levy)
- Audio recording of Shriram Krishnamurthi's talk on Relationally Parametric Polymorphic Contracts (thanks to Rob Levy)
- 2008-07-21 at MIT
- 2008-09-29 at MIT
- Faré's announcement
- A video of Rich Hickley's talk on Clojure is available at http://clojure.blip.tv/
- 2008-10-27 at MIT
- 2008-11-24 at MIT
- 2008-01-26 at MIT
- Faré's announcement
- David O'Toole's presentation materials on rogue-like games and common lisp
- 2008-02-11 at MIT
- 2008-03-30 at MIT
- 2008-04-27 at MIT
:resources
- Read our official blog to find authoritative announcements for our meetings. (RSS Feed)
- boston-lisp-announce is a low-traffic email list for announcements of particular interest to Lisp users in and around Boston, Massachusetts, USA (including Providence, Rhode Island).
- boston-lisp is for topics relevant to the Boston lisp community.
- boston-lisp-organizers may be useful if you want to contact the meeting organizers
- You may want to subscribe to Rob Levy's podcast of the boston lisp meetings, updated soon after every meeting.