Articles and preprints
Frenetic at the SBST 2021 tool competition, 2021, with Ezequiel Castellano, Ahmet Cetinkaya, Stefan Klikovits, Xiaoyi Zhang, and Paolo Arcaini. In IEEE/ACM 14th International Workshop on Search-Based Software Testing (SBST).
Opetopic algebras II: Homotopy-coherent opetopic algebras, in preparation, with Chaitanya Leena Subramaniam.
Type theoretical approaches to opetopes, 2022, with Pierre-Louis Curien and Samuel Mimram. In Higher Structures, Volume 6, Issue 1. Short version about the unnamed approach accepted and presented at Category Theory (CT) 2019.
The equivalence between opetopic sets and many-to-one polygraphs, 2018. HAL mirror. Submitted. Extended abstract accepted and presented at Higher-Dimensional Rewriting and Algebra (HDRA/FLOC) 2018.
The equivalence between opetopic sets and many-to-one polygraphs, 2018-07-07, Higher-Dimensional Rewriting and Algebra (HDRA) 2018. Quick presentation about The equivalence between opetopic sets and many-to-one polygraphs (see above).
- noisy-moo: A wrapper-based
pymooproblem modification and algorithm benchmarking. Initially developed to test KNN-averaging.
- opetopy, 2018. A Python implementation of the opetopes and opetopic sets derivation systems presented in Syntactic approaches to opetopes and Syntactic approach to opetopic categories (see above).
Opetopes: Syntactic and Algebraic Aspects, PhD thesis, 2020, under the supervision of Pierre-Louis Curien and Samuel Mimram. Defended on 2020-10-15 before a thesis jury comprised of Denis-Charles Cisinski (president), Nicola Gambino (referee), Marek Zawadowski (referee), Eugenia Cheng (member), Geoffroy Horel (member), François Métayer (member), Pierre-Louis Curien (director), and Samuel Mimram (director). Presentation slides (in French and English).