This seminar meets twice a month, from 3pm to 5pm, at the Volen Center, Room 101. The general topic for the seminar is programming language theory and implementation, with special interest in the following topics, not in any particular order: lambda calculus, linear logic, game semantics, proof nets, optimal evaluation, constructive mathematics, continuations. On the implementation side, we are interested in designing programming languages that handle expressions and continuations symmetrically, in building sharing technology for interpreters and compilers, and in trying out these ideas in distributed and concurrent settings.
We plan to read papers, available either in xeroxed from Harry Mairson, or as downloadable files (see below).
November 2, 1998: Harry Mairson presents Linear logic: its syntax and semantics by Jean-Yves Girard.
November 16, 1998: Julia Lawall discusses Using linear logic to implement functional programming languages.
November 30, 1998: Julia Lawall continues her discussion of Using linear logic to implement functional programming languages.
December 14, 1998: Alan Bawden presents Using Linear Naming to Build Distributed Systems, or How I Learned to Stop Worrying and Love Linear Logic
February 8, 1999: Harry Mairson presents Intersection types: relating complexity bounds on typability and expressibility at bounded rank
February 22, 1999: Julia Lawall presents Proofnets for Languages with Explicit Control