Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Walters, R.F.C.
1989.
The free category with products on a multigraph.
Journal of Pure and Applied Algebra,
Vol. 62,
Issue. 2,
p.
205.
Kasangian, S.
and
Walters, R.F.C.
1990.
The duality between flow charts and circuits.
Bulletin of the Australian Mathematical Society,
Vol. 42,
Issue. 1,
p.
71.
Degano, P.
Kasangian, S.
and
Vigna, S.
1991.
Category Theory and Computer Science.
Vol. 530,
Issue. ,
p.
282.
Kasangian, S.
and
Vigna, S.
1991.
Category Theory.
Vol. 1488,
Issue. ,
p.
237.
Jay, C. Barry
1991.
Category Theory and Computer Science.
Vol. 530,
Issue. ,
p.
151.
Robin, J.
and
Cockett, B.
1991.
IV Higher Order Workshop, Banff 1990.
p.
190.
Walters, R. F. C.
1992.
An imperative language based on distributive categories.
Mathematical Structures in Computer Science,
Vol. 2,
Issue. 3,
p.
249.
Abramsky, S.
and
Jagadeesan, R.
1992.
New foundations for the geometry of interaction.
p.
211.
Cockett, J.R.B.
1992.
Categories with finite limits and stable binary coproducts can be subdirectly decomposed.
Journal of Pure and Applied Algebra,
Vol. 78,
Issue. 2,
p.
131.
Barry Jay, C.
1993.
Tail recursion through universal invariants.
Theoretical Computer Science,
Vol. 115,
Issue. 1,
p.
151.
Carboni, Aurelio
and
Johnstone, Peter
1995.
Connected limits, familial representability and Artin glueing.
Mathematical Structures in Computer Science,
Vol. 5,
Issue. 4,
p.
441.
Katis, Piergiulio
Sabadini, N.
and
Walters, R. F. C.
1997.
Algebraic Methodology and Software Technology.
Vol. 1349,
Issue. ,
p.
307.
Gates, R.
1998.
On the generic solution toP(X) ≅ X in distributive categories.
Journal of Pure and Applied Algebra,
Vol. 125,
Issue. 1-3,
p.
191.
Gibbons, Jeremy
2002.
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction.
Vol. 2297,
Issue. ,
p.
151.
Ackerman, Nate
Freer, Cameron E.
Kaddar, Younesse
Karwowski, Jacek
Moss, Sean
Roy, Daniel
Staton, Sam
and
Yang, Hongseok
2024.
Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets.
Proceedings of the ACM on Programming Languages,
Vol. 8,
Issue. POPL,
p.
1819.
Nester, Chad
and
Voorneveld, Niels
2024.
Protocol choice and iteration for the free cornering.
Journal of Logical and Algebraic Methods in Programming,
Vol. 137,
Issue. ,
p.
100942.