Parallel Reduction in Resource Lambda-Calculus

Michele Pagani (1, 2)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 PPS - Preuves, Programmes et Systèmes

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.

Domaines: Logique en informatique [cs.LO]

Michele Pagani. Parallel Reduction in Resource Lambda-Calculus. Programming Languages and Systems APLAS, Dec 2009, Seoul, South Korea. pp.226-242, ⟨10.1007/978-3-642-10672-9_17⟩. ⟨hal-00699013⟩