PCC 2013 Schedule

The planned schedule for the scientific and other programme of the satellite workshop PCC 2013 of TYPES 2013 is as follows, where the time for contributed talks is 40, 45 or 50 minutes, always including discussion and change of speaker.
Monday April 22 (IRIT, Univ. Paul Sabatier)

09:00 - 09:55 registration - coffee break for arrival
09:55 - 10:00 opening
10:00 - 12:00 3 contr. talks (40 minutes each)
              Herbelin, Lee, Nakata. Computational interpretation for the big five systems of reverse mathematics
              Bonfante.	Rational Bitwise Equations from a recursive point of view
              Oitavem. Rethinking FPspace with pointers
12:00 - 14:00 120 minutes lunch break (~10 minutes walking distance on Campus)
14:00 - 15:20 2 contr. talks (40 minutes each)
              Bruscoli, Guglielmi, Gundersen, Parigot. A Quasipolynomial Normalisation Procedure in Deep Inference
              Guenot. On the computational interpretation of contraction in deep inference
15:20 - 16:00 coffee break
16:00 - 17:20 2 contr. talks (40 minutes each)
              Sticht. A Game-Theoretic Decision Procedure for the Constructive Description Logic cALC
              Chapman, Uustalu, Veltri.	Formalizing restriction categories

Seminar series 2013 "Logics and analyses for verifying graph transformation" of the IRIT17:30 - 18:45 "An introduction to separation logic, and the benefits of going higher-order (a tutorial)" by Lars Birkedal

Tuesday April 23 (Manufacture des Tabacs, Univ. Toulouse Capitole)

09:55 - 10:00 opening TYPES
10:00 - 11:00 TYPES inv. talk Awodey
11:00 - 11:30 coffee break
11:30 - 11:55 contr. talk TYPES
              Herbelin. Some reflections about equality in type theory (tentative material for further research)
11:55 - 12:00 change of room
12:00 - 12:45 contr. talk (45 minutes)
              Kahle, Setzer. The extended predicative Mahlo universe in explicit mathematics
12:45 - 14:25 100 minutes lunch break (joint with TYPES)
14:25 - 16:05 2 contr. talks (50 minutes each)
              Yamasaki. Algebraic Compositions of Action Structures for Function Terms
              Gazzari. Natural Calculation
16:05 - 16:35 coffee break (joint with TYPES)
16:35 - 18:15 2 contr. talks (50 minutes each)
              Ilik, Nakata. A Direct Constructive Proof of Open Induction on Cantor Space
              Boudou, Woltzenlogel Paleo. Compression of Propositional Resolution Proofs by Lowering Subproofs


Page maintained by:
Ralph Matthes
https://www.irit.fr/~Ralph.Matthes/

Last modified (date in French): jeu. avril 11 18:06:46 CEST 2013