Higher-dimensional rewriting theory

 
A Type-Theoretical Definition of Weak ω-Categories. Eric Finster and Samuel Mimram. Accepted at LICS, 2017. [ bib | arXiv | 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 | pdf | slides | http ]
 
Coherent Presentations of Monoidal Categories. Pierre-Louis Curien and Samuel Mimram. Sumbitted, 2016. [ bib | 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 | pdf | slides | http ]
 
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 | pdf ]
 
Towards 3-Dimensional Rewriting Theory. Samuel Mimram. Logical Methods in Computer Science, 10(1):1–47, 2014. [ bib | DOI | arXiv | pdf ]
 
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 | pdf | http ]
 
Representing 2-Dimensional Critical Pairs. Samuel Mimram. Unpublished manuscript, 2013. [ bib | pdf ]
 
The Structure of First-Order Causality (extended version). Samuel Mimram. Mathematical Structures in Computer Science, 21:65–110, 2011. [ bib | DOI | arXiv | pdf | http ]
 
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 | pdf | slides | http ]
 
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 | pdf | slides ]

Models for concurrency

 
Directed Algebraic Topology and Concurrency. Lisbeth Fajstrup, Éric Goubault, Emmanuel Haucourt, Samuel Mimram, and Martin Raussen. Springer International Publishing, 2016. [ bib | DOI | http ]
 
Directed Homotopy in Non-Positively Curved Spaces. Éric Goubault and Samuel Mimram. Submitted, 2016. [ bib | pdf ]
 
Geometric and Combinatorial Views on Asynchronous Computability. Éric Goubault, Samuel Mimram, and Christine Tasson. Submitted, 2016. [ bib | pdf ]
 
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 | pdf | slides | http ]
 
Iterated Chromatic Subdivisions are Collapsible. Éric Goubault, Samuel Mimram, and Christine Tasson. Applied Categorical Structures, page 1–42, 2014. [ bib | DOI | pdf | http ]
 
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 | pdf | slides | http ]
 
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 | pdf | http ]
 
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 | pdf | slides | http ]
 
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 | pdf | http ]
 
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 | pdf | http ]
 
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 | pdf | slides | http ]
 
From Asynchronous Games to Concurrent Games. Paul-André Melliès and Samuel Mimram. Unpublished manuscript, 2008. [ bib | 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 | pdf | http ]

Hybrid systems

 
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 | pdf ]
 
Computing Flowpipe of Nonlinear Hybrid Systems with Numerical Methods. Olivier Bouissou, Alexandre Chapoutot, and Samuel Mimram. Unpublished manuscript, 2014. [ bib | arXiv | 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 | 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 | pdf | slides | http ]

Webradios

 
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 | pdf | http ]
 
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 | pdf | http ]

Theses

 
Geometric Models of Concurrent Computations, Samuel Mimram. September 2016. [ bib | 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 | pdf | slides ]

Reports

 
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 ]