Show simple item record

dc.contributor.authorPlotkin, Gordon
dc.contributor.authorPower, John
dc.date.accessioned2003-11-03T11:02:20Z
dc.date.available2003-11-03T11:02:20Z
dc.date.issued2002
dc.identifier.citationLECTURE NOTES IN COMPUTER SCIENCE 2303: 342-356 2002en
dc.identifier.urihttp://hdl.handle.net/1842/187
dc.description.abstractMoggi proposed a monadic account of computational effects. He also presented the computational lamda-calculus, c, a core call-by-value functional programming language for effects; the effects are obtained by adding appropriate operations. The question arises as to whether one can give a corresponding treatment of operational semantics. We do this in the case of algebraic e ects where the operations are given by a single-sorted algebraic signature, and their semantics is supported by the monad, in a certain sense. We consider call-by-value PCF with— and without—recursion, an extension of c with arithmetic. We prove general adequacy theorems, and illustrate these with two examples: non- determinism and probabilistic nondeterminism.en
dc.format.extent258393 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherSPRINGER-VERLAGen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleAdequacy for Algebraic Effectsen
dc.title.alternativeNotions of computation determine monadsen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record