# Proof Nets and Explicit Substitutions

##### Citations

14 citations

### Cites background from "Proof Nets and Explicit Substitutio..."

...It is not known whether the weakening used by λws carries over to using names [19]....

[...]

13 citations

13 citations

13 citations

10 citations

### Cites methods from "Proof Nets and Explicit Substitutio..."

...Proofs using the first technique are for example those for λws [6] and λlxr [14], based on the wellfoundedness of the reduction relation for multiplicative exponential linear logic...

[...]

##### References

[...]

2,304 citations

### "Proof Nets and Explicit Substitutio..." refers background or methods in this paper

...In this paper 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]....

[...]

...While we refer the interested reader to [13] for more details on linear logic in general, we give here a one-sided presentation of the sequent calculus for MELL:...

[...]

1,480 citations

577 citations

### "Proof Nets and Explicit Substitutio..." refers background in this paper

...The pioneer calculus with explicit substitutions, λσ, was introduced in [1] as a bridge between the classical λ-calculus and concrete implementations of functional programming languages....

[...]

321 citations

### "Proof Nets and Explicit Substitutio..." refers methods in this paper

...1 Using various translations of the λ-calculus into proof nets, new abstract machines have been proposed, exploiting the Geometry of Interaction and the Dynamic Algebras [14, 2, 5], leading to the works on optimal reduction [15, 17]....

[...]