Monadic state
- 1 August 1997
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 32 (8) , 227-238
- https://doi.org/10.1145/258948.258970
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- The call-by-need lambda calculusJournal of Functional Programming, 1997
- State in HaskellHigher-Order and Symbolic Computation, 1995
- A call-by-need lambda calculusPublished by Association for Computing Machinery (ACM) ,1995
- Lazy functional state threadsPublished by Association for Computing Machinery (ACM) ,1994
- Delimiting the scope of effectsPublished by Association for Computing Machinery (ACM) ,1993
- Call by name, assignment, and the lambda calculusPublished by Association for Computing Machinery (ACM) ,1993
- Equivalence in functional languages with effectsJournal of Functional Programming, 1991
- Type inference for polymorphic referencesInformation and Computation, 1990
- Laws of programmingCommunications of the ACM, 1987
- Side effects and aliasing can have simple axiomatic descriptionsACM Transactions on Programming Languages and Systems, 1985