Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Samuel Mimram"'
Autor:
Eric Goubault, Samuel Mimram
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 3 (2020)
A semantics of concurrent programs can be given using precubical sets, in order to study (higher) commutations between the actions, thus encoding the "geometry" of the space of possible executions of the program. Here, we study the particular case of
Externí odkaz:
https://doaj.org/article/4e0526aac4c64595a6f402c15068f2bc
Publikováno v:
Higher Structures. 6:80-181
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d40dc4e414451dd72e2c2c104c1c927f
https://doi.org/10.21136/hs.2022.02
https://doi.org/10.21136/hs.2022.02
Autor:
Samuel Mimram
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 183, Iss Proc. TERMGRAPH 2014, Pp 1-17 (2015)
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of generators and r
Externí odkaz:
https://doaj.org/article/741e4b51975b49598f9d7082f1e3a883
Autor:
Pierre-Louis Curien, Samuel Mimram
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 3 (2017)
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations where the
Externí odkaz:
https://doaj.org/article/e1cde249cca24d9fa8fcad0815024da4
Autor:
Mauricio Ayala-Rincón, Samuel Mimram
Publikováno v:
Mathematical Structures in Computer Science. 32:827-828
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47723d29b9ce2fc1f67306c346ec4fd2
https://doi.org/10.1017/s0960129523000063
https://doi.org/10.1017/s0960129523000063
Publikováno v:
Proceedings of the 37th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2021)
37th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2021)
37th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2021), Aug 2021, Salzburg, Austria
37th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2021)
37th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2021), Aug 2021, Salzburg, Austria
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets of variab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c52d89dfd97a6f2fa324aa237f389448
https://hal.archives-ouvertes.fr/hal-03345938
https://hal.archives-ouvertes.fr/hal-03345938
Autor:
Samuel Mimram
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 2 (2014)
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is confluent and term
Externí odkaz:
https://doaj.org/article/71cbe138b2d442bb8d64c158d3f8d3d4
Autor:
Simon Henry, Samuel Mimram
A given monoid usually admits many presentations by generators and relations and the notion of Tietze equivalence characterizes when two presentations describe the same monoid: it is the case when one can transform one presentation into the other usi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::677d02e1152167f9498b76a321ccc034
http://arxiv.org/abs/2101.03591
http://arxiv.org/abs/2101.03591
Autor:
Simon Forest, Samuel Mimram
Over the recent years, the theory of rewriting has been used and extended in order to provide systematic techniques to show coherence results for strict higher categories. Here, we investigate a further generalization to Gray categories, which are kn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::322c189b4d21db24855e24df593d5bed
Autor:
Samuel Mimram, Aly-Bora Ulusoy
In order to gain a better understanding of the state space of programs, with the aim of making their verification more tractable, models based on directed topological spaces have been introduced, allowing to take in account equivalence between execut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b358b37897814ace35aed50c12e4b8b