Chronological Index:
1992-93

Spring Semester

Defining Polynomials in Constructive Type Theory
Paul Jackson, Spring 1993
No Title
Wilfred Chen, May 4, 1993
Formalizing Program Synthesis
Arnd Poetzsch, April 27, 1993
Predicative Higher-Order PROPOSITIONAL Logic vs. the Impredicative Propositional Calculus
Robert L. Constable, April 19, 1993
Proofs by Structural Induction using Partial Evaluation
Julia Lawall, Faculty Candidate, April 13, 1993
Extraction
Judith Underwood, April 6, 1993
Reflection
Bill Aitken, April 6, 1993
Using Reflection to External Automated Theorem Provers
Mark Aagaard, March 30, 1993
Semantics of the Nuprl Type Theory
Scott Stoller, March 16, 1993
Editor Demonstration
Paul Jackson, March 9, 1993

Fall Semester

Constructive Algorithms in Nuprl
Doug Howe, December 1, 1992
The Enigma of Sat Hill Climbing Procedures
Ian Gent, November 10, 1992
Set Models
Doug Howe, November 3, 1992
Structuring Proofs
Doug Howe and Paul Jackson, October 27, 1992
Fefprl
Doug Howe, October 20, 1992
Fefprl
Doug Howe, October 5, 1992
Are There Long Reduction Sequences with Short Normal Forms?
Helmut Schwichtenberg, September 29, 1992
Tactic Trees in eXene
Roderick Moten, September 22, 1992
HOL Workshop
Mark Aagaard, September 15, 1992