Conference
Monadic state
Abstract
Type safety of imperative programs is an area fraught with difficulty and requiring great care. The SML solution to the problem, originally involving imperative type variables, has been recently simplified to the syntactic-value restriction. In Haskell, the problem is addressed in a rather different way using explicit monadic state. We present an operational semantics for state in Haskell and the first full proof of type safety. We demonstrate …
Authors
Launchbury J; Sabry A
Volume
32
Pagination
pp. 227-238
Publisher
Association for Computing Machinery (ACM)
Publication Date
August 1997
DOI
10.1145/258949.258970
Conference proceedings
ACM SIGPLAN Notices
Issue
8
ISSN
0362-1340