CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113MaRDI QIDQ5311491zbMATH OpenOpenAlexFDO

Authors Paul-André Melliès

Publication date 23 August 2005

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

Full work available at URL https://doi.org/10.1007/b100113

zbMATH Keywords

\(\lambda\)-calculusgame semanticsMazurkiewicz traces

Mathematics Subject Classification ID

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

Recommendations

• Asynchronous games. II: The true concurrency of innocence
• Asynchronous Games: Innocence Without Alternation
• A truly concurrent game model of the asynchronous -calculus
• CONCUR 2005 – Concurrency Theory
• Asynchronous games 3 an innocent model of linear logic

Cited in

(14)

• Asynchronous game of life
• Angelic semantics of fine-grained concurrency
• Asynchronous games. II: The true concurrency of innocence
• Sequential algorithms and strongly stable functions
• Handshake games
• A graph abstract machine describing event structure composition
• Probabilistic -calculus and event structures
• A truly concurrent game model of the asynchronous -calculus
• Game semantics in the nominal model
• Asynchronous Games: Innocence Without Alternation
• An approach to innocent strategies as graphs
• Fibred pseudo double categories for game semantics
• Resource modalities in tensor logic
• Disentangling parallelism and interference in game semantics

This page was built for publication: CONCUR 2004 - Concurrency Theory

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