International Conference on

Typed Lambda Calculi and Applications

The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed calculi. The conference is bi-annual and is held in spring, every odd calendar year. Since 2003 TLCA is a part of the Federated Conference on Rewriting, Deduction and Programming (RDP).

New: TLCA 2013 Accepted Papers

Next TLCA: Eindhoven, June 2013

Scope of the conference
Steering Committee
TLCA List of Open Problems
Predecessors of TLCA
Past meetings
Publications
Related links

Scope of the conference

Typical areas include, but are not limited to:

* Typed and untyped lambda-calculi as models of computation.
* Proof theory: Natural deduction, sequent calculi, cut elimination and normalization. Propositions as types, linear logic and proof nets.
* Types: Subtypes, dependent types, type inference, polymorphism, types for security.
* Semantics: Denotational semantics, game semantics, realizability, categorical models.
* Programming languages: Foundations of functional and object-oriented programming, proof search, logic programming, type checking.
* Implementation: Abstract machines, parallel execution, optimal reduction, program optimization.
* Computer-aided reasoning.

Steering Committee

Samson Abramsky, Oxford
Henk Barendregt, Nijmegen
Pierre-Louis Curien, Paris
Mariangiola Dezani, Torino
Martin Hofmann, Munich
Luke Ong, Oxford
Simona Ronchi Della Rocca, Torino
Pawel Urzyczyn, Warsaw, chair

Honorary Advisor

Roger Hindley, Swansea

Publicity Chair

Luca Paolini, Torino

TLCA List of Open Problems: http://tlca.di.unito.it/opltlca/

The TLCA List of Open Problems (modeled after RTA LOOP) aims at collecting unresolved questions (and other relevant information, e.g. about solutions and related results) in the subject areas of TLCA. Go to the URL http://tlca.di.unito.it/opltlca/

Predecessors of TLCA

Here is an article "Lambda-Calculus Conferences in the 1970s" by Roger Hindley.
See also the Swansea 1979 photograph and its key to names.

Past meetings

1993: Utrecht, The Netherlands,
1995: Edinburgh, Scotland,
1997: Nancy, France,
1999: L'Aquila, Italy,
2001: Kraków, Poland,
2003: Valencia, Spain.
2005: Nara, Japan.
2007: Paris, France.
2009: Brasilia, Brazil.
2011: Novi Sad, Serbia.

Publications

The Proceedings of TLCA conferences are published in the LNCS series of Springer-Verlag:

1993 (Utrecht)           --- LNCS 664 (M. Bezem, J.F. Groote, Eds.)
1995 (Edinburgh)      --- LNCS 902 (M. Dezani-Ciancaglini, G. Plotkin, Eds.)
1997 (Nancy)            --- LNCS 1210 (P. de Groote, J.R. Hindley, Eds.)
1999 (L'Aquila)        --- LNCS 1581 (J.-Y. Girard, Ed.)
2001 (Krakow)         --- LNCS 2044 (S.Abramsky, Ed.)
2003 (Valencia)        --- LNCS 2701 (M. Hofmann, Ed.)
2005 (Nara)              --- LNCS 3461 (P. Urzyczyn, Ed.)
2007 (Paris)              --- LNCS 4583 (S. Ronchi Della Rocca, Ed.)
2009 (Brasilia)          --- LNCS 5608 (P.-L. Curien, Ed.)
2011 (Novi Sad)          --- LNCS 6690, ARCoSS, (Luke Ong, Ed.)

Visit the DBLP page for bibliographic information and list of contents.

Final revised and expanded versions of selected papers from TLCA 1997, 1999, 2003, and 2005 have appeared in special issues of Fundamenta Informaticae:

vol 33, Number 4, April 1998 (Guest Editor: Roger Hindley)
vol 45, Number 1-2, January 2001 (Editors: Jean-Yves Girard, Pawel Urzyczyn)
vol 65, Number 1-2, March 2005 (Editors: Martin Hofmann, Pawel Urzyczyn)
vol. 77 Number 4, June 2007 (Editors: Thorsten Altenkirch, Pawel Urzyczyn)

Selected papers of TLCA 2007 and TLCA 2009 appeared in special issues of Logical Methods in Computer Science.