Abstract
We study the resource calculus - the non-lazy version of Boudol's λ-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. © 2009 Springer-Verlag.
Cite
CITATION STYLE
Pagani, M., & Tranquilli, P. (2009). Parallel reduction in resource lambda-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5904 LNCS, pp. 226–242). https://doi.org/10.1007/978-3-642-10672-9_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
