Show simple item record

dc.contributor.authorPlotkin, Gordon
dc.contributor.authorPower, John
dc.date.accessioned2003-11-05T10:40:06Z
dc.date.available2003-11-05T10:40:06Z
dc.date.issued2002
dc.identifier.citationFOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS LECTURE NOTES IN COMPUTER SCIENCE 2303: 342-356 2002en
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/1842/196
dc.description.abstractWe model notions of computation using algebraic operations and equations. We show that these generate several of the monads of pri- mary interest that have been used to model computational e ects, with the striking omission of the continuations monad. We focus on semantics for global and local state, showing that taking operations and equations as primitive yields a mathematical relationship that reflects their com- putational relationship.en
dc.format.extent192666 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherSPRINGER-VERLAGen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleNotions of Computation Determine Monadsen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record