Loading...
Please wait, while we are loading the content...
Similar Documents
Compound monads in specification languages
| Content Provider | ACM Digital Library |
|---|---|
| Author | Dawson, Jeremy E. |
| Abstract | 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 morphisms between them. We have used the theorem prover Isabelle to formal ise and machine-check our results. |
| Starting Page | 3 |
| Ending Page | 10 |
| Page Count | 8 |
| File Format | |
| ISBN | 9781595936776 |
| DOI | 10.1145/1292597.1292600 |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2007-10-02 |
| Publisher Place | New York |
| Access Restriction | Subscribed |
| Subject Keyword | Distributive law for monads Angelic choice Compound monads Specification languages Extended substitutions Demonic choice Generalised substitutions |
| Content Type | Text |
| Resource Type | Article |
