Correctness of Monadic State: An Imperative Call-by-Need Calculus

Correctness of Monadic State: An Imperative Call-by-Need Calculus (1998)

Cached

Download Links

[www.cs.indiana.edu]
[ftp.cs.uoregon.edu]

Other Repositories/Bibliography

DBLP

by Zena M. Ariola , Amr Sabry

Venue:	In Proc. 25th ACM Symposium on Principles of Programming Languages
Citations:	20 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Correctness of Monadic State: An Imperative Call-by-Need Calculus	user correction - Legacy Corrections
AUTHOR NAME	Zena M. Ariola	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer & Information Science; University of Oregon	user correction - Legacy Corrections
AUTHOR ADDR	Eugene, OR 97403	user correction - Legacy Corrections
AUTHOR NAME	Amr Sabry	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer & Information Science; University of Oregon	user correction - Legacy Corrections
AUTHOR ADDR	Eugene, OR 97403	user correction - Legacy Corrections
ABSTRACT	The extension of Haskell with a built-in state monad combines 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 views is far from obvious: all it takes for the implementation to become unsound is one judiciously-placed beta-step in the optimization phase of the compiler. This discovery motivates the current paper in which we formalize and show the correctness of the implementation of monadic state. For the proof, we first design a typed call-by-need language that models the intermediate language of the compiler, to...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	In Proc. 25th ACM Symposium on Principles of Programming Languages	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	62--74	INFERENCE
CITATIONS	36 found	ParsCit 1.0