Algorithmic nominal game semantics

DOI10.1007/978-3-642-19718-5_22MaRDI QIDQ3000592zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Algorithmic games for full ground references
• Algorithmic games for full ground references
• Algorithmic probabilistic game semantics. Playing games with automata
• scientific article; zbMATH DE number 2110612
• Static Analysis

Cites work

• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• scientific article; zbMATH DE number 1231616 (Why is no real title available?)
• A new approach to abstract syntax with variable binding
• Automata, Languages and Programming
• Block structure vs. scope extrusion: between innocence and omniscience
• Finite state machines for strings over infinite alphabets
• Finite-memory automata
• Fresh-register automata
• Full Abstraction for Reduced ML
• Functions with local state: regularity and undecidability
• On the semantics of the bad-variable constructor in Algol-like languages
• Operational reasoning for functions with local state
• Regular-language semantics for a call-by-value programming language
• State-dependent representation independence
• The impact of higher-order state and control effects on local relational reasoning
• Two-variable logic on data words

Cited in

(17)

• On-the-fly bisimilarity checking for fresh-register automata
• Algorithmic probabilistic game semantics. Playing games with automata
• Polynomial-time equivalence testing for deterministic fresh-register automata
• Algorithmic games for full ground references
• Static Analysis
• From bounded checking to verification of equivalence via symbolic up-to techniques
• An algebraic account of references in game semantics
• Full abstraction for Reduced ML
• A fragment of ML decidable by visibly pushdown automata
• Reachability in pushdown register automata
• Algorithmic games for full ground references
• scientific article; zbMATH DE number 7340142 (Why is no real title available?)
• Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts
• ML and extended branching VASS
• Program verification using symbolic game semantics
• Program equivalence in a simple language with state
• 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)