Publications
My publications can be found below but also on HAL, dblp, scholar, arXiv, idref or orcid.
-
Rewriting techniques for relative coherence
Samuel Mimram.
Submitted, 2024.
[ bib | arXiv | pdf ] -
Delooping Generated Groups in Homotopy Type Theory
Camil Champin, Samuel Mimram, and Émile Oleon.
In Jakob Rehof, editor, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024), volume 299 of Leibniz International Proceedings in Informatics (LIPIcs), page 6:1–6:20, Dagstuhl, Germany, 2024. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[ bib | doi | arXiv | web | pdf | slides ] -
Delooping cyclic groups with lens spaces in homotopy type theory
Samuel Mimram and Emile Oleon.
In Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '24, New York, NY, USA, 2024. Association for Computing Machinery.
[ bib | doi | arXiv | web | pdf | slides ] -
Free precategories as presheaf categories
Simon Forest and Samuel Mimram.
Theory and Applications of Categories, 41(24):785–824, 2024.
[ bib | web | hal | pdf ] -
Globular weak ω-categories as models of a type theory
Thibaut Benjamin, Eric Finster, and Samuel Mimram.
Higher Structures, 8(2):1–69, 2024.
[ bib | doi | arXiv | web | pdf ] -
Polynomials in homotopy type theory as a Kleisli category
Elies Harington and Samuel Mimram.
Electronic Notes in Theoretical Informatics and Computer Science, Volume 4 - Proceedings of MFPS XL, 2024.
[ bib | doi | arXiv | web | pdf ] -
Bisimulations as weak equivalences?
Samuel Mimram.
Unpublished manuscript, 2023.
[ bib | pdf ] -
Polygraphs: From Rewriting to Higher Categories
Dimitri Ara, Albert Burroni, Yves Guiraud, Philippe Malbos, François Métayer, and Samuel Mimram.
To be published by Cambridge University Press, 2023.
[ bib | arXiv | hal ] -
Categorical Coherence from Term Rewriting Systems
Samuel Mimram.
In Marco Gaboardi and Femke van Raamsdonk, editors, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), volume 260 of Leibniz International Proceedings in Informatics (LIPIcs), page 16:1–16:17, Dagstuhl, Germany, 2023. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[ bib | doi | web | hal | pdf | slides ] -
Division by Two, in Homotopy Type Theory
Samuel Mimram and Émile Oleon.
In Amy P. Felty, editor, 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022), volume 228 of Leibniz International Proceedings in Informatics (LIPIcs), page 11:1–11:17, Dagstuhl, Germany, 2022. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[ bib | doi | web | hal | pdf | slides ] -
Rewriting in Gray categories with applications to coherence
Simon Forest and Samuel Mimram.
Mathematical Structures in Computer Science, 32(5):574–647, 2022.
[ bib | doi | arXiv | hal | pdf ] -
Type theoretical approaches to opetopes
Pierre-Louis Curien, Cédric Ho Thanh, and Samuel Mimram.
Higher structures, 6(1):80–181, 2022.
[ bib | doi | web | hal | pdf ] -
Globular weak ω-categories as models of a type theory
Eric Finster Thibaut Benjamin, Samuel Mimram.
In Workshop on Homotopy Type Theory / Univalent Foundations, 2021.
[ bib | hal | pdf ] -
The Liquidsoap book
Samuel Mimram and Romain Beauxis.
Independently published, 2021.
[ bib | web | hal | pdf ] -
Tietze Equivalences as Weak Equivalences
Simon Henry and Samuel Mimram.
Applied Categorical Structures, 2021.
[ bib | doi | arXiv | web | hal | pdf ] -
Syntactic Regions for Concurrent Programs
Samuel Mimram and Aly-Bora Ulusoy.
In Ana Sokolova, editor, Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, MFPS 2021, volume 351 of EPTCS, page 184–199, 2021.
[ bib | doi | web | hal | pdf ] -
A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory
Eric Finster, Samuel Mimram, Maxime Lucas, and Thomas Seiller.
In Ana Sokolova, editor, Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, MFPS 2021, Hybrid: Salzburg, Austria and Online, 30th August - 2nd September, 2021, volume 351 of EPTCS, page 67–83, 2021.
[ bib | doi | web | hal | pdf | slides ] -
A cartesian (2,1)-category of homotopy polynomial functors in groupoids
Eric Finster, Samuel Mimram, Maxime Lucas, and Thomas Seiller.
Unpublished manuscript, 2020.
[ bib | pdf ] -
Directed Homotopy in Non-Positively Curved Spaces
Eric Goubault and Samuel Mimram.
Logical Methods in Computer Science, Volume 16, Issue 3, 2020.
[ bib | doi | arXiv | web | hal | pdf ] -
PROGRAM = PROOF
Samuel Mimram.
Independently published, 2020.
[ bib | web | hal | pdf ] -
Syntactic approaches to opetopes
Pierre-Louis Curien, Cédric Ho Thanh, and Samuel Mimram.
Unpublished manuscript, 2019.
[ bib | arXiv | hal ] -
Suspension et Fonctorialité: Deux Opérations Implicites Utiles en
CaTT
Thibaut Benjamin and Samuel Mimram.
In Journées Francophones des Langages Applicatifs, 2019.
[ bib | web | hal ] -
A Sound Foundation for the Topological Approach to Task Solvability
Jérémy Ledent and Samuel Mimram.
In Wan Fokkink and Rob van Glabbeek, editors, 30th International Conference on Concurrency Theory (CONCUR 2019), volume 140 of Leibniz International Proceedings in Informatics (LIPIcs), page 34:1–34:15, Dagstuhl, Germany, 2019. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[ bib | doi | web | hal ] -
A Sequent Calculus for Opetopes
Cédric Ho Thanh, Pierre-Louis Curien, and Samuel Mimram.
In 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019.
[ bib | doi | web | hal | pdf ] -
Describing free ω-categories
Simon Forest and Samuel Mimram.
In 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019.
[ bib | doi | web | hal | pdf ] -
Geometric and combinatorial views on asynchronous computability
Éric Goubault, Samuel Mimram, and Christine Tasson.
Distributed Computing, 2018.
[ bib | doi | web | hal | pdf ] -
Coherence of Gray Categories via Rewriting
Simon Forest and Samuel Mimram.
In Hélène Kirchner, editor, 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), volume 108 of Leibniz International Proceedings in Informatics (LIPIcs), page 15:1–15:16, Dagstuhl, Germany, 2018. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[ bib | doi | web | hal | pdf ] -
On the Impossibility of Detecting Concurrency
Éric Goubault, Jérémy Ledent, and Samuel Mimram.
In Ulrich Schmid and Josef Widder, editors, 32nd International Symposium on Distributed Computing (DISC 2018), volume 121 of Leibniz International Proceedings in Informatics (LIPIcs), page 50:1–50:4, Dagstuhl, Germany, 2018. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[ bib | doi | web | hal ] -
Concurrent Specifications Beyond Linearizability
Éric Goubault, Jérémy Ledent, and Samuel Mimram.
In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018), volume 125 of Leibniz International Proceedings in Informatics (LIPIcs), page 28:1–28:16, Dagstuhl, Germany, 2018. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[ bib | doi | web | hal | pdf ] -
A Type-Theoretical Definition of Weak ω-Categories
Eric Finster and Samuel Mimram.
In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–12, 2017.
[ bib | doi | arXiv | hal | pdf | slides ] -
Coherent Presentations of Monoidal Categories
Pierre-Louis Curien and Samuel Mimram.
Logical Methods in Computer Science, 13(3), 2017.
[ bib | doi | arXiv | web | hal | pdf ] -
Directed Algebraic Topology and Concurrency
Lisbeth Fajstrup, Éric Goubault, Emmanuel Haucourt, Samuel Mimram, and Martin Raussen.
Springer International Publishing, 2016.
[ bib | doi | web | hal ] -
Geometric Models of Concurrent Computations
Samuel Mimram.
2016.
Habilitation à diriger des recherches.
[ bib | hal | pdf | slides ] -
Homological Computations for Term Rewriting Systems
Philippe Malbos and Samuel Mimram.
In Delia Kesner and Brigitte Pientka, editors, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016), volume 52 of Leibniz International Proceedings in Informatics (LIPIcs), page 27:1–27:17, Dagstuhl, Germany, 2016. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[ bib | doi | web | hal | pdf | slides ] -
Presenting Finite Posets
Samuel Mimram.
In Aart Middeldorp and Femke van Raamsdonk, editors, Proceedings 8th International Workshop on Computing with Terms and Graphs, Vienna, Austria, July 13, 2014, volume 183 of Electronic Proceedings in Theoretical Computer Science, pages 1–17. Open Publishing Association, 2015.
[ bib | doi | hal | pdf ] -
Presenting a Category Modulo a Rewriting System
Florence Clerc and Samuel Mimram.
In Maribel Fernández, editor, 26th International Conference on Rewriting Techniques and Applications (RTA 2015), volume 36 of Leibniz International Proceedings in Informatics (LIPIcs), page 89–105, Dagstuhl, Germany, 2015. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[ bib | doi | web | hal | pdf | slides ] -
From Geometric Semantics to Asynchronous Computability
Éric Goubault, Samuel Mimram, and Christine Tasson.
In Yoram Moses, editor, Distributed Computing, volume 9363 of Lecture Notes in Computer Science, pages 436–451. Springer Berlin Heidelberg, 2015.
[ bib | doi | web | hal | pdf | slides ] -
Computing Flowpipe of Nonlinear Hybrid Systems with Numerical Methods
Olivier Bouissou, Alexandre Chapoutot, and Samuel Mimram.
Unpublished manuscript, 2014.
[ bib | arXiv | hal | pdf ] -
Set-based Simulation for Design and Verification of Simulink Models
Olivier Bouissou, Alexandre Chapoutot, and Samuel Mimram.
In Embedded Real Time Software and Systems (ERTS), 2014.
[ bib | hal | pdf ] -
Iterated Chromatic Subdivisions are Collapsible
Éric Goubault, Samuel Mimram, and Christine Tasson.
Applied Categorical Structures, page 1–42, 2014.
[ bib | doi | web | hal | pdf ] -
Towards 3-Dimensional Rewriting Theory
Samuel Mimram.
Logical Methods in Computer Science, 10(1):1–47, 2014.
[ bib | doi | arXiv | hal | pdf ] -
Representing 2-Dimensional Critical Pairs
Samuel Mimram.
Unpublished manuscript, 2013.
[ bib | pdf ] -
A Geometric View of Partial Order Reduction
Éric Goubault, Tobias Heindel, and Samuel Mimram.
Electronic Notes in Theoretical Computer Science, 298(0):179–195, 2013.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, MFPS XXIX.
[ bib | doi | web | hal | pdf ] -
A Categorical Theory of Patches
Samuel Mimram and Cinzia Di Giusto.
Electronic Notes in Theoretical Computer Science, 298(0):283–307, 2013.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, MFPS XXIX.
[ bib | doi | arXiv | web | hal | pdf | slides ] -
A Homotopical Completion Procedure with Applications to Coherence of
Monoids
Yves Guiraud, Philippe Malbos, and Samuel Mimram.
In Femke van Raamsdonk, editor, 24th International Conference on Rewriting Techniques and Applications (RTA 2013), volume 21 of Leibniz International Proceedings in Informatics (LIPIcs), page 223–238, Dagstuhl, Germany, 2013. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[ bib | doi | web | hal | pdf ] -
HySon: Set-based simulation of hybrid systems
O. Bouissou, A. Chapoutot, and S. Mimram.
In Rapid System Prototyping (RSP), 2012 23rd IEEE International Symposium on, page 79–85, 2012.
[ bib | doi | hal | pdf ] -
Formal Relationships Between Geometrical and Classical Models for
Concurrency
Éric Goubault and Samuel Mimram.
Electronic Notes in Theoretical Computer Science, 283(0):77–109, 2012.
Proceedings of the workshop on Geometric and Topological Methods in Computer Science (GETCO).
[ bib | doi | arXiv | web | hal | pdf ] -
Trace Spaces: An Efficient New Technique for State-Space Reduction
Lisbeth Fajstrup, Éric Goubault, Emmanuel Haucourt, Samuel Mimram, and Martin Raussen.
In Helmut Seidl, editor, Programming Languages and Systems, volume 7211 of Lecture Notes in Computer Science, page 274–294.
Springer Berlin Heidelberg, 2012.
[ bib | doi | arXiv | web | hal | pdf | slides ] -
Liquidsoap: A High-Level Programming Language for Multimedia Streaming
David Baelde, Romain Beauxis, and Samuel Mimram.
In Ivana Černá, Tibor Gyimóthy, Juraj Hromkovič, Keith Jefferey, Rastislav Králović, Marko Vukolić, and Stefan Wolf, editors, SOFSEM 2011: Theory and Practice of Computer Science, volume 6543 of Lecture Notes in Computer Science, page 99–110. Springer Berlin Heidelberg, 2011.
[ bib | doi | arXiv | web | hal | pdf ] -
A Non-Standard Semantics for Kahn Networks in Continuous Time
Romain Beauxis and Samuel Mimram.
In Marc Bezem, editor, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL, volume 12 of Leibniz International Proceedings in Informatics (LIPIcs), page 35–50, Dagstuhl, Germany, 2011. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[ bib | doi | arXiv | web | hal | pdf | slides ] -
Rigorous Evidence of Freedom from Concurrency Faults in Industrial
Control Software
Richard Bonichon, Géraud Canet, Loïc Correnson, Eric Goubault, Emmanuel Haucourt, Michel Hirschowitz, Sébastien Labbé, and Samuel Mimram.
In Francesco Flammini, Sandro Bologna, and Valeria Vittorini, editors, Computer Safety, Reliability, and Security, volume 6894 of Lecture Notes in Computer Science, page 85–98. Springer Berlin Heidelberg, 2011.
[ bib | doi | web | hal | pdf ] -
The Structure of First-Order Causality (extended version)
Samuel Mimram.
Mathematical Structures in Computer Science, 21:65–110, 2011.
[ bib | doi | arXiv | web | hal | pdf ] -
Focusing in Asynchronous Games
Samuel Mimram.
In Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo, and Luís Mendes Gomes, editors, Programs, Proofs, Processes, volume 6158 of Lecture Notes in Computer Science, page 331–341. Springer Berlin Heidelberg, 2010.
[ bib | doi | arXiv | web | hal | pdf | slides ] -
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Samuel Mimram.
In Christopher Lynch, editor, Proceedings of the 21st International Conference on Rewriting Techniques and Applications, volume 6 of Leibniz International Proceedings in Informatics (LIPIcs), page 227–242, Dagstuhl, Germany, 2010. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[ bib | doi | arXiv | web | hal | pdf | slides ] -
Sémantique des jeux asynchrones et réécriture 2-dimensionnelle
Samuel Mimram.
PhD thesis, Équipe Preuves Programmes Systèmes (PPS), Université Paris 7, 2009.
[ bib | hal | pdf | slides ] -
The Structure of First-Order Causality
Samuel Mimram.
In Logic In Computer Science, 2009. LICS '09. 24th Annual IEEE Symposium on, page 212–221, 2009.
[ bib | doi | arXiv | hal | pdf | slides ] -
From Asynchronous Games to Concurrent Games
Paul-André Melliès and Samuel Mimram.
Unpublished manuscript, 2008.
[ bib | pdf ] -
De la webradio lambda à la λ-webradio
David Baelde and Samuel Mimram.
In JFLA (Journées Francophones des Langages Applicatifs), page 47–62, Étretat, France, 2008. INRIA.
[ bib | web | hal | pdf ] -
Asynchronous Games: Innocence Without Alternation
Paul-André Melliès and Samuel Mimram.
In Luís Caires and VascoT. Vasconcelos, editors, CONCUR 2007 – Concurrency Theory, volume 4703 of Lecture Notes in Computer Science, page 395–411. Springer Berlin Heidelberg, 2007.
[ bib | doi | arXiv | web | hal | pdf ] -
Innocence asynchrone
Samuel Mimram.
Master thesis report, 2005.
[ bib | pdf | slides ] -
Décidabilité de l'égalité dans les catégories avec familles
Samuel Mimram.
Master 2 internship, 2004.
[ bib | pdf | slides ] -
JoCaml et le join-calcul
Samuel Mimram.
Report for master 1 course, 2003.
[ bib | pdf | slides ] -
Recherche automatique de preuves dans une logique spatiale sur le
π-calcul
Samuel Mimram.
MIM1 internship, 2002.
[ bib | pdf ]
Notes
Some notes about other's work: