Downloads provided by UsageCounts
AbstractThe notion of trace in a monoidal category has been introduced to give a categorical account of a situation occurring in very different settings: linear algebra, topology, knot theory, proof theory... with the trace operation understood as a feedback operation. Partially traced categories were later introduced to account for cases where the trace is not always defined, and it was shown that partially traced category can always be seen as a subcategory of a totally traced one. We give a new proof of this representation theorem, using a construction that is different from the original one. However, since they satisfy the same universal property they are naturally isomorphic.
monoidal category, feedback, trace, representation theorem, Theoretical Computer Science, Computer Science(all)
monoidal category, feedback, trace, representation theorem, Theoretical Computer Science, Computer Science(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 3 | |
| downloads | 3 |

Views provided by UsageCounts
Downloads provided by UsageCounts