Non-monadic models of mutable references

Authors:
Péter Diviánszky
Affiliations:
Eötvös Loránd University, Fac. of Informatics, Programming Lang. and Compilers Dep., Budapest, Hungary
Venue:
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Year:
2009

Citing 9
Cited 0

Lazy functional state threads

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Polymorphic type inference and abstract data types

ACM Transactions on Programming Languages and Systems (TOPLAS)
How to declare an imperative

ACM Computing Surveys (CSUR)
Type Classes with Functional Dependencies

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Monadic regions

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
iTasks: executable specifications of interactive work flow systems for the web

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Beauty in the beast

Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Type checking with open type functions

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Uniqueness Typing Simplified

Implementation and Application of Functional Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pointers are known as mutable references in pure functional programming languages. In Haskell, IO-references and ST-references are the well-known monadic models of references. This paper propose a model of mutable references based on unique heaps. This model put less restriction on the evaluation order of basic reference operations. Moreover it has simpler, more tractable semantics and it supports features like shared references between heaps and virtual union of heaps. The proposed model needs uniqueness typing. This need could be seen as a drawback but it can also be seen as a motivation for the spread of uniqueness typing in functional languages.