Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Compound monads in specification languages

Simple item page
dc.contributor.authorDawson, Jeremy
dc.coverage.spatialFreiburg Germany
dc.date.accessioned2015-12-10T22:13:43Z
dc.date.createdOctober 5 2007
dc.date.issued2007
dc.date.updated2015-12-09T07:59:06Z
dc.description.abstractWe 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.
dc.identifier.isbn9781595936776
dc.identifier.urihttp://hdl.handle.net/1885/49875
dc.publisherAssociation for Computing Machinery Inc (ACM)
dc.relation.ispartofseriesProgramming Languages meets Program Verification (PLPV 2007)
dc.sourceProceedings of the 2007 Workshop on Programming Languages meets Program Verification (PLPV-2007)
dc.source.urihttp://portal.acm.org/toc.cfm?id=1292597&type=proceeding&coll=GUIDE&dl=GUIDE&idx=SERIES824∂=series&WantType=Proceedings&title=ICFP
dc.subjectKeywords: Mathematical models; Semantics; Theorem proving; Angelic choice; Distributive law for monads; Generalized substitutions; Specification languages Angelic choice; Compound monads; Demonic choice; Distributive law for monads; Extended substitutions; Generalised substitutions; Specification languages
dc.titleCompound monads in specification languages
dc.typeConference paper
local.bibliographicCitation.lastpage10
local.bibliographicCitation.startpage3
local.contributor.affiliationDawson, Jeremy, College of Engineering and Computer Science, ANU
local.contributor.authoruidDawson, Jeremy, u8413080
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080203 - Computational Logic and Formal Languages
local.identifier.absfor080299 - Computation Theory and Mathematics not elsewhere classified
local.identifier.ariespublicationu8803936xPUB193
local.identifier.doi10.1145/1292597.1292600
local.identifier.scopusID2-s2.0-38849136450
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 5 of 5
Thumbnail Image
Name:
01_Dawson_Compound_monads_in_2007.pdf
Size:
392.49 KB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
02_Dawson_Compound_monads_in_2007.pdf
Size:
43.87 KB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
03_Dawson_Compound_monads_in_2007.pdf
Size:
133.75 KB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
04_Dawson_Compound_monads_in_2007.pdf
Size:
149.91 KB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
05_Dawson_Compound_monads_in_2007.pdf
Size:
389.49 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS