A BRICS Mini-Course
November 7 and 8, 1997
Department of Computing, Science, Chalmers University of Technology, Gothenburg, Sweden
Pure type systems (PTSs) were introduced in the late 80's by Barendregt, Berardi and Terlouw as a framework to define and study typed lambda calculi. The framework motivates its uses and applications (e.g. in theorem proving and programming languages), and reflections upon its shortcomings will be presented. Finally, it is the hope to conclude with some recent developments in the field.