Algorithmic Nominal Game Semantics
From MaRDI portal
Publication:3000592
DOI10.1007/978-3-642-19718-5_22zbMath1326.68071MaRDI QIDQ3000592
Andrzej S. Murawski, Nikos Tzevelekos
Publication date: 19 May 2011
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19718-5_22
68Q45: Formal languages and automata
68N18: Functional programming and lambda calculus
68Q55: Semantics in the theory of computing
Related Items
Polynomial-time equivalence testing for deterministic fresh-register automata, Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts, On-the-fly bisimilarity checking for fresh-register automata, Full abstraction for Reduced ML, Program equivalence in a simple language with state, Algorithmic games for full ground references, Reachability in pushdown register automata, ML and Extended Branching VASS, A Fragment of ML Decidable by Visibly Pushdown Automata, Full Abstraction for Reduced ML
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the semantics of the bad-variable constructor in Algol-like languages
- Functions with local state: regularity and undecidability
- A new approach to abstract syntax with variable binding
- Finite-memory automata
- Two-variable logic on data words
- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience
- Full Abstraction for Reduced ML
- Regular-Language Semantics for a Call-by-Value Programming Language
- The impact of higher-order state and control effects on local relational reasoning
- State-dependent representation independence
- Finite state machines for strings over infinite alphabets
- Fresh-register automata
- Automata, Languages and Programming