Monadic state Conferences

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 that the semantic notion of value provided by the explicit monadic types is able to avoid any problems with generalization.

authors

• Launchbury, John
• Sabry, Amr

status

• published 

publication date

• August 1997

has subject area

• Software Engineering (Science Metrix)

published in

• ACM SIGPLAN Notices  Journal

presented at event

• 2nd ACM SIGPLAN International Conference on Functional Programming (ICFP)  Conference

keywords

• Computer Science
• Computer Science, Software Engineering
• Science & Technology
• Technology

Digital Object Identifier (DOI)

• 10.1145/258949.258970

start page

• 227

end page

• 238

volume

• 32

issue

• 8