Theoretical Computer Science
Proof-nets and the Hilbert space
Proceedings of the workshop on Advances in linear logic
Information and Computation
Reversible, irreversible and optimal &lgr;-machines
Theoretical Computer Science - Special issue on linear logic, 1
Polarized proof-nets and λµ-calculus
Theoretical Computer Science
Polarized Proof-Nets: Proof-Nets for LC
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Strong Normalization of Proof Nets Modulo Structural Congruences
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Coherence for Sharing Proof Nets
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Encoding linear logic with interaction combinators
Information and Computation
Dominator Trees and Fast Verification of Proof Nets
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
About Translations of Classical Logic into Polarized Linear Logic
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Linear logic and elementary time
Information and Computation - Special issue: ICC '99
Proof nets and explicit substitutions
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Syntax vs. semantics: a polarized approach
Theoretical Computer Science - Game theory meets theoretical computer science
Resource operators for λ-calculus
Information and Computation
Thick Subtrees, Games and Experiments
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Strong normalization property for second order linear logic
Theoretical Computer Science
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
Jumping boxes: representing lambda-calculus boxes by jumps
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Focalisation and classical realisability
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Confluence of pure differential nets with promotion
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Polarity and the Logic of Delimited Continuations
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Call-by-Value solvability, revisited
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Linear Logic, Comonads And Optimal Reductions
Fundamenta Informaticae
Compact proof certificates for linear logic
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Hi-index | 0.00 |
The sequential nature of sequent calculus provides a simple definition of cut-elimination rules that duplicate or erase sub-proofs. The parallel nature of proof nets, instead, requires the introduction of explicit boxes, which are global and synchronous constraints on the structure of graphs. We show that logical polarity can be exploited to obtain an implicit, compact, and natural representation of boxes: in an expressive polarized dialect of linear logic, boxes may be represented by simply recording some of the polarity changes occurring in the box at level 0. The content of the box can then be recovered locally and unambiguously. Moreover, implicit boxes are more parallel than explicit boxes, as they realize a larger quotient. We provide a correctness criterion and study the novel and subtle cut-elimination dynamics induced by implicit boxes, proving confluence and strong normalization.