| Issue |
RAIRO-Theor. Inf. Appl.
Volume 37, Number 4, October-December 2003
Fixed Points in Computer Science (FICS'02)
|
|
|---|---|---|
| Page(s) | 273 - 299 | |
| DOI | https://doi.org/10.1051/ita:2003020 | |
| Published online | 15 January 2004 | |
Traced Premonoidal Categories
1
Microsoft Research, Roger Needham Building, 7 J J Thomson Avenue, Cambridge CB3 0FB, UK; nick@microsoft.com.
2
University of Cambridge, Department of Pure Mathematics and
Mathematical Statistics, Wilberforce Road, Cambridge CB3 0WB, UK; M.Hyland@dpmms.cam.ac.uk.
Received:
12
November
2002
Accepted:
14
August
2003
Motivated by some examples from functional programming, we propose a generalization of the notion of trace to symmetric premonoidal categories and of Conway operators to Freyd categories. We show that in a Freyd category, these notions are equivalent, generalizing a well-known theorem relating traces and Conway operators in Cartesian categories.
Mathematics Subject Classification: 68N18 / 03B70 / 03G30
Key words: Traces / fixed point operators / premonoidal categories / recursion / monads.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.