Lecture 35: ML with references.

In order to program with state in Haskell, we have discussed monads that allow programmers to thread a state as an array through a computation, without cluttering the syntax to much.

ML however pursues another solution to this problem by extending the type system explicitly by a notion of state and references. We discuss this type system in this lecture.

Further Reading:

Wright and Felleisen. A Syntactic Approach to Type Soundness. Information and Computation. Volume 115. 1994.

Previous lecture: Lecture 34
Next lecture: Lecture 36