BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Coinductive big-step semantics for concurrency - Tarmo Uustalu ( I
 nstitute of Cybernetics\, Tallinn University of Technology)
DTSTART:20130514T144500Z
DTEND:20130514T154500Z
UID:TALK45096@talks.cam.ac.uk
CONTACT:33174
DESCRIPTION:Disputing the popular statements that big-step semantics canno
 t 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\nthat accou
 nts correctly for both terminating and nonterminating runs. This semantics
  is based on coinductive and mixed inductive-coinductive\ndefinitions of r
 esumptions or computation trees (alternatively traces or computation paths
 )\, evaluation and termination-sensitive weak bisimilarity. It agrees\, co
 nstructively\, with the intended small-step semantics.
LOCATION:FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR