Differential interaction nets

Abstract : 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.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2006, 364 (2), pp.166-195. 〈10.1016/j.tcs.2006.08.003〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00150274
Contributeur : Thomas Ehrhard <>
Soumis le : mardi 29 mai 2007 - 23:41:49
Dernière modification le : jeudi 15 novembre 2018 - 20:27:00

Lien texte intégral

Identifiants

Collections

PPS | IML | I2M | UNIV-AMU | USPC

Citation

Thomas Ehrhard, Laurent Regnier. Differential interaction nets. Theoretical Computer Science, Elsevier, 2006, 364 (2), pp.166-195. 〈10.1016/j.tcs.2006.08.003〉. 〈hal-00150274〉

Partager

Métriques

Consultations de la notice

88