Edinburgh Research Archive

Notions of Computation Determine Monads

Simple item page
dc.contributor.author
Plotkin, Gordon
en
dc.contributor.author
Power, John
en
dc.date.accessioned
2003-11-05T10:40:06Z
dc.date.available
2003-11-05T10:40:06Z
dc.date.issued
2002
dc.description.abstract
We 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.extent
192666 bytes
en
dc.format.mimetype
application/pdf
en
dc.identifier.citation
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS LECTURE NOTES IN COMPUTER SCIENCE 2303: 342-356 2002
dc.identifier.issn
0302-9743
dc.identifier.uri
http://hdl.handle.net/1842/196
dc.language.iso
en
dc.publisher
SPRINGER-VERLAG
en
dc.subject
Laboratory for Foundations of Computer Science
en
dc.title
Notions of Computation Determine Monads
en
dc.type
Preprint
en

Files

Original bundle

Now showing 1 - 1 of 1
Name:
Comp_Eff_Monads.pdf
Size:
188.15 KB
Format:
Adobe Portable Document Format
Download

This item appears in the following Collection(s)

Informatics Publications