University of Cambridge > Talks.cam > Computer Laboratory Programming Research Group Seminar > Coinductive big-step semantics for concurrency

Coinductive big-step semantics for concurrency

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

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

Note unusual time and day

Disputing the popular statements that big-step semantics cannot handle nontermination (they would necessarily “lose” all nonterminating runs) and that concurrency is inherently small-step, I present a big-step semantics for a toy language with shared-variable concurrency that accounts correctly for both terminating and nonterminating runs. This semantics is based on coinductive and mixed inductive-coinductive definitions of resumptions or computation trees (alternatively traces or computation paths), evaluation and termination-sensitive weak bisimilarity. It agrees, constructively, with the intended small-step semantics.

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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