Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Focusing Strategies in the Sequent Calculus of Synthetic Connectives
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The logical basis of evaluation order and pattern-matching
The logical basis of evaluation order and pattern-matching
Ludics is a model for the finitary linear pi-calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Focalisation and classical realisability
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Theoretical Computer Science
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
Andreoli originally discovered focalization as a concrete proof search strategy in proof theory of linear logic, putting to the foreground the role of polarity in logic. The aim of the present paper is to give a more abstract account on focalization in the framework of ludics. We describe focalization as a map (embodied by an untyped proof/design) from an unsynthesized to a synthesized type/behaviour. The map turns out to be a retraction of another map, that is related to invertibility of negative connectives. In this way we formalize the common intuition that focalization of positive connectives is dual to invertibility of negative ones.