University of Cambridge > > Logic and Semantics Seminar (Computer Laboratory) > Interleaved scope for games and automata

Interleaved scope for games and automata

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

If you have a question about this talk, please contact Dominic Mulligan.

There has been some interest recently in applying nominal techniques to the semantics of games and automata. I will describe research into splitting name-restriction into explicit name-allocation and name-deallocation, written respectively. “” corresponds to “bind a in foo”, but scope may just as well be interleaved, as in “ b>”. I will discuss algebraic and relational models of interleaved scope, and outline applications which include game semantics and automata.​

​ Interested readers are referred to:

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity