(Enter summary)
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 such stateful computations,
in the context of a non-strict, purely-functional
language.
There are two main new developments in this paper.
First, we show how to use the type system to securely
encapsulate stateful computations, including ones which
manipulate multiple, named, mutable objects.... (Update)
Cited by: More
A Programming Language for Probabilistic Computation - Park (2005)
(Correct)
Monadic Corecursion - Definition, Fusion Laws, and Applications - Pardo (1998)
(Correct)
Lessons learned from the Shared Memory Parallelization of a.. - Grelck
(Correct)
Similar documents (at the sentence level):
46.5%: State in Haskell - Launchbury, Jones (1996)
(Correct)
Active bibliography (related documents): More All
1.0: Lazy Functional State Threads - Launchbury (1994)
(Correct)
0.1: A Theory of Weak Bisimulation for Core CML - Ferreira, Hennessy, Jeffrey (1993)
(Correct)
0.1: The Token Flow Model - Buck, Lee (1992)
(Correct)
Similar documents based on text: More All
0.3: Compositional References for Stateful Functional Programming - Kagawa (1997)
(Correct)
0.2: Monad-independent dynamic logic in HasCasl - Schröder, Mossakowski (2003)
(Correct)
0.2: Declarative Forrealization of Heuristics - Josefina Sierra-Santibfiez..
(Correct)
Related documents from co-citation: More All
48: Imperative functional programming
- Jones, Wadler - 1993
26: The essence of functional programming
- Wadler - 1992
25: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
BibTeX entry: (Update)
J. Launchbury and S. L. Peyton Jones. Lazy functional state threads. In Proceedings of the 1994 SIGPLAN Conference on Programming Language Design and Implementation (PLDI), volume 29 of SIGPLAN Notices, pages 0--9999, June 1994. http://citeseer.ist.psu.edu/article/launchbury93lazy.html More
@inproceedings{ launchbury94lazy,
author = "John Launchbury and Simon L. Peyton Jones",
title = "Lazy Functional State Threads",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "24-35",
year = "1994",
url = "citeseer.ist.psu.edu/article/launchbury93lazy.html" }
Citations (may not include all citations):
362
ML for the working programmer (context) - Paulson - 1991
244
Imperative functional programming
- Jones, Wadler - 1993
61
Conventional and uniqueness typing in graph rewrite systems
- Barendsen, Smetsers - 1993
61
Detecting global variables in denotational specifications (context) - Schmidt - 1985
46
Assignments for applicative languages (context) - Swarup, Reddy et al. - 1991
40
Unboxed values as first class citizens (context) - Jones, Launchbury - 1991
29
Integrating functional and imperative programming (context) - Gifford, Lucassen - 1986
24
The typechecking of programs with implicit type structure (context) - McCracken - 1984
23
Lazy imperative programming
- Launchbury - 1993
22
Second-order logical relations (context) - Mitchell, Meyer - 1985
6
Id Reference Manual (context) - Nikhil - 1988
3
Are applicative languages inefficient (context) - Ponder, McGeer et al. - 1988
3
Call by name, assignment, and the lambda calculus
- Odersky, Rabin et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://uebb.cs.tu-berlin.de/papers/external/functional-state-guis/): More
Functional Languages and Graphical User Interfaces - a review .. - Noble, Runciman (1994)
(Correct)
Lazy Imperative Programming - Launchbury (1993)
(Correct)
Imperative Functional Programming - Jones, Wadler (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC