![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 14 May 2013, 15:45-16:45
Coinductive big-step semantics for concurrency
- đ¤ Speaker: Tarmo Uustalu ( Institute of Cybernetics, Tallinn University of Technology)
- đ Date & Time: Tuesday 14 May 2013, 15:45 - 16:45
- đ Venue: FW11, Computer Laboratory, William Gates Building
Abstract
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.
Series This talk is part of the Computer Laboratory Programming Research Group Seminar series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Programming Research Group Seminar
- Department of Computer Science and Technology talks and seminars
- FW11, Computer Laboratory, William Gates Building
- Interested Talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.