We extend the simple typed \lambda-calculus with statements. A statement (which can also be thought of as a method or transition) is an abstraction similar to function abstraction: it can be instantiated by providing it with a source state, whereafter it yields a pair of values consisting of an output value and a target state. We obtain a strongly normalising typed calculus for state-based functional programming.
|Title of host publication||Special Issues in Object-Oriented Programming|
|Place of Publication||Heidelberg, Germany|
|Number of pages||4|
|Publication status||Published - 1997|