An approach to innocent strategies as graphs
From MaRDI portal
Publication:418201
DOI10.1016/j.ic.2011.12.006zbMath1279.68092OpenAlexW2027731833MaRDI QIDQ418201
Claudia Faggian, Pierre-Louis Curien
Publication date: 24 May 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.12.006
Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items
A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus, Proof nets sequentialisation in multiplicative linear logic, Interpreting a finitary pi-calculus in differential interaction nets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Proof nets sequentialisation in multiplicative linear logic
- Typed event structures and the linear \(\pi \)-calculus
- Petri nets, event structures and domains. I
- Focussing and proof construction
- On full abstraction for PCF: I, II and III
- Asynchronous games. II: The true concurrency of innocence
- Locus Solum: From the rules of logic to the logic of rules
- Ludics with repetitions (Exponentials, Interactive types and Completeness)
- On the meaning of logical completeness
- Intuitionistic Dual-intuitionistic Nets
- The Blind Spot
- Asynchronous Games: Innocence Without Alternation
- Ludics is a Model for the Finitary Linear Pi-Calculus
- Jump from Parallel to Sequential Proofs: Multiplicatives
- Partial Orders, Event Structures and Linear Strategies
- Abstract Böhm trees
- Games and full completeness for multiplicative linear logic
- Proof nets for unit-free multiplicative-additive linear logic
- CONCUR 2004 - Concurrency Theory
- Computer Science Logic
