Typed Lambda Calculi and Applications

The lambda calculus was developed in the 1930s by Alonzo Church. The calculus turned out to be an interesting model of computation and became the prototype for untyped functional programming languages. Operational and denotational semantics for the calculus served as examples for other programming languages. In typed lambda calculi, lambda terms are classified according to their applicative behavior. In the 1960s it was discovered that the types of typed lambda calculi are infact appearances of logical propositions. Thus there are two possible views of typed lambda calculi:- as models of computation, where terms are viewed as programs in a typed programming language;- as logical theories, where the types are viewed as propositions and the terms as proofs. The practical spin-off from these studies are:- functional programming languages which are mathematically more succinct than imperative programs;- systems for automated proof checking based on lambdacaluli. This volume is the proceedings of TLCA '93, the first international conference on Typed Lambda Calculi and Applications, organized by the Department of Philosophy of Utrecht University. It includes 29 papers selected from 51submissions.