![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Towards Coherence for Guarded Traces
Towards Coherence for Guarded TracesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Paul Levy. [Note unusual date and location.] Abstract guardedness is a unifying mechanism allowing for identification of the equational theory of partial trace operators in (symmetric) monoidal categories in a compositional way. Examples include classical total iteration and recursion, partial recursion in categories of pre-domains and complete metric spaces, partial iteration in categories for modeling concurent processes and hybrid programs, as well as traces of infinite-dimentional Hilbert spaces. A salient feature of guarded traces is that they can be thought of both in a structural and in a geometric way. A precise connection between these two complementing views amounts to formulating and proving a suitable coherence theorem, which cannot really be done on the level of guarded traced monoidal categories. Here, I present an approach to coherence based on guarded traced colored props, providing a necessary level of abstraction and a more direct connection to conventional graphical languages of string diagrams. This is a joint work (in progress) with Lutz Schröder and Paul Levy. This talk is part of the Theoretical computer science seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsApplied Mathematics Seminar Series Jane Langdale Analysis seminarOther talksModelling uncertainty in image analysis. Sensing and metrology activities at NPL, India Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Geometry of alternating projections in metric spaces with bounded curvature Hodge Theory: Connecting Algebra and Analysis Ultrafast, all-optical, and highly efficient imaging of molecular chirality |