Types for Proofs and Programs

In this LIPIcs proceedings one can find research papers on the following topics: analysis of the classical principles in intuitionistic calculi, type isomorphisms for intersection types, monads and their semantics in functional programming languages, realizability, extensions of type theory, extensions of linear logic, models of type theory, control operators in type systems, formal verification of programs, program extraction, compiler formalization and modelling of natural language features. All papers obtained at least two reviews, and up to six reviews, counting a second round of review.