Logo - springer
Slogan - springer

Mathematics | Typed Lambda Calculi and Applications - 6th International Conference, TLCA 2003, Valencia, Spain,

Typed Lambda Calculi and Applications

6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings

Hofmann, Martin (Ed.)

2003, VIII, 320 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-540-44904-1

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-540-40332-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • About this book

This volume represents the proceedings of the 6th International Conference on Typed Lambda Calculi and Applications, TLCA 2003, held in Valencia, Spain on 10–12 June 2003 in conjunction with CADE and RTA. It contains 21 c- tributions which were selected from 40 submissions. Three invited talks by D. McAllester, G. Gonthier, and R. Loader are not included in this volume. The editor wishes to thank the members of the Program Committee and the referees for their help in putting together a very attractive program. April 2003 Martin Hofmann Program Committee A. Asperti J. Palsberg (University of Bologna) (Purdue University) T. Coquand H. Schwichtenberg (Chalmers University, G¨ oteborg) (University of Munich) V. Danos N. Shankar (University Paris VII) (SRI International, Menlo Park) M. Hofmann P. Urzyczyn (Chair, University of Munich) (Warsaw University) P. -A. Mellies (CNRS, Paris) Steering Committee S. Abramsky H. Barendregt (Chair, Oxford University) (University of Nijmegen) M. Dezani-Ciancaglini R. Hindley (University of Torino) (University of Swansea) VI Preface Referees A. Abel T. Altenkirch A. Asperti P. Baillot G. Barthe M. Benke N. Benton U. Berger J. Chrzaszcz A. Compagnoni T. Coquand R. di Cosmo P. -L. Curien V. Danos R. Dyckho? T. Ehrhard C. Faggian C. Fuehrmann H. Geuvers J. Goubault P. de Groote R. Hasegawa H. Herbelin M. Hofmann G. Hutton B. Jay F. Joachimski J. B. Joinet A. J. Kfoury U. Dal Lago F. Lamarche H. Leiss T. Loew J. Longley P. Manoury S. Martini R. Matthes M. Mauny J.

Content Level » Research

Keywords » Coq - categorical methods - computational logic - deduction - lambda calculus - logic - logical relations - program logics - program semantics - programming calculi - programming theory - proof - semantics - sequent calculus - type systems

Related subjects » Mathematics - Software Engineering - Theoretical Computer Science

Table of contents 

Termination and Productivity Checking with Continuous Types.- Derivatives of Containers.- Max-Plus Quasi-interpretations.- Inductive Types in the Calculus of Algebraic Constructions.- On Strong Normalization in the Intersection Type Discipline.- Relative Definability and Models of Unary PCF.- Principal Typing in Elementary Affine Logic.- A Logical Framework with Dependently Typed Records.- A Sound and Complete CPS-Translation for ??-Calculus.- Abstraction Barrier-Observing Relational Parametricity.- Encoding of the Halting Problem into the Monster Type and Applications.- Well-Going Programs Can Be Typed.- Parameterizations and Fixed-Point Operators on Control Categories.- Functional In-Place Update with Layered Datatype Sharing.- A Fully Abstract Bidomain Model of Unary FPC.- On a Semantic Definition of Data Independence.- Nondeterministic Light Logics and NP-Time.- Polarized Proof Nets with Cycles and Fixpoints Semantics.- Observational Equivalence and Program Extraction in the Coq Proof Assistant.- Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts.- A Universal Embedding for the Higher Order Structure of Computational Effects.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Foundations.