Summary: Correctness of Monadic State:
An Imperative Call­by­Need Calculus
Zena M. Ariola Amr Sabry
Department of Computer & Information Science
University of Oregon
Eugene, OR 97403
ariola@cs.uoregon.edu sabry@cs.uoregon.edu
Abstract
The extension of Haskell with a built­in state monad com­
bines mathematical elegance with operational efficiency:
ffl Semantically, at the source language level, constructs
that act on the state are viewed as functions that pass
an explicit store data structure around.
ffl Operationally, at the implementation level, constructs
that act on the state are viewed as statements whose
evaluation has the side­effect of updating the implicit
global store in place.
There are several unproven conjectures that the two views
are consistent.
Recently, we have noted that the consistency of the two

Source: Ariola, Zena M. - Department of Computer and Information Science, University of Oregon
Sabry, Amr - Computer Science Department, Indiana University

Collections: Computer Technologies and Information Sciences