Traced Premonoidal Categories
RAIRO-Theor. Inf. Appl., 37 4 (2003) 273-299
Published online: 2004-01-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Span(Graph): a canonical feedback algebra of open transition systems
Elena Di Lavore, Alessandro Gianola, Mario Román, Nicoletta Sabadini and Paweł SobocińskiSoftware and Systems Modeling 22 (2) 495 (2023)
https://doi.org/10.1007/s10270-023-01092-7
1 (2023)
https://doi.org/10.1109/LICS56636.2023.10175688
Formal Aspects of Component Software
Elena Di Lavore, Alessandro Gianola, Mario Román, Nicoletta Sabadini and Paweł SobocińskiLecture Notes in Computer Science, Formal Aspects of Component Software 13077 63 (2021)
https://doi.org/10.1007/978-3-030-90636-8_4
Parametrized Fixed Points and Their Applications to Session Types
Ryan KavanaghElectronic Notes in Theoretical Computer Science 352 149 (2020)
https://doi.org/10.1016/j.entcs.2020.09.008
How to prove decidability of equational theories with second-order computation analyser SOL
MAKOTO HAMANAJournal of Functional Programming 29 (2019)
https://doi.org/10.1017/S0956796819000157
Reversible Computation
Robin KaarsgaardLecture Notes in Computer Science, Reversible Computation 11497 34 (2019)
https://doi.org/10.1007/978-3-030-21500-2_3
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
MAKOTO HAMANA, KAZUTAKA MATSUDA and KAZUYUKI ASADAMathematical Structures in Computer Science 28 (2) 287 (2018)
https://doi.org/10.1017/S096012951600027X
How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation
Makoto HamanaProceedings of the ACM on Programming Languages 1 (ICFP) 1 (2017)
https://doi.org/10.1145/3110266
Von Neumann Categories
Richard Blute and Marc ComeauApplied Categorical Structures 23 (5) 725 (2015)
https://doi.org/10.1007/s10485-014-9375-6
Advanced Information Systems Engineering
Tomasz BrengosLecture Notes in Computer Science, Advanced Information Systems Engineering 7908 75 (2014)
https://doi.org/10.1007/978-3-662-44124-4_5
57 (2013)
https://doi.org/10.1145/2428116.2428127
49 (2012)
https://doi.org/10.1145/2103776.2103783
Functional and Logic Programming
Makoto HamanaLecture Notes in Computer Science, Functional and Logic Programming 7294 136 (2012)
https://doi.org/10.1007/978-3-642-29822-6_13
Categorifying Computations into Components via Arrows as Profunctors
Kazuyuki Asada and Ichiro HasuoElectronic Notes in Theoretical Computer Science 264 (2) 25 (2010)
https://doi.org/10.1016/j.entcs.2010.07.012
Categorical semantics for arrows
BART JACOBS, CHRIS HEUNEN and ICHIRO HASUOJournal of Functional Programming 19 (3-4) 403 (2009)
https://doi.org/10.1017/S0956796809007308
Algebra and Coalgebra in Computer Science
Dusko PavlovicLecture Notes in Computer Science, Algebra and Coalgebra in Computer Science 5728 317 (2009)
https://doi.org/10.1007/978-3-642-03741-2_22
Comonadic Notions of Computation
Tarmo Uustalu and Varmo VeneElectronic Notes in Theoretical Computer Science 203 (5) 263 (2008)
https://doi.org/10.1016/j.entcs.2008.05.029
Arrows, like Monads, are Monoids
Chris Heunen and Bart JacobsElectronic Notes in Theoretical Computer Science 158 219 (2006)
https://doi.org/10.1016/j.entcs.2006.04.012