Chronological Index:
1999-00
Spring Semester
An Efficient Refiner for First-order Intuitionistic Logic (Part II)
Stephan Schmitt, May 22nd, 2000
On continuity of computable real functions
Elena Nogina, May 1st, 2000
Stability of intuitionistic systems.
Sergei Artemov, April 24th, 2000
Randomized Programming and Probabilistic Reasoning in Type Theory
James Cheney, April 17th, 2000
Differences between the MetaPRL type theory and the Nuprl type theory
Alexey Nogin, April 10th, 2000
Reflection Part II
Eli Barzilay, April 3rd, 2000
Continuation on reflection
Mark Bickford, March 13, 2000
Analysis of reflection in programming languages using Scheme as the main example
Eli Barzilay, March 6, 2000
An Efficient Refiner for First-order Intuitionistic Logic
Stephan Schmitt, Febuary 28, 2000
IO-automata & Ensemble
Mark Bickford, Febuary 21, 2000
Efficient Programming by Extract in Nuprl Type Theory - Continued.
Alexey Nogin, Febuary 14, 2000
Efficient Programming by Extract in Nuprl Type Theory
Alexey Nogin, Febuary 7, 2000
Automatic Complexity Analysis Revisited
Ralph Benzinger, January 31, 2000
Fall Semester
Intersections, Unions and Games
Robert Constable, Alexei Kopylov and Alexey Nogin, December 6, 1999
Principles of Stepwise Refinement
Heiko Mantel, November 22, 1999
Regions, part 2: The Capability Calculus
David Walker, November 15, 1999
An Introduction to Region Inference
David Walker, November 8, 1999
Decidability of Linear Affine Logic
Alexei Kopylov, November 1, 1999
Proof presentation in the Omega system
Erica Melis, October 25, 1999
Linear Logic
Alexei Kopylov, October 18, 1999
The Status of the Meta-Prl Project
Alexey Nogin, October 4, 1999
Continuation of talk on Polymorphic References
Ozan Hafizogullari, September 24, 1999
Points of contact with Girard (Nuprl ∩ Ludics)
Robert constable, September 13, 1999