Proof Nets and Explicit Substitutions

Authors:
Roberto Di Cosmo;Delia Kesner;Emmanuel Polonovski
Affiliations:
-;-;-
Venue:
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Year:
2000

Citing 7
Cited 2

Linear logic

Theoretical Computer Science
An algorithm for optimal lambda calculus reduction

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof-nets and the Hilbert space

Proceedings of the workshop on Advances in linear logic
Typed lambda-calculi with explicit substitutions may not terminate

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Explicit Cyclic Substitutions

CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

Extending the explicit substitution paradigm

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The theory of calculi with explicit substitutions revisited

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We refine the simulation technique introduced in [10] to show strong normalization of λ-calculi with explicit substitutions via termination of cut elimination in proof nets [13]. We first propose a notion of equivalence relation for proof nets that extends the one in [9], and we show that cut elimination modulo this equivalence relation is terminating. We then show strong normalization of the typed version of the λl-calculus with de Bruijn indices (a calculus with full composition defined in [8]) using a translation from typed λl to proof nets. Finally, we propose a version of typed λl with named variables which helps to better understand the complex mechanism of the explicit weakening notation introduced in the λl-calculus with de Bruijn indices [8].