Coinductive Big-Step Semantics for Concurrency
In a paper presented at SOS 2010, we developed a framework for big-step semantics for interactive input-output in combination with divergence, based on coinductive and mixed inductive-coinductive notions of resumptions, evaluation and termination-sensitive weak bisimilarity. In contrast to standard...
Main Author: | Tarmo Uustalu |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2013-12-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1312.2702v1 |
Similar Items
-
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction
by: Keiko Nakata, et al.
Published: (2010-08-01) -
Structured general corecursion and coinductive graphs [extended abstract]
by: Tarmo Uustalu
Published: (2012-02-01) -
Coinductive Natural Semantics for Compiler Verification in Coq
by: Angel Zúñiga, et al.
Published: (2020-09-01) -
A coinductive semantics of the Unlimited Register Machine
by: Alberto Ciaffaglione
Published: (2011-11-01) -
Représentation coinductive des graphes
by: Picard, Celia
Published: (2012)