Transition systems over games

DOI10.1145/2603088.2603150zbMATH Open1401.68231OpenAlexW2168545476MaRDI QIDQ4635649FDOQ4635649

Sam Staton, Paul Blain Levy

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.675.5088

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (7)

• Complete trace models of state and control
• Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
• Title not available (Why is that?)
• (Towards a) statistical probabilistic lazy lambda calculus
• Disentangling parallelism and interference in game semantics
• A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus
• Transition systems

This page was built for publication: Transition systems over games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635649)