An approach to innocent strategies as graphs

DOI10.1016/J.IC.2011.12.006MaRDI QIDQ418201zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)