Quantitative (polarized) classical realizability
A ten minutes talk about my work on quantitative realizability given at the Oregon Programming Languages Summer School.
OPLSS 2011 (University of Oregon; Eugene, USA). June 2011.
Slides: PDF
Quantitative realizability, light forcing and the timeout effect
(INRIA Focus research team; Bologna, Italy). January 2011.
DICE 2011 (Saarebrücken, Allemagne). April 2011.
Introduction to Classical Realizability (part I and II)
A two parts introduction to Krivine's classical realizability. The extension of the Curry-Howard correspondance to set theory, an analysis of forcing and the links with programming side-effects.
GdT Logique (Paris). January 2010.
GdT Logique (Paris, France). January 2011.
Réunion Vérité et Preuves (Chevaleret, Paris). Mars 2011.
Slides: Part 1 (PDF)
A biorthogonality-based realizability for time and space complexity
Réunion COMPLICE (LIP; Lyon, France). November 2010.
Slides: PDF
Candidats de réductibilité quantitatifs et logiques allégées modulo
Master academic defense. More about this in the study page.
(Paris 7, Chevaleret; Paris, France). September 2010.
Rencontre CORIAS (LIX, Palaiseau). October 2010.
Church => Scott = PTIME: an application of resource sensitive realizability
DICE 2010 (Paphos, Chypre). Mars 2010.
Séminaire équipe LCR (LIPN, Paris). May 2010.
GdT Théorie des types et réalisabilité (PPS, Paris). May 2010.
Slides: PDF