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.
Partially founded by the French ANR project blanc CHOCO, ANR-07-BLAN-0324.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boudol, G.: The lambda-calculus with multiplicities. INRIA Research Report 2025 (1993)
Milner, R.: Functions as processes. Mathematical Structures in Computer Science 2, 119–141 (1992)
Ehrhard, T., Regnier, L.: The differential lambda-calculus. Theor. Comput. Sci. 309(1), 1–41 (2003)
Tranquilli, P.: Intuitionistic differential nets and lambda calculus. Theor. Comput. Sci. (2008) (to appear)
Ehrhard, T., Regnier, L.: Differential interaction nets. Theor. Comput. Sci. 364(2), 166–195 (2006)
Girard, J.Y.: Linear logic. Th. Comp. Sc. 50, 1–102 (1987)
Takahashi, M.: Parallel reductions in lambda-calculus. Information and Computation 118(1), 120–127 (1995)
Ehrhard, T., Regnier, L.: Böhm trees, Krivine’s machine and the Taylor expansion of lambda-terms. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 186–197. Springer, Heidelberg (2006)
Ehrhard, T., Regnier, L.: Uniformity and the Taylor expansion of ordinary lambda-terms. Theor. Comput. Sci. 403(2-3), 347–372 (2008)
Tranquilli, P.: Nets between determinism and nondeterminism. Ph.D. thesis, Università Roma Tre/Université Paris Diderot (Paris 7) (April 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pagani, M., Tranquilli, P. (2009). Parallel Reduction in Resource Lambda-Calculus. In: Hu, Z. (eds) Programming Languages and Systems. APLAS 2009. Lecture Notes in Computer Science, vol 5904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10672-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-10672-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10671-2
Online ISBN: 978-3-642-10672-9
eBook Packages: Computer ScienceComputer Science (R0)