Show simple item record

dc.contributor.authorPlotkin, Gordon
dc.contributor.authorPower, John
dc.date.accessioned2003-11-05T11:02:10Z
dc.date.available2003-11-05T11:02:10Z
dc.date.issued2002
dc.identifier.urihttp://hdl.handle.net/1842/198
dc.description.abstractWe overview a programme to provide a unified semantics for computational effects based upon the notion of a countable enriched Lawvere theory. We define the notion of countable enriched Lawvere theory, show how the various leading examples of computational effects, except for continuations, give rise to them, and we compare the definition with that of a strong monad. We outline how one may use the notion to model three natural ways in which to combine computational effects: by their sum, by their commutative combination, and by distributivity. We also outline a unified account of operational semantics. We present results we have already shown, some partial results, and our plans for further development of the programme.en
dc.format.extent203638 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleComputational effects and operations: an overviewen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record