Samuel Mimram

Orcid: 0000-0002-0767-2569

According to our database1, Samuel Mimram authored at least 44 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Polygraphs: From Rewriting to Higher Categories.
CoRR, 2023

Categorical Coherence from Term Rewriting Systems.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
Introduction to the special issue: Confluence.
Math. Struct. Comput. Sci., August, 2022

Rewriting in Gray categories with applications to coherence.
Math. Struct. Comput. Sci., May, 2022

Tietze Equivalences as Weak Equivalences.
Appl. Categorical Struct., 2022

Division by Two, in Homotopy Type Theory.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Syntactic Regions for Concurrent Programs.
Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021

A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory.
Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021

Globular weak ω-categories as models of a type theory.
CoRR, 2021

2020
Directed Homotopy in Non-Positively Curved Spaces.
Log. Methods Comput. Sci., 2020

2019
A Sequent Calculus for Opetopes.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Describing free $\omega$ -categories.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

A Sound Foundation for the Topological Approach to Task Solvability.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Geometric and combinatorial views on asynchronous computability.
Distributed Comput., 2018

Brief Announcement: On the Impossibility of Detecting Concurrency.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Coherence of Gray Categories via Rewriting.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Concurrent Specifications Beyond Linearizability.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

2017
Coherent Presentations of Monoidal Categories.
Log. Methods Comput. Sci., 2017

A type-theoretical definition of weak ω-categories.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Homological Computations for Term Rewriting Systems.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Directed Algebraic Topology and Concurrency
Springer, ISBN: 978-3-319-15398-8, 2016

Geometric Models of Concurrent Computations.
, 2016

2015
Iterated Chromatic Subdivisions are Collapsible.
Appl. Categorical Struct., 2015

From Geometric Semantics to Asynchronous Computability.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Presenting a Category Modulo a Rewriting System.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

2014
Presenting Finite Posets.
Proceedings of the Proceedings 8th International Workshop on Computing with Terms and Graphs, 2014

Towards 3-Dimensional Rewriting Theory.
Log. Methods Comput. Sci., 2014

2013
A Categorical Theory of Patches.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

A Geometric View of Partial Order Reduction.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Computing Flowpipe of Nonlinear Hybrid Systems with Numerical Methods.
CoRR, 2013

A Homotopical Completion Procedure with Applications to Coherence of Monoids.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012
HySon: Set-based simulation of hybrid systems.
Proceedings of the 23rd IEEE International Symposium on Rapid System Prototyping, 2012

Trace Spaces: An Efficient New Technique for State-Space Reduction.
Proceedings of the Programming Languages and Systems, 2012

2011
The structure of first-order causality.
Math. Struct. Comput. Sci., 2011

The Structure of First-Order Causality (extended version)
CoRR, 2011

Liquidsoap: A High-Level Programming Language for Multimedia Streaming.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Rigorous Evidence of Freedom from Concurrency Faults in Industrial Control Software.
Proceedings of the Computer Safety, Reliability, and Security, 2011

A Non-Standard Semantics for Kahn Networks in Continuous Time.
Proceedings of the Computer Science Logic, 2011

2010
Formal Relationships Between Geometrical and Classical Models for Concurrency.
Proceedings of the workshop on Geometric and Topological Methods in Computer Science, 2010

Computing Critical Pairs in 2-Dimensional Rewriting Systems.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Focusing in Asynchronous Games.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2008
Sémantique des jeux asynchrones et réécriture 2-dimensionnelle. (Asynchronous Game Semantics and 2-dimensional Rewriting Systems).
PhD thesis, 2008

Presentation of a Game Semantics for First-Order Propositional Logic
CoRR, 2008

2007
Asynchronous Games: Innocence Without Alternation.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007


  Loading...