An approach to innocent strategies as graphs

DOI10.1016/J.IC.2011.12.006zbMATH Open1279.68092OpenAlexW2027731833MaRDI QIDQ418201FDOQ418201

Authors: Pierre-Louis Curien, Claudia Faggian 

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

Recommendations

• Computer Science Logic
• Asynchronous Games: Innocence Without Alternation
• scientific article; zbMATH DE number 1841820
• scientific article; zbMATH DE number 1231521
• scientific article; zbMATH DE number 1948179

zbMATH Keywords

concurrent interactiongraph strategiesinnocent strategiesL-forestsL-netsludics

Mathematics Subject Classification ID

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)

Cites Work

• Petri nets, event structures and domains. I
• On full abstraction for PCF: I, II and III
• Asynchronous Games: Innocence Without Alternation
• Linear logic
• Typed event structures and the linear \(\pi \)-calculus
• Title not available (Why is that?)
• Locus solum: From the rules of logic to the logic of rules.
• The blind spot. Lectures on logic
• Partial Orders, Event Structures and Linear Strategies
• Title not available (Why is that?)
• Asynchronous games. II: The true concurrency of innocence
• Focussing and proof construction
• Games and full completeness for multiplicative linear logic
• Ludics with repetitions (Exponentials, Interactive types and Completeness)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the meaning of logical rules. II: Multiplicatives and additives
• Title not available (Why is that?)
• Concrete data structures as games
• On the meaning of logical completeness
• Intuitionistic dual-intuitionistic nets
• Ludics is a Model for the Finitary Linear Pi-Calculus
• Jump from Parallel to Sequential Proofs: Multiplicatives
• Abstract Böhm trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof nets for unit-free multiplicative-additive linear logic
• CONCUR 2004 - Concurrency Theory
• Computer Science Logic
• Proof nets sequentialisation in multiplicative linear logic

Cited In (5)

• Interpreting a finitary pi-calculus in differential interaction nets
• Proof nets sequentialisation in multiplicative linear logic
• A truly concurrent game model of the asynchronous \(\pi\)-calculus
• Asynchronous Games: Innocence Without Alternation
• Computer Science Logic

This page was built for publication: An approach to innocent strategies as graphs

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