Theoretical Computer Science
An equivalence between lambda-terms
Theoretical Computer Science
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
Polarized proof-nets and λµ-calculus
Theoretical Computer Science
Strong Normalization of Proof Nets Modulo Structural Congruences
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
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
The differential Lambda-calculus
Theoretical Computer Science
On Köthe sequence spaces and linear logic
Mathematical Structures in Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Theoretical Computer Science - Logic, language, information and computation
Theoretical Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Strong normalization property for second order linear logic
Theoretical Computer Science
On linear combinations of λ-terms
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Strong normalization property for second order linear logic
Theoretical Computer Science
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Linearity, Non-determinism and Solvability
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Realizability proof for normalization of full differential linear logic
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Böhm's theorem for resource lambda calculus through Taylor expansion
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Solvability in resource lambda-calculus
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Constructing differential categories and deconstructing categories of games
Information and Computation
| Hi-index | 5.23 |
We define pure intuitionistic differential proof nets, extending Ehrhard and Regnier's differential interaction nets with the exponential box of Linear Logic. Normalization of the exponential reduction and confluence of the full one is proved. These results are directed and adjusted to give a translation of Boudol's untyped @l-calculus with resources extended with a linear-nonlinear reduction a la Ehrhard and Regnier's differential @l-calculus. Such reduction comes in two flavours: baby-step and giant-step @b-reduction. The translation, based on Girard's encoding A-B~!A@?B and as such extending the usual one for @l-calculus into proof nets, enjoys bisimulation for giant-step @b-reduction. From this result we also derive confluence of both reductions.