Parameterized algebraic theories and computational effects

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

• Sam Staton, University of Cambridge
• Friday 09 March 2012, 16:00-17:00
• UG40 Computer Science.

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

Many notions of computation can be described in an algebraic way. I will talk about a class of generalized algebraic theories that I call “parameterized algebraic theories”. These theories can be used to describe various notions of computation, including name generation, local exception handling, and functional logic programming.

Parameterized algebraic theories have a straightforward syntactic deduction systems and an elegant categorical model theory. I will use this model theory to provide representation theorems and completeness results for the notions of computation.

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
• Theoretical computer science seminar
• UG40 Computer Science
• computer sience

Note that ex-directory lists are not shown.