## A Resumption Monad Transformer and its Applications in the Semantics of Concurrency (2001)

Citations: | 11 - 0 self |

### BibTeX

@MISC{Papaspyrou01aresumption,

author = {Nikolaos S. Papaspyrou},

title = { A Resumption Monad Transformer and its Applications in the Semantics of Concurrency },

year = {2001}

}

### Years of Citing Articles

### OpenURL

### 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

1335 | Imperative functional programming
- Jones, Wadler
- 1993
(Show Context)
Citation Context ...in [Barr96]. For a comprehensive introductions to monads and their use in denotational semantics the user is referred to [Mogg90]. A somehow different approach to the definition of monads is found in =-=[Wadl92]-=-, which expresses the current practice of monads in functional programming. The two approaches are equivalent. In this paper, the categorical approach (presented here) is used for the definition of mo... |

336 | Denotational Semantics: a Methodology for Language Development - Schmidt - 1986 |

267 | Domains for denotational semantics - Scott - 1982 |

242 | Monad transformers and modular interpreters - Liang, Hudak, et al. - 1995 |

178 | Basic Category Theory for Computer Scientists - Pierce - 1991 |

168 |
An abstract view of programming languages
- Moggi
- 1989
(Show Context)
Citation Context ...ical properties of monads are discussed in most books on category theory, e.g. in [Barr96]. For a comprehensive introductions to monads and their use in denotational semantics the user is referred to =-=[Mogg90]-=-. A somehow different approach to the definition of monads is found in [Wadl92], which expresses the current practice of monads in functional programming. The two approaches are equivalent. In this pa... |

153 | Semantic domains, in - Gunter, Scott - 1990 |

70 | Categories, types, and structures: an introduction to category theory for the working computer scientist. Foundations of computing - Asperti, Longo - 1991 |

35 |
Category Theory for Computing
- Barr, Wells
- 1990
(Show Context)
Citation Context ...s not new in the context of category theory. In Computer Science, monads became very popular in the 1990s. The categorical properties of monads are discussed in most books on category theory, e.g. in =-=[Barr96]-=-. For a comprehensive introductions to monads and their use in denotational semantics the user is referred to [Mogg90]. A somehow different approach to the definition of monads is found in [Wadl92], w... |

29 | Modular monadic semantics and compilation - Liang |

24 | A Formal Semantics for the C Programming Language
- Papaspyrou
- 1998
(Show Context)
Citation Context ...n be used in the semantics of deterministic languages with unspecified evaluation order, such as Algol and C. The present research was motivated by problems encountered in the formalization of ANSI C =-=[Papa98]-=-. A Haskell implementation of the resumption monad transformer, based on the isomorphism between R(M)(D) and D+M(R(M)(D)), has been used in [Papa00] to define the denotational semantics of an expressi... |

8 | A study of evaluation order semantics in expressions with side effects - Papaspyrou, Macos |

5 | Monad Transformers and Modular - Liang, Hudak, et al. - 1995 |