WEDNESDAY

09:00-09:30 Benjamin Werner, The proof of the 4-color theorem
09:30-10:00 Gertrud Bauer, The five colour theorem in Isabelle/Isar
10:00-10:30 Markus Wenzel, Mathematical structures and structured proofs in Isabelle/Isar
Coffee
11:00-11:30 Nicolas Magaud, Formal proof of a program to compute square roots of large integers
11:30-12:00 Luís Cruz-Filipe, The Fundamental Theorem of Calculus in Coq
12:00-12:30 Philippe Audebaud, Axiomatic Semantic for Randomized Programs
Lunch
14:00-14:30 Conor McBride and James McKinna, The View from the Left
14:30-15:00 Thorsten Altenkirch, Lazy Type Theory
15:00-15:30 Mariangiola Dezani-Ciancaglini and Silvia Ghilezan, A lambda model characterizing computational behaviours of terms
15:30-16:00 Aleksy Schubert, A note on observational equivalence in the simply typed lambda-calculus
Tea
16:30-17:00 Ralph Matthes, On (Co-)Iteration of Rank 2
17:00-17:30 Marino Miculan, A Metric Approach to Recursive and Co-recursive Definitions
17:30-18:00 Tarmo Uustalu, Monadic-Style Translation of Inductive and Coinductive Types
Evening Lecture: canceled

THURSDAY

09:00-09:30 Judicaël Courant, Explicit Universes for the Calculus of Constructions
09:30-10:00 Ana Bove, General Recursion in Type Theory
10:00-10:30 Yves Bertot, A practical approach to general recursion in the Calculus of Inductive Constructions
Coffee
11:00-11:30 Yong Luo, Coherence and Transitivity in Coercive Subtyping
11:30-12:00 Robert Kiessling, Coercive Subtyping for Hindley-Milner Type Systems
12:00-12:30 Maria Joao Frade, Type inference with constructor subtyping
Lunch
14:00-14:30 Xingyuan Zhang, Focus Constructively -- A Lightweight Approach for Concurrency in Type Theory
14:30-15:00 Jianmin Pang, Paul Callaghan and Zhaohui Luo, An approach to verification of domain properties based on LF
15:00-15:30 Michal Konecny, Refining of Linear Types for In-Place Update
Tea
16:00-16:30 Benjamin Gregoire, Compiling Proofs
16:30-17:00 Pierre Letouzey, A new extraction for Coq
17:00-17:30 Stefan Berghofer, Program extraction in Isabelle
17:30-18:30 DEMOS:
Demo Pierre Letouzey, Examples of extraction in Coq
Demo Stefan Berghofer, An implementation of program extraction in Isabelle
Demo Paul Callaghan, Implementation of coercion rules
Demo Markus Wenzel, Notable concepts in contemporary Isabelle
Demo Yves Bertot, PCoq
Demo Adam Grabowski and Adam Naumowicz, How to use types in Mizar
20:30-21:30 Business Meeting

FRIDAY

09:00-09:30 Giovanni Sambin, Formal topology as a fragment of predicative mathematics
09:30-10:00 Giovanni Curi, The predicative Stone-Cech compactification: embedding spaces into data-types
10:00-10:30 Andreas Abel, Termination and Productivity Checking with Continuous Types
Coffee
11:00-11:30 Burkhart Wolff, On Shallow Embeddings of OO-Languages in HOL
11:30-12:00 Anton Setzer, Higher types in Java
12:00-12:30 Marcin Benke, Towards Generic Programming in Type Theory
Lunch
13:30 SOCIAL EVENT

SATURDAY

09:00-09:30 Micaela Mayero, David Delahaye and Jesper Carlström, Automation for Wheels in Coq
09:30-10:00 Edwin Brady, Every Number Has At Most Two Digits
10:00-10:30 Milad Niqui, Rational Arithmetic using Stern-Brocot encoding in Coq
Coffee
11:00-11:30 Jean Duprat, Constructors : a ruler and a pair of compasses
11:30-12:00 Thierry Coquand, Randy Pollack and Makoto Takeyama, Modules as dependently typed records
Lunch
13:30-17:30 MARTIN LÖF ANNIVERSARY

SUNDAY

09:00-09:30 Stefano Berardi, Classical Logic as Limit
09:30-10:00 Gilles Dowek and Benjamin Werner, Peano's arithmetic as a theory modulo
10:00-10:30 Alexandre Miquel, Encoding Zermelo's Set Theory into F-omega with universes
Coffee
11:00-11:30 Jesper Carlström, Subsets and quotient sets in Martin-Löf's type theory
11:30-12:00 Laurent Chicli, Expressiveness of quotient types in the type theory of Coq
12:00-12:30 Freek Wiedijk, The constructive core of HOL Light in Coq
12:30-13:00 Hugo Herbelin, Some remarks on dependent case analysis on classical objects
Lunch & End of the Workshop