Research
Themes
My scientific interests include:
- logical foundations of interactive and non-deterministic systems,
- linear-algebraic semantics of computation,
- what happens to the proof/program correspondence outside functional computation,
- various things related to the above topics,
- how to teach logic and computer science in middle and high school.
Structures
- Former member of the Logique de la programmation team of the I2M laboratory in Marseille.
- Member of GDR Informatique Mathématique in the Geocal group.
- One can often see me at the Chocola seminar in Lyon.
In the past, I was member of the ANR projects Logoi (Geometry of interaction), Récré (Realizability), Panda (Parallelism and Distribution Analysis), Choco (Curry-Howard and Concurrency) and the PEPS project Quand (Quantitative Approaches to Non-Determinism).
Publications
Journal articles
- Order algebras: a quantitative model of interaction
- Mathematical Structures in Computer Science, 2018. (HAL – PDF)
- Concurrent nets: a study of prefixing in process calculi
- With François Maurel. Theoretical Computer Science, May 2006. (HAL – PDF)
Conference articles
- Les abstractions informatiques peuvent-elles concrétiser les mathématiques?
- Actes du séminaire de didactique des mathématiques 2018. (HAL – PDF)
- A proof-theoretic view on scheduling in concurrency
- CL&C 2014. (HAL – PDF – slides)
- Proofs as executions
- With Virgile Mogbil. IFIP TCS, 2012. (HAL – PDF)
- An algebraic process calculus
- LICS, 2008. (HAL – PDF)
- A concurrent model for linear logic
- MFPS XXI, May 2006. (HAL – PDF)
- Concurrent nets: a study of prefixing in process calculi
- With François Maurel. Express 2004, April 2005. (HAL – PDF)
- Disjunctive normal forms and local exceptions
- With Vincent Danos. ICFP 2003. (AHL – PDF)
- Adapting Gurvich-Karzanov-Khachiyan’s algorithm for parity games: Implementation and experimentation
- With Sergei Vorobyov. [Short presentation at LICS’02. (report)
- Verification of timed automata using rewrite rules and strategies
- With Olivier Bournez, Hassen Kacem, and Claude Kirchner. BISFAI, June 2001. (HAL)
Book chapter
- Programmes, preuves et fonctions: le ménage à trois de Curry-Howard
- With Lionel Vaux. In Informatique Mathématique: une photographie en 2013. In French. (HAL – PDF – diapos)
Collective works
- Une analyse des exercices d’algorithmique et de programmation du brevet 2017.
- Commission inter-IREM informatique, 2018. (HAL – PDF)
- Situations de recherche pour la classe
- IREM de Grenoble, groupe Logique et raisonnement. Deuxième édition, 2017.
- Algorithmique et programmation au cycle 4
- Groupe Informatique de la CII Lycée. 2017. (PDF)
Thesis
- Logique, réalisabilité et concurrence
- PhD thesis, 2005. In French. (TEL – PDF)
Course notes
- Introduction to linear logic
- August 2013. (HAL – PDF – slides)
Manuscripts
- Unifying type systems for mobile processes
- April 2015. (HAL – PDF)
- Concurrent processes as wireless proof nets
- With Virgile Mogbil. February 2010. (HAL – PDF)
- Quantitative testing semantics for non-interleaving
- April 2009. (HAL – PDF)
- Functions as proofs as processes
- January 2007. (HAL – PDF)
Miscellaneous
- Realizability with constants
- Workshop on Formal Methods and Security, Nanjing, China, 2003. (HAL – PDF)
- Tautologies classiques et combinateurs de contrôle
- Master’s thesis, September 2002. (PDF)
- Adapting Gurvich-Karzanov-Khachiyan’s algorithm for parity games: Implementation and experimentation
- Internship report, August 2001. (PostScript)
- Automates temporisés et calcul de réécriture
- Internship report, July 2000. (PostScript)