Please consider submitting to
on HAL, or on
DBLP (less complete) .|
- Bridges between operational and denotational semantics of
programming languages. Habilitation thesis defense,
Le Bourget-du-Lac, November 2017.
Variant given at the
seminar, Lyon, December 2016.
meets concurrent game semantics, with Clovis
Eberhart. The Chocola
seminar, Lyon, May 2016.
- An intensionally fully-abstract sheaf model for pi, with Clovis Eberhart and
Seiller. CALCO '15,
Nijmegen, June 2015. Supersedes the previous talk. Written
- Fully-abstract games for pi, with Clovis Eberhart and
Grenoble, April 2014. Written
- Towards a theory of programming
seminar, ENS Lyon, April 2013.
Written in Patoline, available
in pdf and
(Please don't attempt to print the pdf version
directly; it may fail miserably due to a bug in a
standard pdf library.) Here
sources: the main file
abstraction for fair testing in CCS
(written in Patoline,
here is the
version) . Given under various titles and slightly
- Limd seminar (April-March,
working group (March, 2012),
café (May, 2012),
CALCO (September, 2013).
- Fair testing vs. must
testing in a fair setting. Given under various titles and slightly differing versions:
PiCoq/Cogip workshop, Lyon,
2011-09, GdT sémantique PPS, Paris, 2011-02-22, ICE workshop, Reykjavik, 2011-06,
LDP seminar, Marseille, 2011-2-3, 91st Peripatetic Seminar
on Sheaves and Logic (Amsterdam), 2010-11-27, and 1st
PiCoq seminar, Lyon, 2010-11-22.
- An algebraic approach to
higher-order theories and rewriting. International
Workshop on Categorical Logic, Brno (2010-8-28).
- Introduction to
categorical logic. Réalisabilité
à Chambéry, Chambéry
(2010-5-31). Some typos corrected from the live version,
and some statements strengthened thanks to pointers by Jonas Frey.
- Algebraic Structures
from Shapes. Journées
Geocal-LAC, Nice (2010-3-17).
- What is a programming
language? Invited talk at the DSSE
seminar in Southampton (2010-3-10).
- Algebraic Structures from Shapes. Categorical
Computer Science, Grenoble (2009-11-26). (There was
a mistake in the second part, which is corrected in the
Geocal 2010 talk above.)
binding, symmetric monoidal closed theories, and
bigraphs. Concur, Bologna
Proofs and Games for Linear Logic. MFPS,
- I co-organise the Geocalisation à Chambéry workshop.
Here is the
group, a forum
on category theory, mainly for computer scientists using categories in
their research. As specified in the description, one should not
be afraid to ask easy questions.
- I often attend
the Chocola and
(in french, 2009 report on my past activities and future projects).
In 2012-2013 and 2013-2014, an M1 course in Chambéry on Logic and Lambda-calculus.
In 2012-2013, Python again.
In 2012, Pierre Hyvernat, Christophe Raffalli, Thomas Seiller,
and I teach Python (!) to L1 students in Chambéry.
In 2008-2009, Dominique Duval, Pierre Hyvernat, and I taught a
doctoral course in common on categorical languages and
concepts for logic and computer science.
and I taught an M2 course in common on
In 2006-2007, I taught an M2 course on
categories in computer science and
|LAMA, Campus Scientifique
|73376 Le Bourget-du-Lac Cedex