Differential interaction nets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2006

Differential interaction nets

Résumé

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.

Dates et versions

hal-00150274 , version 1 (29-05-2007)

Identifiants

Citer

Thomas Ehrhard, Laurent Regnier. Differential interaction nets. Theoretical Computer Science, 2006, 364 (2), pp.166-195. ⟨10.1016/j.tcs.2006.08.003⟩. ⟨hal-00150274⟩
103 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More