About Conferences Colloquium Workshops Practical

TLCA 2007

Typed Lambda Calculi and Applications

Tuesday, June 26, 2007 to Thursday, June 28, 2007, Paris
Part of RDP'07

TLCA conference programme
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 following list of topics is non-exhaustive:
  • Proof-theory: Natural deduction and sequent calculi, cut elimination and normalisation, linear logic and proof nets, type-theoretic aspects of computational complexity
  • Semantics: Denotational semantics, game semantics, realisability, categorical models
  • Implementation: Abstract machines, parallel execution, optimal reduction, type systems for program optimisation
  • Types: Subtypes, dependent types, type inference, polymorphism, types in theorem proving
  • Programming: Foundational aspects of functional and object-oriented programming, proof search and logic programming, connections between and combinations of functional and logic programming, type checking
The programme of TLCA will consist of three invited talks and about 25 papers selected from original contributions. Accepted papers will be published as volume 4583 of the Springer Lecture Notes in Computer Science series.

Invited Speakers and Special Events

There will be invited talks by An evening session will celebrate the 75th anniversary of the lambda calculus:
  • Henk Barendregt (Nijmegen University): Diamond Anniversary of Lambda Calculus

Program Committee

Steering Committee

Publicity Chair



webmaster at rdp07 dot org