University of Birmingham > Talks@bham > Theoretical computer science seminar > Interaction morphisms

## Interaction morphismsAdd to your list(s) Download to your calendar using vCal - Tarmo Uustalu (Institute of Cybernetics, Tallinn University of Technology)
- Friday 02 December 2016, 11:00-12:00
- Computer Science, The Sloman Lounge (UG).
If you have a question about this talk, please contact Paul Taylor. I will propose interaction morphisms as a means to specify how an effectful computation is to be run, provided a state in a context. An interaction morphism of a monad T and a comonad D is a family of maps T X x D Y -> X x Y natural in X and Y and subject to some equations. Interaction morphisms turn out to be a natural concept with a number of neat properties. In particular, interaction morphisms are the same as monoids in a certain monoidal category; interaction morphisms of T and D are in a bijective correspondence with carrier-preserving functors between the categories of coalgebras of D and stateful runners of T (monad morphisms from T to state monads); they are also in a bijective correspondence with monad morphisms from T to a monad induced in a certain way by D. This is joint work with Shin-ya Katsumata (University of Kyoto). This talk is part of the Theoretical computer science seminar series. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Computer Science, The Sloman Lounge (UG)
- Theoretical computer science seminar
- computer sience
Note that ex-directory lists are not shown. |
## Other listsSchool of Metallurgy and Materials Colloquia Beverley Glover Lab Lunch## Other talksHidden Markov Model in Multiple Testing on Dependent Data Structured Decompositions: recursive data and recursive algorithms TBC Module tensor categories and the Landau-Ginzburg/conformal field theory correspondence The science of the large scale heliosphere and the missions that made it possible TBA |