Journal article
Functions with local state: regularity and undecidability
- Abstract:
-
We study programs of a finitary ML-like language RMLf with ground-type references. RMLf 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 that this leads to undecidability of program equivalence already at second order. We also examine the extent to which this feature can be captured by regular languages. This gives a decidability result for a second-order fr...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Funding
+ St. John's College, University of Oxford
More from this funder
Funding agency for:
Murawski, A
Grant:
GR/R88861/01
+ Engineering and Physical Sciences Research Council
More from this funder
Funding agency for:
Murawski, A
Grant:
GR/R88861/01
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Theoretical Computer Science Journal website
- Volume:
- 338
- Issue:
- 1-3
- Pages:
- 315–349
- Publication date:
- 2005-06-01
- DOI:
- ISSN:
-
0304-3975
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:537af42f-01ca-427e-a341-8e114caa5117
- Local pid:
- ora:10758
- Deposit date:
- 2015-03-30
Related Items
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2005
- Notes:
- Copyright 2005 Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
- Licence:
- Other
If you are the owner of this record, you can report an update to it here: Report update to this record