Functions with local state: regularity and undecidability
We study programs of a finitary ML-like language RML<sub>f</sub> with ground-type references. RML<sub>f</sub> permits the use of functions with locally declared variables that remain private and persist from one use of the function to the next. Using game semantics we show th...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2005
|
| Subjects: |