A Resumption Monad Transformer and its Applications in the Semantics of Concurrency

Papaspyrou, N

dc.contributor.author	Papaspyrou, N	en
dc.date.accessioned	2014-03-01T01:50:40Z
dc.date.available	2014-03-01T01:50:40Z
dc.date.issued	2001	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/26066
dc.relation.uri	http://www.softlab.ntua.gr/~nickie/Papers/papaspyrou-2001-rmtasc.pdf	en
dc.subject	Concurrent Programs	en
dc.subject	Semantic Model	en
dc.title	A Resumption Monad Transformer and its Applications in the Semantics of Concurrency	en
heal.type	journalArticle	en
heal.publicationDate	2001	en
heal.abstract	Resumptions are a valuable tool in the analysis and de- sign of semantic models for concurrent programming lan- guages, in which computations consist of sequences of atomic steps that may be interleaved. In this paper we con- sider a general notion of resumption, parameterized by the kind of computations that take place in the atomic steps. We define a monad	en