Typed Lambda Calculi and Applications

8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings

Buch | Softcover

X, 400 Seiten

2007 | 2007
Springer Berlin (Verlag)
978-3-540-73227-3 (ISBN)

Artikel merken

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)

On a Logical Foundation for Explicit Substitutions.- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing.- Strong Normalization and Equi-(Co)Inductive Types.- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves.- The Safe Lambda Calculus.- Intuitionistic Refinement Calculus.- Computation by Prophecy.- An Arithmetical Proof of the Strong Normalization for the ?-Calculus with Recursive Equations on Types.- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo.- Completing Herbelin's Programme.- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi.- Ludics is a Model for the Finitary Linear Pi-Calculus.- Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic.- The Omega Rule is -Complete in the ??-Calculus.- Weakly Distributive Domains.- Initial Algebra Semantics Is Enough!.- A Substructural Type System for Delimited Continuations.- The Inhabitation Problem for Rank Two Intersection Types.- Extensional Rewriting with Sums.- Higher-Order Logic Programming Languages with Constraints: A Semantics.- Predicative Analysis of Feasibility and Diagonalization.- Edifices and Full Abstraction for the Symmetric Interaction Combinators.- Two Session Typing Systems for Higher-Order Mobile Processes.- An Isomorphism Between Cut-Elimination Procedure and Proof Reduction.- Polynomial Size Analysis of First-Order Functions.- Simple Saturated Sets for Disjunction and Second-Order Existential Quantification.- Convolution -Calculus.

Erscheint lt. Verlag	15.6.2007
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	X, 400 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	635 g
Themenwelt	Informatik ► Theorie / Studium ► Compilerbau
Schlagworte	Categorical methods • Computational Logic • Deduction • formal methods • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Higher-Order Logic • Lambda Calculus • Logic • Logical relations • Program Logics • programming • programming calculi • Programming language • Programming Theory • Program Semantics • Proof • Proof theory • Quantification • reduction • Rewriting • Semantics • sequent calculus • Type Systems
ISBN-10	3-540-73227-6 / 3540732276
ISBN-13	978-3-540-73227-3 / 9783540732273
Zustand	Neuware