Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
On the Meaning of Logical Completeness
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Ludics is a model for the finitary linear pi-calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
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 |
In this paper, we use Girard's ludics to analyze focalization, a fundamental property of the proof theory of linear logic. In particular, we show how focalization can be realized interactively thanks to suitable section-retraction pairs between semantical types.