default search action
Samuel Mimram
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c30]Camil Champin, Samuel Mimram, Émile Oleon:
Delooping Generated Groups in Homotopy Type Theory. FSCD 2024: 6:1-6:20 - [c29]Samuel Mimram
, Émile Oleon
Delooping cyclic groups with lens spaces in homotopy type theory. LICS 2024: 56:1-56:15 - [i20]Camil Champin, Samuel Mimram, Émile Oleon:
Delooping generated groups in homotopy type theory. CoRR abs/2405.03264 (2024) - [i19]Samuel Mimram, Émile Oleon:
Delooping cyclic groups with lens spaces in homotopy type theory. CoRR abs/2405.10149 (2024) - 2023
- [c28]Samuel Mimram:
Categorical Coherence from Term Rewriting Systems. FSCD 2023: 16:1-16:17 - [i18]Dimitri Ara, Albert Burroni, Yves Guiraud, Philippe Malbos, François Métayer, Samuel Mimram:
Polygraphs: From Rewriting to Higher Categories. CoRR abs/2312.00429 (2023) - 2022
- [j9]Simon Henry, Samuel Mimram
Tietze Equivalences as Weak Equivalences. Appl. Categorical Struct. 30(3): 453-483 (2022) - [j8]Simon Forest, Samuel Mimram
Rewriting in Gray categories with applications to coherence. Math. Struct. Comput. Sci. 32(5): 574-647 (2022) - [j7]Mauricio Ayala-Rincón
Introduction to the special issue: Confluence. Math. Struct. Comput. Sci. 32(7): 827-828 (2022) - [c27]Samuel Mimram, Émile Oleon:
Division by Two, in Homotopy Type Theory. FSCD 2022: 11:1-11:17 - 2021
- [c26]Eric Finster
A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory. MFPS 2021: 67-83 - [c25]Samuel Mimram, Aly-Bora Ulusoy:
Syntactic Regions for Concurrent Programs. MFPS 2021: 184-199 - [i17]Simon Henry, Samuel Mimram:
Tietze Equivalences as Weak Equivalences. CoRR abs/2101.03591 (2021) - [i16]Thibaut Benjamin, Eric Finster, Samuel Mimram:
Globular weak ω-categories as models of a type theory. CoRR abs/2106.04475 (2021) - 2020
- [j6]Eric Goubault, Samuel Mimram:
Directed Homotopy in Non-Positively Curved Spaces. Log. Methods Comput. Sci. 16(3) (2020)
2010 – 2019
- 2019
- [c24]Jérémy Ledent
A Sound Foundation for the Topological Approach to Task Solvability. CONCUR 2019: 34:1-34:15 - [c23]Simon Forest, Samuel Mimram:
Describing free $\omega$ -categories. LICS 2019: 1-13 - [c22]Cédric Ho Thanh, Pierre-Louis Curien, Samuel Mimram:
A Sequent Calculus for Opetopes. LICS 2019: 1-12 - [i15]Eric Goubault, Samuel Mimram:
Directed Homotopy in Non-Positively Curved Spaces. CoRR abs/1908.06684 (2019) - 2018
- [j5]Éric Goubault
Geometric and combinatorial views on asynchronous computability. Distributed Comput. 31(4): 289-316 (2018) - [c21]Éric Goubault, Jérémy Ledent
Concurrent Specifications Beyond Linearizability. OPODIS 2018: 28:1-28:16 - [c20]Simon Forest, Samuel Mimram:
Coherence of Gray Categories via Rewriting. FSCD 2018: 15:1-15:16 - [c19]Éric Goubault, Jérémy Ledent
Brief Announcement: On the Impossibility of Detecting Concurrency. DISC 2018: 50:1-50:4 - 2017
- [j4]Pierre-Louis Curien, Samuel Mimram:
Coherent Presentations of Monoidal Categories. Log. Methods Comput. Sci. 13(3) (2017) - [c18]Eric Finster, Samuel Mimram:
A type-theoretical definition of weak ω-categories. LICS 2017: 1-12 - [i14]Pierre-Louis Curien, Samuel Mimram:
Coherent Presentations of Monoidal Categories. CoRR abs/1705.03553 (2017) - [i13]Eric Finster, Samuel Mimram:
A Type-Theoretical Definition of Weak ω-Categories. CoRR abs/1706.02866 (2017) - 2016
- [b3]Samuel Mimram:
Geometric Models of Concurrent Computations. Paris Diderot University, France, 2016 - [b2]Lisbeth Fajstrup
Directed Algebraic Topology and Concurrency. Springer 2016, ISBN 978-3-319-15397-1, pp. 1-167 - [c17]Philippe Malbos, Samuel Mimram:
Homological Computations for Term Rewriting Systems. FSCD 2016: 27:1-27:17 - 2015
- [j3]Eric Goubault, Samuel Mimram, Christine Tasson
Iterated Chromatic Subdivisions are Collapsible. Appl. Categorical Struct. 23(6): 777-818 (2015) - [c16]Florence Clerc, Samuel Mimram:
Presenting a Category Modulo a Rewriting System. RTA 2015: 89-105 - [c15]Eric Goubault, Samuel Mimram, Christine Tasson
From Geometric Semantics to Asynchronous Computability. DISC 2015: 436-451 - 2014
- [j2]Samuel Mimram
Towards 3-Dimensional Rewriting Theory. Log. Methods Comput. Sci. 10(2) (2014) - [c14]Samuel Mimram:
Presenting Finite Posets. TERMGRAPH 2014: 1-17 - 2013
- [c13]Yves Guiraud, Philippe Malbos
A Homotopical Completion Procedure with Applications to Coherence of Monoids. RTA 2013: 223-238 - [c12]Eric Goubault, Tobias Heindel, Samuel Mimram
A Geometric View of Partial Order Reduction. MFPS 2013: 179-195 - [c11]Samuel Mimram
A Categorical Theory of Patches. MFPS 2013: 283-307 - [i12]Olivier Bouissou, Alexandre Chapoutot, Samuel Mimram:
Computing Flowpipe of Nonlinear Hybrid Systems with Numerical Methods. CoRR abs/1306.2305 (2013) - [i11]Samuel Mimram, Cinzia Di Giusto:
A Categorical Theory of Patches. CoRR abs/1311.3903 (2013) - 2012
- [c10]Lisbeth Fajstrup
Trace Spaces: An Efficient New Technique for State-Space Reduction. ESOP 2012: 274-294 - [c9]Olivier Bouissou, Samuel Mimram, Alexandre Chapoutot
HySon: Set-based simulation of hybrid systems. RSP 2012: 79-85 - [i10]Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen:
Trace Spaces: an Efficient New Technique for State-Space Reduction. CoRR abs/1204.0414 (2012) - 2011
- [j1]Samuel Mimram
The structure of first-order causality. Math. Struct. Comput. Sci. 21(1): 65-110 (2011) - [c8]Romain Beauxis, Samuel Mimram:
A Non-Standard Semantics for Kahn Networks in Continuous Time. CSL 2011: 35-50 - [c7]Richard Bonichon, Géraud Canet, Loïc Correnson, Eric Goubault, Emmanuel Haucourt, Michel Hirschowitz, Sébastien Labbé
Rigorous Evidence of Freedom from Concurrency Faults in Industrial Control Software. SAFECOMP 2011: 85-98 - [c6]David Baelde
Liquidsoap: A High-Level Programming Language for Multimedia Streaming. SOFSEM 2011: 99-110 - [i9]Samuel Mimram:
The Structure of First-Order Causality (extended version). CoRR abs/1101.4813 (2011) - [i8]David Baelde
Liquidsoap: a High-Level Programming Language for Multimedia Streaming. CoRR abs/1104.2681 (2011) - [i7]Romain Beauxis, Samuel Mimram:
A Non-Standard Semantics for Kahn Networks in Continuous Time. CoRR abs/1108.5062 (2011) - 2010
- [c5]Samuel Mimram
Focusing in Asynchronous Games. CiE 2010: 331-341 - [c4]Samuel Mimram:
Computing Critical Pairs in 2-Dimensional Rewriting Systems. RTA 2010: 227-242 - [c3]Eric Goubault, Samuel Mimram
Formal Relationships Between Geometrical and Classical Models for Concurrency. GETCO 2010: 77-109 - [i6]Eric Goubault, Samuel Mimram:
Formal Relationships Between Geometrical and Classical Models for Concurrency. CoRR abs/1004.2818 (2010) - [i5]Samuel Mimram:
Focusing in Asynchronous Games. CoRR abs/1004.3134 (2010) - [i4]Samuel Mimram:
Computing Critical Pairs in 2-Dimensional Rewriting Systems. CoRR abs/1004.3135 (2010)
2000 – 2009
- 2009
- [c2]Samuel Mimram
The Structure of First-Order Causality. LICS 2009: 212-221 - [i3]Samuel Mimram:
The Structure of First-Order Causality. CoRR abs/0908.3994 (2009) - 2008
- [b1]Samuel Mimram:
Sémantique des jeux asynchrones et réécriture 2-dimensionnelle. (Asynchronous Game Semantics and 2-dimensional Rewriting Systems). Paris Diderot University, France, 2008 - [i2]Samuel Mimram:
Presentation of a Game Semantics for First-Order Propositional Logic. CoRR abs/0805.0845 (2008) - 2007
- [c1]Paul-André Melliès, Samuel Mimram:
Asynchronous Games: Innocence Without Alternation. CONCUR 2007: 395-411 - [i1]Paul-André Melliès
Asynchronous games: innocence without alternation. CoRR abs/0706.1118 (2007)
Coauthor Index
aka: Éric Goubault
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: