Abstract

Resumptions are a valuable tool in the analysis and design of semantic models for concurrent programming languages, in which computations consist of sequences of atomic steps that may be interleaved. In this paper we consider a general notion of resumption, parameterized by the kind of computations that take place in the atomic steps. We define a monad transformer which, given a monad M that represents the atomic computations, constructs a monad R(M) for interleaved computations. Moreover, we use this monad transformer to define the denotational semantics of a simple imperative language supporting nondeterminism and concurrency.

Citations

1225	The essence of functional programming - Wadler - 1992
303	Denotational Semantics: A Methodology for Language Development - SCHMIDT - 1986
249	Domains for Denotational Semantics - Scott - 1982
213	Monad transformers and modular interpreters - Liang, Hudak, et al. - 1995
154	An abstract view of programming languages - Moggi - 1990
149	Basic Category Theory for Computer Scientists - Pierce - 1991
136	Semantic Domains - Gunter, Scott - 1990
65	Categories, Types and Structures. An introduction to Category Theory for the working computer scientist - Asperti, Longo - 1991
29	Category Theory for Computing - Barr, Wells - 1999
28	Modular Monadic Semantics and Compilation - Liang - 1998
18	A Formal Semantics for the C Programming Language - Papaspyrou - 1998
5	A Study of Evaluation Order Semantics in Expressions with Side Effects - Papaspyrou, Macos - 2000
5	Monad Transformers and Modular - Liang, Hudak, et al. - 1995