Parallel Reduction in Resource Lambda-Calculus - Laboratoire Preuves, Programmes et Systèmes
Communication Dans Un Congrès Année : 2009

Parallel Reduction in Resource Lambda-Calculus

Résumé

We study the resource calculus -- the non-lazy version of Boudol's lambda-calculus with resources. In such a calculus arguments may be finitely available and mixed, giving rise to nondeterminism, modelled by a formal sum. We define parallel reduction in resource calculus and we apply, in such a nondeterministic setting, the technique by Tait and Martin-Löf to achieve confluence. Then, slightly generalizing a technique by Takahashi, we obtain a standardization result.
Fichier principal
Vignette du fichier
paralresource.pdf (225.68 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
licence

Dates et versions

hal-00699013 , version 1 (11-08-2024)

Licence

Identifiants

Citer

Michele Pagani, Paolo Tranquilli. Parallel Reduction in Resource Lambda-Calculus. 7th Asian Symposium on Programming Languages and Systems (APLAS 2009), Dec 2009, Seoul, South Korea. pp.226-242, ⟨10.1007/978-3-642-10672-9_17⟩. ⟨hal-00699013⟩
73 Consultations
2 Téléchargements

Altmetric

Partager

More