Name
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.
|
Year | DOI | Venue |
|---|---|---|
1997 | 10.1145/258949.258970 | Special Interest Group on Programming Languages |
Keywords | Field | DocType |
type safety,monads,operational semantics | Operational semantics,Programming language,Program transformation,Computer science,Theoretical computer science,Haskell,Type safety,Monad (functional programming) | Conference |
Volume | Issue | ISSN |
32 | 8 | 0362-1340 |
ISBN | Citations | PageRank |
0-89791-918-1 | 15 | 1.25 |
References | Authors | |
20 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Launchbury | 1 | 1103 | 92.40 |
| Amr Sabry | 2 | 520 | 35.46 |