This book constitutes the refereed proceedings of the Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, held in Nancy, France, in April 1997.The 24 revised full papers presented in the book were carefully selected from a total of 54 submissions.

A ?-to-CL translation for strong normalization.- Typed intermediate languages for shape analysis.- Minimum information code in a pure functional language with data types.- Matching constraints for the Lambda Calculus of Objects.- Coinductive axiomatization of recursive type equality and subtyping.- A simple adequate categorical model for PCF.- Logical reconstruction of bi-domains.- A module calculus for pure type systems.- An inference algorithm for strictness.- Primitive recursion for higher-order abstract syntax.- Eta-expansions in dependent type theory — The calculus of constructions.- Proof nets, garbage, and computations.- Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi.- Games and weak-head reduction for classical PCF.- A type theoretical view of Böhm-trees.- Semantic techniques for deriving coinductive characterizations of observational equivalences for ?-calculi.- Schwichtenberg-style lambda definability is undecidable.- Outermost-fair rewriting.- Pomset logic: A non-commutative extension of classical linear logic.- Computational reflection in the calculus of constructions and its application to theorem proving.- Names, equations, relations: Practical ways to reason about new.- An axiomatic system of parametricity.- Inhabitation in typed lambda-calculi (a syntactic approach).- Weak and strong beta normalisations in typed ?-calculi.