Algorithmic nominal game semantics
From MaRDI portal
Publication:3000592
DOI10.1007/978-3-642-19718-5_22zbMATH Open1326.68071OpenAlexW1491260278MaRDI QIDQ3000592FDOQ3000592
Authors: 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
Recommendations
Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- The impact of higher-order state and control effects on local relational reasoning
- State-dependent representation independence
- A new approach to abstract syntax with variable binding
- On the semantics of the bad-variable constructor in Algol-like languages
- Two-variable logic on data words
- Finite-memory automata
- Title not available (Why is that?)
- Operational reasoning for functions with local state
- Block structure vs. scope extrusion: between innocence and omniscience
- Full Abstraction for Reduced ML
- Functions with local state: regularity and undecidability
- Finite state machines for strings over infinite alphabets
- Fresh-register automata
- Regular-language semantics for a call-by-value programming language
- Automata, Languages and Programming
Cited In (17)
- Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts
- ML and extended branching VASS
- Static Analysis
- Algorithmic games for full ground references
- Reachability in pushdown register automata
- Polynomial-time equivalence testing for deterministic fresh-register automata
- Algorithmic games for full ground references
- Program equivalence in a simple language with state
- An algebraic account of references in game semantics
- On-the-fly bisimilarity checking for fresh-register automata
- Title not available (Why is that?)
- Program verification using symbolic game semantics
- Full Abstraction for Reduced ML
- Algorithmic probabilistic game semantics. Playing games with automata
- A fragment of ML decidable by visibly pushdown automata
- From bounded checking to verification of equivalence via symbolic up-to techniques
- Full abstraction for Reduced ML
This page was built for publication: Algorithmic nominal game semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000592)
