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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| licence |
