University of Birmingham > Talks@bham > Theoretical computer science seminar > Hierarchical string diagrams for closed monoidal categories

Hierarchical string diagrams for closed monoidal categories

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dan Ghica.

Last week we have seen an application of HSDs to defining an automatic differentiation algorithm and proving its correctness. This week I will give an (impromptu) seminar describing HSDs as a graphical language for closed monoidal (and cartesian closed) categories.

Meeting ID: 873 4739 3966 Passcode: 825034

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.