State in Haskell (1996)
Cached
Download Links
- [ftp.supelec.fr]
- [ftp.dcs.gla.ac.uk]
- [www.research.microsoft.com]
- [ftp.dcs.gla.ac.uk]
- DBLP
Other Repositories/Bibliography
| Citations: | 185 - 14 self |
BibTeX
@INPROCEEDINGS{Launchbury96statein,
author = {John Launchbury and Simon Peyton Jones},
title = {State in Haskell},
booktitle = {},
year = {1996},
pages = {295--308},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Some algorithms make critical internal use of updatable state, even though their external specification is purely functional. Based on earlier work on monads, we present a way of securely encapsulating stateful computations that manipulate multiple, named, mutable objects, in the context of a non-strict, purely-functional language. The security of the encapsulation is assured by the type system, using parametricity. The same framework is also used to handle input/output operations (state changes on the external world) and calls to C. 1. Introduction Purely functional programming languages allow many algorithms to be expressed very concisely, but there are a few algorithms in which in-place updatable state seems to play a crucial role. For these algorithms, purely-functional languages, which lack updatable state, appear to be inherently inefficient (Ponder, McGeer & Ng [1988]). Examples of such algorithms include: ffl Algorithms based on the use of incrementally-modified hash tables...
Citations
No citations identified.
