State in Haskell
- 1 December 1995
- journal article
- research article
- Published by Springer Nature in Higher-Order and Symbolic Computation
- Vol. 8 (4), 293-341
- https://doi.org/10.1007/bf01018827
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Structuring depth-first search algorithms in HaskellPublished by Association for Computing Machinery (ACM) ,1995
- A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculusACM SIGPLAN Lisp Pointers, 1994
- Using Hindley-Milner type inference to optimise list representationACM SIGPLAN Lisp Pointers, 1994
- Functional Pearl: On generating unique namesJournal of Functional Programming, 1994
- Type reconstruction in finite rank fragments of the second-order λ-calculusInformation and Computation, 1992
- M-structures: Extending a parallel, non-strict, functional language with stateLecture Notes in Computer Science, 1991
- I-structures: data structures for parallel computingACM Transactions on Programming Languages and Systems, 1989
- Why Functional Programming MattersThe Computer Journal, 1989
- Integrating functional and imperative programmingPublished by Association for Computing Machinery (ACM) ,1986
- Using circular programs to eliminate multiple traversals of dataActa Informatica, 1984