University of Birmingham > Talks@bham > Theoretical computer science seminar > Handlers in Scope with Adjunctions

Handlers in Scope with Adjunctions

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

If you have a question about this talk, please contact Paul Taylor.

Motivated by the problem of separating syntax form semantics in programming with algebraic effects and handlers, we propose a categorical model of abstract syntax with so-called scoped operations. As a building block of a term, a scoped operation is not merely a node in a tree, as it can also encompass a whole part of the term (a scope). Some examples from the area of programming are given by the operation `catch` for handling exceptions, in which the part in the scope is the code that may raise an exception.

Our model is based on what Ghani et al. called the monad of explicit substitutions, defined using the initial-algebra semantics in the category of endofunctors. We also introduce a new kind of multi-sorted algebras, called scoped algebras, which serve as interpretations of scopes.

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 talks.cam from the University of Cambridge.