|Differential interaction nets |
Auteur(s): Ehrhard Thomas, Regnier Laurent
(Article) Publié: Theoretical Computer Science, vol. 364 p.166-195 (2006)
Ref HAL: hal-00150274_v1
Exporter : BibTex | endNote
We introduce interaction nets for a fragment of the differential lambda-calculus and exhibit in this framework a new symmetry between the "of course" and the "why not" modalities of linear logic, which is completely similar to the symmetry between the "tensor" and "par" connectives of linear logic. We use algebraic intuitions for introducing these nets and their reduction rules, and then we develop two correctness criteria (weak typeability and acyclicity) and show that they guarantee strong normalization. Finally, we outline the correspondence between this interaction nets formalism and the resource lambda-calculus.
Commentaires: 30 pages