PRL Seminar Chronological Index:
1996-97
Spring Semester
Verifying Garbage Collection Algorithms using the PVS Theorem Prover
Paul Jackson, May 7, 1997
Logic of Proofs and Realizability
Sergei Artemov, April 22, 1997
Computability is Ineffable in ZF Set Theory
Robert L. Constable, April 15, 1997
CZF, Type Theory, and Nuprl-Light (continued)
Evan Moran, April 8, 1997
CZF, Type Theory, and Nuprl-Light
Evan Moran, April 1, 1997
Formal Continuations and Classical Logic
Karl Crary, March 10, 1997
Discussion of Issues in Logic Library Design
Robert L. Constable, Jason Hickey, Stuart Allen, and Rich Eaton, March 3, 1997
Advancing the Type-Theoretic Underpinnings of Practical Programming Languages
Karl Crary, February 1997
Formal Methods & Distributed Systems
Mark Hayden, February 1997
Designing a Logical Library
Stuart Allen, February 24, 1997
Modules and Libraries
Jason Hickey, February 18, 1997
Sharing Formal Mathematics and Programming
Jason Hickey, February 1997
Nuprl Tutorial
Jason Hickey, February 1997
Formal Reasoning about Communication Systems
Christoph Kreitz, January 1997
Group Communication with Functional Languages
Mark Hayden, January 28, 1997
Fall Semester
Typed Closure Conversion
Greg Morrisett, December 3, 1996
Object Foundations
Jason Hickey, November 1996
ML-like Type Reconstruction for Nuprl
Ozan Hafizogullari, November 26, 1996
DEC
Rustan Leino, November 19, 1996
Foundations for the Implementation of Higher-Order Subtyping: Part II
Karl Crary, November 12, 1996
Foundations for the Implementation of Higher-Order Subtyping
Karl Crary, November 5, 1996
Nuprl Light
Jason Hickey, September, 1996
Formal Objects in Type Theory
Jason Hickey, September 1996