Year: 1994
Type: conference-paper
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.
Authors: John Launchbury, Simon L. Peyton Jones
Institution: University of Glasgow
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: mutable state, monads, lazy evaluation
Open Access status: bronze
OpenAlex ID: W2074802267
