Skip navigation
Skip navigation

Compound monads in specification languages

Dawson, Jeremy

Description

We consider the language of "extended subsitutions" involving both angelic and demonic choice. For other related languages expressing program semantics the implicit model of computationis based on a combination of monads by a distributive law. We show how the model of computation underlying extended subsitutions is based on a monad which, while not being a compound monad, has strong similarities to a compound monad based on a distributive law. We discuss these compound monads and monad...[Show more]

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
URI: http://hdl.handle.net/1885/49875
Source: Proceedings of the 2007 Workshop on Programming Languages meets Program Verification (PLPV-2007)
DOI: 10.1145/1292597.1292600

Download

File Description SizeFormat Image
01_Dawson_Compound_monads_in_2007.pdf392.49 kBAdobe PDF    Request a copy
02_Dawson_Compound_monads_in_2007.pdf43.87 kBAdobe PDF    Request a copy
03_Dawson_Compound_monads_in_2007.pdf133.75 kBAdobe PDF    Request a copy
04_Dawson_Compound_monads_in_2007.pdf149.91 kBAdobe PDF    Request a copy
05_Dawson_Compound_monads_in_2007.pdf389.49 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator