Abstract
We introduce and study a version of Krivine’s machine which provides a precise information about how much of its argument is needed for performing a computation. This information is expressed as a term of a resource lambda-calculus introduced by the authors in a recent article; this calculus can be seen as a fragment of the differential lambda-calculus. We use this machine to show that Taylor expansion of lambda-terms (an operation mapping lambda-terms to generally infinite linear combinations of resource lambda-terms) commutes with Böhm tree computation.
This is a preview of subscription content, log in via an institution to check access.
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
Ehrhard, T., Regnier, L.: The differential lambda-calculus. Theoretical Computer Science 309(1–3), 1–41 (2003)
Ehrhard, T., Regnier, L.: Uniformity and the Taylor expansion of ordinary lambda-terms. Technical report, Institut de mathématiques de Luminy (2005) Theoretical Computer Science (submitted)
Boudol, G.: The lambda calculus with multiplicities. Technical Report 2025, INRIA Sophia-Antipolis (1993)
Boudol, G., Curien, P.-L., Lavatelli, C.: A semantics for lambda calculi with resource. Mathematical Structures in Computer Science 9(4), 437–482 (1999)
Kfoury, A.J.: A linearization of the lambda-calculus. Journal of Logic and Computation 10(3), 411–436 (2000)
Ehrhard, T., Regnier, L.: Differential interaction nets. In: Proceedings of WoLLIC 2004. Electronic Notes in Theoretical Computer Science, vol. 103, pp. 35–74. Elsevier Science, Amsterdam (2004)
Krivine, J.-L.: A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation (to appear, 2005)
De Bruijn, N.: Generalizing Automath by means of a lambda-typed lambda calculus. In: Kueker, D.W., Lopez-Escobar, E.G.K., Smith, C.H. (eds.) Mathematical Logic and Theoretical Computer Science. Lecture Notes in Pure and Applied Mathematics, pp. 71–92. Marcel Dekker (1987); Reprinted in: Selected papers on Automath, Studies in Logic, vol. 133, pp. 313–337. North-Holland (1994)
Danos, V., Regnier, L.: Reversible, irreversible and optimal lambda-machines. Theoretical Computer Science 227(1–2), 273–291 (1999)
Vaux, L.: The differential lambda-mu calculus. Technical report, Institut de Mathématiques de Luminy (submitted for publication, 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehrhard, T., Regnier, L. (2006). 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) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_20
Download citation
DOI: https://doi.org/10.1007/11780342_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)