Strategies as profunctors

DOI10.1007/978-3-642-37075-5_27MaRDI QIDQ4910434zbMATH OpenOpenAlexFDO

Authors Glynn Winskel

Publication date 18 March 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37075-5_27

Mathematics Subject Classification ID

Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20) Semantics in the theory of computing (68Q55) Spaces of games (91A70)

Recommendations

• Bicategories of concurrent games (invited paper)
• Deterministic concurrent strategies
• Categorical combinatorics for non deterministic strategies on simple games
• Games and strategies as event structures
• Distributed Strategies Made Easy

Cited in

(20)

• Categorical combinatorics for non deterministic strategies on simple games
• There are more strategy-proof procedures than you think
• Deterministic concurrent strategies
• How to make ambiguous strategies
• Exploratory functions on nondeterministic strategies, up to lower bisimilarity
• Strategies as concurrent processes
• Winning, losing and drawing in concurrent games with perfect or imperfect information
• PADUA Protocol: Strategies and Tactics
• Loops under Strategies
• scientific article; zbMATH DE number 3959074 (Why is no real title available?)
• THE FIRM AS A NEXUS OF STRATEGIES
• A fully abstract game semantics for countable nondeterminism
• scientific article; zbMATH DE number 7204333 (Why is no real title available?)
• Distributed Strategies Made Easy
• scientific article; zbMATH DE number 7204431 (Why is no real title available?)
• Recognizing Strategies
• The mays and musts of concurrent strategies
• Disentangling parallelism and interference in game semantics
• A profunctorial Scott semantics
• Concurrent games over relational structures: the origin of game comonads

This page was built for publication: Strategies as profunctors

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