Abstract
We study the resource calculus, an extension of the λ-calculus allowing to model resource consumption. We achieve an internal separation result, in analogy with Böhm’s theorem of λ-calculus. We define an equivalence relation on the terms, which we prove to be the maximal non-trivial congruence on normalizable terms respecting β-reduction. It is significant that this equivalence extends the usual η-equivalence and is related to Ehrhard’s Taylor expansion – a translation mapping terms into series of finite resources.
This work is partly supported by NWO Project 612.000.936 CALMOC and the chaire CNRS “Logique linéaire et calcul”.
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
Böhm, C.: Alcune proprietà delle forme β-η-normali nel λ-K-calcolo. Pubbl. INAC 696 (1968)
Barendregt, H.: The lambda-calculus, its syntax and semantics, 2nd edn. Stud. Logic Found. Math., vol. 103. North-Holland, Amsterdam (1984)
Böhm, C., Dezani-Ciancaglini, M., Peretti, P., Ronchi Della Rocca, S.: A discrimination algorithm inside λβ-calculus. Theor. Comp. Sci. 8(3), 271–291 (1979)
Hyland, J.M.E.: A syntactic characterization of the equality in some models of the lambda calculus. J. London Math. Soc. 2(12), 361–370 (1976)
Girard, J.Y.: Linear logic. Th. Comp. Sc. 50, 1–102 (1987)
Carraro, A., Ehrhard, T., Salibra, A.: Exponentials with infinite multiplicities. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 170–184. Springer, Heidelberg (2010)
Pagani, M., Ronchi Della Rocca, S.: Linearity, non-determinism and solvability. Fundamenta Informaticae 103(1-4), 173–202 (2010)
Boudol, G.: The lambda-calculus with multiplicities. INRIA Report 2025 (1993)
Boudol, G., Laneve, C.: The discriminating power of multiplicities in the lambda-calculus. Inf. Comput. 126(1), 83–102 (1996)
Boudol, G., Curien, P.L., Lavatelli, C.: A semantics for lambda calculi with resources. MSCS 9(4), 437–482 (1999)
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)
Bucciarelli, A., Carraro, A., Ehrhard, T., Manzonetto, G.: Full abstraction for resource calculus with tests (submitted), http://www.dsi.unive.it/~gmanzone/papers/bcem11.pdf
Ehrhard, T., Regnier, L.: Uniformity and the Taylor expansion of ordinary lambda-terms. Theor. Comput. Sci. 403(2-3), 347–372 (2008)
Pagani, M., Tranquilli, P.: Parallel reduction in resource lambda-calculus. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 226–242. Springer, Heidelberg (2009)
Manzonetto, G.: What is a categorical model of the differential and the resource λ-calculi? (submitted), http://www.dsi.unive.it/~gmanzone/papers/man10.pdf
Terese.: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manzonetto, G., Pagani, M. (2011). Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion. In: Ong, L. (eds) Typed Lambda Calculi and Applications. TLCA 2011. Lecture Notes in Computer Science, vol 6690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21691-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-21691-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21690-9
Online ISBN: 978-3-642-21691-6
eBook Packages: Computer ScienceComputer Science (R0)