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

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

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.

Other lists

Cargo Metallurgy & Materials – Tech Entrepreneurship Seminar Series Type the title of a new list here

Other talks

When less is more - reduced physics simulations of the solar wind Sensing and metrology activities at NPL, India Perfect matchings in random sparsifications of Dirac hypergraphs Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Hodge Theory: Connecting Algebra and Analysis Quantum simulations using ultra cold ytterbium
 

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