Thorsten Altenkirch. Impredicative representations of categorical datatypes, thesis proposal, October 1990.
Henk Barendregt et al. Summer school on λ calculus, 1991.
Stefano Berardi. Girard's normalisation proof in LEGO. unpublished draft, 1991.
Catarina Coquand. A proof of normalization for simply typed lambda calculus written in ALF. In Workshop on Logical Frameworks, 1992. Preliminary Proceedings.
Thierry Coquand. Pattern matching with dependent types. In Workshop on Logical Frameworks, 1992. Preliminary Proceedings.
Thierry Coquand and Christine Paulin. Inductively defined types. In Peter Dybjer et al., editors, Proceedings of the Workshop on Programming Logic, 1989.
Gilles Dowek et al. The Coq Proof Assistant User's Guide. INRIA-Rocquencourt — CNRS-ENS Lyon, 1991. Version 5.6.
N.G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem. Indag. Math., 34, 1972.
J.H. Gallier. On Girard's “Candidats de Reducibilité”. In Piergiogio Oddifreddi, editor, Logic and Computer Science. Academic Press, 1990.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
Martin Hofmann. Formal development of functional programs in type theory — a case study. LFCS Report ECS-LFCS-92-228, University of Edinburgh, 1992.
Gérard Huet. Confluent reductions. JACM, 27(4):797–821, 1980.
Gérard Huet. Initiation au lambda calcul. Lecture notes, 1992.
Zhaohui Luo and Robert Pollack. The LEGO proof development system: A user's manual. LFCS report ECS-LFCS-92-211, University of Edinburgh, 1992.
Zhaohui Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1990.
Lena Magnusson. The new implementation of ALF. In Workshop on Logical Frameworks, 1992. Preliminary Proceedings.
N.P. Mendler. Inductive Definition in Type Theory. PhD thesis, Cornell University, 1988.
Bengt Nordström, Kent Petersson, and Jan Smith. Programming in Martin-Löf's Type Theory. Oxford University Press, 1990.
Frank Pfenning. On the undecidability of partial polymorphic type reconstruction. Technical Report CMU-CS-92-105, Carnegie Mellon University, January 1992.
Benjamin Werner. A normalization proof for an impredicative type system with large eliminations over integers. In Workshop on Logical Frameworks, 1992. Preliminary Proceedings.