Proceedings Types for Proofs and Programs, Revised Selected Papers
Abstract
Types for Proofs and Programs is the annual meeting of the Types Project, whose aim is to develop the technology of formal reasoning and computer programming based on Type Theory. This is done by improving the languages and computerised tools for reasoning, and by applying the technology in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. The 2009 meeting took place in Aussois, France, and we thank the invited speakers Richard Garner, Peter Hancock, Pawe Urzyczyn for excellent talks. The present volume consists of papers not necessarily presented at the workshop, selected by Thorsten Altenkirch, Tom Hirschowitz, Christophe Raffalli, and Alan Schmitt, with help from Matthieu Sozeau and Makarius Wenzel.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.