Focusing in Asynchronous Games
@inproceedings{Mimram2010FocusingIA,
title={Focusing in Asynchronous Games},
author={Samuel Mimram},
booktitle={CiE},
year={2010}
}Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on which proofs induce strategies. We are specifically interested here in relating two such semantics of linear logic, of very different flavor, which both take in account concurrent features of the proofs: asynchronous games and concurrent games. Interestingly, we show that associating a concurrent strategy to…
3 Citations
A multi-focused proof system isomorphic to expansion proofs
- Mathematics, Computer ScienceJ. Log. Comput.
- 2016
An evolutionary approach to recover canonicity within the sequent calculus is proposed, which is illustrated for classical first-order logic and shows that, among the multi-focused proofs, the maximally multi- focused proofs that collect together all possible parallel foci are canonical.
The Isomorphism Between Expansion Proofs and Multi-Focused Sequent Proofs
- Mathematics, Computer Science
- 2012
An evolutionary approach to recover canonicity within the sequent calculus is proposed, which is illustrated for classical first-order logic and shows that, among the multi-focused proofs, the maximally multi- focused proofs that collect together all possible parallel foci are canonical.
A Systematic Approach to Canonicity in the Classical Sequent Calculus
- Mathematics, Computer ScienceCSL
- 2012
An evolutionary approach to recover canonicity within the sequent calculus is proposed, which is illustrated for classical first-order logic and shows that, among the multi-focused proofs, the maximally multi- focused proofs that make the foci as parallel as possible are canonical.
References
SHOWING 1-10 OF 31 REFERENCES
Games and full completeness for multiplicative linear logic
- Computer ScienceJournal of Symbolic Logic
- 1994
It is shown that this semantics yields a categorical model of Linear Logic and proves full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net.
Concurrent games and full completeness
- Computer ScienceProceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
- 1999
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an…
Asynchronous games 4: a fully complete model of propositional linear logic
- Computer Science20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
- 2005
It is shown that the resulting model is fully complete: every winning uniform innocent strategy of the asynchronous game [A] is the denotation of a proof /spl pi/ of the formula A.
Asynchronous Games: Innocence Without Alternation
- Computer ScienceCONCUR
- 2007
This work takes advantage of the diagrammatic reformulation of alternating innocence in asynchronous games, in order to provide a tentative definition of innocence in non-alternating games.
Applying Game Semantics to Compositional Software Modeling and Verification
- Computer ScienceTACAS
- 2004
A software model checking tool founded on game semantics, based on an interpretation algorithm defined compositionally on syntax and thus can also handle open programs, which turns out to lead to very compact models of programs.
A Game Semantics of the Asynchronous π-Calculus
- Computer Science
- 2005
A simple game semantics of the typed asynchronous π-calculus is described, placing it within a rich hierarchy of games models for programming languages, and it is shown that the denotations of processes are equivalent, via this correspondence, to their sets of traces.
Sequentiality vs. concurrency in games and logic
- Computer Science, PhilosophyMathematical Structures in Computer Science
- 2003
Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.