CS 358. TOPICS IN PROGRAMMING LANGUAGE THEORY Spring 1995
John Mitchell
MJH Room 352 (Bldg 460)
MW 12:50-2:05
This year, CS 358 will cover various topics in linear
logic and game semantics of logic and programming languages.
This is an exciting and active research area, providing recent
solutions to longstanding problems in semantics and the potential
to unify concurrency theory, semantics of functional languages,
and reasoning about resource bounds in computation.
The course will begin with several background lectures introducing
linear logic, relevant proof theory, and game interpretations of
logic. After that, we will look at recent research papers in
the area. Students will be expected to give a presentation in
class or write a term paper. Either may be on original work,
or on a research paper from the recent literature.
This course may be repeated for credit. This quarter's topics will
not overlap significantly with 1992--94 offerings of the course.
Prerequisites are some familiarity with logic, lambda calculus and
models (of lambda calculus or related systems). Either CS 258, a
course in proof theory, or energetic individual study should be
adequate.