The 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015) is a forum for original research in the theory and applications of typed lambda calculus, broadly construed. Suggested, but not exclusive, list of topics for submission are:

Proof-theory: natural deduction, sequent calculi, cut elimination and normalization, propositions as types, linear logic and proof nets, type-theoretic aspects of computational complexity.

Semantics: denotational semantics, game semantics, realisability, domain theory, categorical models, higher order semantics of natural language.

Types: subtypes, dependent types, polymorphism, inductive, coinductive and recursive types, intersection types and related approaches, type inference and type checking, types in program analysis and verification, types in proof assistants, homotopy type theory.

Programming: foundational aspects of functional programming, object-oriented programming and other programming paradigms, calculi for higher order concurrency (e.g. pi-calculus), flow analysis of higher-type computation, program equivalence, program transformation and optimization.

Other: typed lambda calculi in education, proof systems based on lambda calculus to teach mathematics, lambda calculi as a unified notation in scientific education.

The TLCA serves as a forum for presenting original research in the theory and applications of typed lambda calculus, broadly construed.