Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
Lambda-calculus, types and models
Lambda-calculus, types and models
Strong normalization from weak normalization in typed &lgr;-calculi
Information and Computation
Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
Theoretical Computer Science - Special issue on linear logic, 1
Additives of linear logic and normalization: part I: A (restricted) Church--Rosser property
Theoretical Computer Science - Linear logic
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Proof nets and explicit substitutions
Mathematical Structures in Computer Science
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
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
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
The Cut-Elimination Theorem for Differential Nets with Promotion
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A semantic measure of the execution time in linear logic
Theoretical Computer Science
Theoretical Computer Science
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
Realizability proof for normalization of full differential linear logic
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 5.23 |
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard's original proof uses a standardization theorem which is not proven. We introduce sliced pure structures (sps), a very general version of Girard's proof-nets, and we apply to sps Gandy's method to infer SN from weak normalization (WN). We prove a standardization theorem for sps: if WN without erasing steps holds for an sps, then it enjoys SN. A key step in our proof of standardization is a confluence theorem for sps obtained by using only a very weak form of correctness, namely acyclicity slice by slice. We conclude by showing how standardization for sps allows to prove SN of LL, using as usual Girard's reducibility candidates.