Welcome on my corner of the internet. I'm a researcher in theoretical computer science, interested in logic and semantics of programming languages. You can find here the few things I've written.
Since August 2017, I am a research associate (postdoc) with Nobuko Yoshida in the Mobility Reading Group. Before that, I was a PhD student under the supervision of Olivier Laurent and Pierre Clairambault on the topic "Concurrent structures in game semantics."
Software (mostly in OCaml, my language of choice) I've been working on recently:
- dmlenu, an alternative to dmenu as an OCaml library. See it in action!
- merlin a scriptable topevel to be embedded in your favorite editor to get smart auto-completion, types of arbitrary expression and much more (I'm responsible for the emacs mode),
- mlorg, a parser for org-mode files, written in OCaml whose main goal is to allow abstract manipulation of the document,
- participation in pimp, a compiler for a Mini-MetaML, that is a minimalist ML extended with meta-programming. (With Lucas Hosseini)
Here are documents about my teaching, sorted by years:
You can also find the slides of the defense.
- Undecidability of equality in the free locally cartesian closed category (extended version) (With Pierre Clairambault and Peter Dybjer). Accepted for publication at a special issue of LMCS of TLCA'15.
- Games and strategies as event structures (With Pierre Clairambault, Sylvain Rideau, and Glynn Winskel). Accepted for publication at LMCS.
- Non-angelic Concurrent Game Semantics (With Pierre Clairambault, Jonathan Haymanand Glyinn Winskel). (FOSSACS'18).
- Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-Or (With Pierre Clairambault and Glyinn Winskel). (FSCD'17).
- Causality vs interleavings in concurrent games semantics (With Pierre Clairambault). Accepted at CONCUR'16.
- Weak memory models using event structures. (JFLA 2016)
- Undecidability of Equality in the Free Locally Cartesian Closed Category. With Pierre Clairambault and Peter Dybjer. (TLCA 2015)
- The parallel intensionally fully abstract games model of PCF. With Pierre Clairambault and Glynn Winskel. (LICS 2015)
- La stratégie de la fourchette. (JFLA 2015)
- Symmetry in concurrent games. With Pierre Clairambault and Glynn Winskel. (LICS-CSL 2014)
- Strategies as concurrent processes. With Jonathan Hayman, Marc Lasson and Glynn Winskel (MPFS 2014)
- From event structure theory to weak memory models. (Talk at the PPLV seminar)
- From event structure theory to weak memory models. (Talk at the QMUL seminar)
- Towards a compositional and causal semantics of programming languages. (Talk at the LSV seminar)
- The parallel intensionally fully abstract games model of PCF. (Invited talk at CHoCoLa)
- On weak memory models using event structures:
- Comment un ordinateur cuisine-t-il (Exposé au labo junior « Appliquer »)
- Undecidability of Equality in the Free Locally Cartesian Closed Category (TLCA 2015)
- A game semantics of fork (GaLoP 2015)
- Tutorial on concurrent games (LIP)
- La stratégie de la fourchette (JFLA 2015)
- Concurrent games with symmetry (CSL-LICS 2014)
- Summer 2011 (at the LIP, Lyon with Daniel Hirschkoff): I worked on higher order π-calculus. Material in french:
- Spring 2012 (at the Computer Laboratory, Cambridge with Pierre Clairambault and Glynn Winskel) : I worked on concurrent games.
- Summer 2012 (at the Chalmers University of Technology, Gothenburg, with Peter Dybjer and Thierry Coquand): I worked on type theory and categories with families:
- Summer 2013 (at the LIP, Lyon with Olivier Laurent): I worked on intentional and untyped models of the λμ-calculus:
- 2014: a year-long internship (at the Computer Laboratory, Cambridge with Marcelo Fiore and Glynn Winskel)
Simon Castellan (simon at phis.me)