The parametric lambda calculus is a metamodel for reasoning about various kinds of computations. Its syntactic definition is based on the notion of "sets of input values," and different lambda calculi can be obtained from it by instantiating such sets in suitable ways.

The parametric lambda calculus is used as a tool for presenting in a uniform way basic notions of programming languages, and for studying with a uniform approach some lambda calculi modeling different kinds of computations, such as call-by-name, both in its lazy and non-lazy versions, and call-by-value. The parametric presentation allows us both to prove in one step all the fundamental properties of different calculi, and to compare them with each other.

The book includes some classical results in the field of lambda calculi, but completely rephrased using the parametric approach, together with some new results. The lambda calculi are presented from a computer science viewpoint, with particular emphasis on their semantics, both operational and denotational.

This book is dedicated to researchers, and can be used as a textbook for masters or Ph.D. courses on the foundations of computer science.

The A-calculus was invented by Church in the 1930s with the purpose of sup plying a logical foundation for logic and mathematics 25]. Its use by Kleene as a coding for computable functions makes it the first programming lan guage, in an abstract sense, exactly as the Thring machine can be considered the first computer machine 57]. The A-calculus has quite a simple syntax (with just three formation rules for terms) and a simple operational seman tics (with just one operation, substitution), and so it is a very basic setting for studying computation properties. The first contact between A-calculus and real programming languages was in the years 1956-1960, when McCarthy developed the LISP programming language, inspired from A-calculus, which is the first "functional" program ming language, Le., where functions are first-dass citizens 66]. But the use of A-calculus as an abstract paradigm for programming languages started later as the work of three important scientists: Strachey, Landin and B6hm."

This volume represents the proceedings of the Eighth International Conference on Typed Lambda Calculi and Applications, TLCA 2007, held in Paris, France during 26-28 June 2007, in conjunction with RTA. It contains the abstracts of the invited talks by Frank Pfenning and Patrick Baillot, plus 25 contributed - pers. The contributed papers were selected from a total of 52 submissions. The conference program included an invited talk by Greg Morrisett and a special evening talk by Henk Barendregt, on "Diamond Anniversary of Lambda Cal- lus." I wish to express my gratitude to the members of the ProgramCommittee and to all the referees for their contribution in preparing a very interesting s- enti?c program. Moreover, I thank, the members of the Organizing Committee for their hard work and the sponsoring institutions. April 2007 Simona Ronchi Della Rocca Organization Program Committee Chantal Berline (CNRS, France) Peter Dybjer (Chalmers, Sweden) Healfdene Goguen (Google, USA) Robert Harper (Carnegie Mellon University, USA) Olivier Laurent (CNRS, France) Simone Martini (University of Bologna, Italy) Simona Ronchi Della Rocca (University of Torino, Italy), Chair Peter Selinger (Dalhousie University, Canada) Paula Severi (University of Leicester, UK) Kazushige Terui (University of Sokendai, Japan) Pawel Urzyczyn (University of Warsaw, Poland) Steering Committee Samson Abramsky (University of Oxford, UK) Henk Barendregt (Katholieke Universitet Nijmegen, The Netherlands) Mariangiola Dezani-Ciancaglini (University of Torino, Italy), Chair Roger Hindley (University of Swansea, UK) Martin Hofmann (University of Munich, Germany) Pawel Urzyczyn (University of Warsaw, Poland) Organizing Committee Antonio Bucciarelli (PPS, University of Paris 7)

This book constitutes the refereed proceedings of the 7th Italian Conference on Theoretical Computer Science, ICTCS 2001, held in Torino, Italy in October 2001.
The 25 revised full papers presented together with two invited papers were carefully reviewed and selected from 45 submissions. The papers are organized in topical sections on lambda calculus and types, algorithms and data structures, new computing paradigms, formal languages, objects and mobility, computational complexitiy, security, and logics and logic programming.