scientific article; zbMATH DE number 7204431
From MaRDI portal
Publication:5111308
DOI10.4230/LIPIcs.FSCD.2017.12zbMath1441.68144MaRDI QIDQ5111308
Glynn Winskel, Pierre Clairambault, Simon Castellan
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LCF considered as a programming language
- Fully abstract semantics for observably sequential languages
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Deterministic concurrent strategies
- Angelic semantics of fine-grained concurrency
- Full abstraction for fair testing in CCS (expanded version)
- Asynchronous Games: Innocence Without Alternation
- Causality vs. interleavings in concurrent game semantics
- The Parallel Intensionally Fully Abstract Games Model of PCF
- Strategies as Profunctors
- Games and Strategies as Event Structures
This page was built for publication: