DMCA
Compositional References for Stateful Functional Programming (1997)
| Venue: | In Proceedings of the 2nd ACM SIGPLAN International Conference on Functional Programming (ICFP’97 |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Kagawa97compositionalreferences,
author = {Koji Kagawa},
title = {Compositional References for Stateful Functional Programming},
booktitle = {In Proceedings of the 2nd ACM SIGPLAN International Conference on Functional Programming (ICFP’97},
year = {1997},
pages = {217--226},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We introduce the notion of compositional references into the framework of monadic functional programming and propose a set of new primitives based on this notion. They enable us to use a wide range of mutable data structures. There, references may be passed around explicitly, or mutable data structures such as arrays and tuples may be passed implicitly as hidden state. The former style is called the explicit style and is usually more expressive, while the latter is called the implicit style and has simpler semantics. We investigate the relation between the two styles and discus implementation issues. 1 Introduction Many proposals have been made toward a safe integration of a purely, lazy functional language with in-place updatable state [3, 1, etc.]. In a series of proposals [16, 11], the notion of monads [7] provides a basis for such an integration. Based on monads, Launchbury and Peyton Jones [5] proposed a way to express computations which deal with multiple mutable objects by pr...
Keyphrases
compositional reference stateful functional programming mutable data structure former style introduction many proposal implicit style multiple mutable object implementation issue safe integration new primitive lazy functional language peyton jones wide range hidden state monadic functional programming in-place updatable state explicit style
