scientific article; zbMATH DE number 7533349

DOI10.4230/LIPICS.CSL.2018.24MaRDI QIDQ5079748FDOQ5079748

James Laird, William John Gowers

Publication date: 28 May 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

semanticsnondeterminismgames and logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strategies as Profunctors
• Unbounded Non-determinism in CSP
• Title not available (Why is that?)
• Games and full completeness for multiplicative linear logic
• Infinite trace equivalence
• Title not available (Why is that?)
• Nondeterminism in Game Semantics via Sheaves
• Sequential algorithms for unbounded nondeterminism
• Definability and full abstraction
• Thin Games with Symmetry and Concurrent Hyland-Ong Games
• Block structure vs scope extrusion: between innocence and omniscience

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Mathematical Game Semantics of Concurrency and Nondeterminism

This page was built for publication:

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