Asynchronous games 2: The true concurrency of innocence

• Published in: Theoretical computer science Vol. 358; no. 2; pp. 200 - 228
• Main Author: MELLIES, Paul-André
• Format: Journal Article Conference Proceeding
• Language: English
• Published: Amsterdam Elsevier B.V 07.08.2006; Elsevier
• Subjects: [formula omitted]-calculus; Algorithmics. Computability. Computer arithmetics; Applied sciences; Computer Science; Computer science; control theory; systems; Exact sciences and technology; Game semantics; General logic; Language theory and syntactical analysis; Logic and foundations; Logic in Computer Science; Mathematical logic, foundations, set theory; Mathematics; Mazurkiewicz traces; Sciences and techniques of general use; Theoretical computing; λ -calculus; Game semantics; Mazurkiewicz traces; Asynchronous; Computer theory; Confluence; Concurrency; A-calculus; Lambda calculus; Mazurkiewicz trace; innocence; linear logic; concurrency theory; lambda-calculus; game semantics; asynchronous transition systems

In game semantics, the higher-order value passing mechanisms of the λ -calculus are decomposed as sequences of atomic actions exchanged by a Player and its Opponent. Seen from this angle, game semantics is reminiscent of trace semantics in concurrency theory, where a process is identified to the seq...