Functions with local state: regularity and undecidability
From MaRDI portal
Publication:557802
DOI10.1016/j.tcs.2004.12.036zbMath1108.68076OpenAlexW2011823280MaRDI QIDQ557802
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:537af42f-01ca-427e-a341-8e114caa5117
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)
Related Items (11)
The impact of higher-order state and control effects on local relational reasoning ⋮ Algorithmic games for full ground references ⋮ Full abstraction for Reduced ML ⋮ Block structure vs scope extrusion: between innocence and omniscience ⋮ ML and Extended Branching VASS ⋮ Algorithmic Nominal Game Semantics ⋮ A Fragment of ML Decidable by Visibly Pushdown Automata ⋮ Algorithmic probabilistic game semantics. Playing games with automata ⋮ Full Abstraction for Reduced ML ⋮ Games for complexity of second-order call-by-name programs ⋮ Syntactic control of concurrency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The regular-language semantics of second-order idealized ALGOL
- Visibly pushdown languages
- Game theoretic analysis of call-by-value computation
- Regular-Language Semantics for a Call-by-Value Programming Language
- About the undecidability of program equivalence in finitary languages with state
- Tools and Algorithms for the Construction and Analysis of Systems
- Foundations of Software Science and Computation Structures
- Automata, Languages and Programming
- Foundations of Software Science and Computational Structures
- Formal Reductions of the General Combinatorial Decision Problem
This page was built for publication: Functions with local state: regularity and undecidability
