Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-22T23:04:29.260Z Has data issue: false hasContentIssue false
  • English
  • Français

Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach

Published online by Cambridge University Press:  10 November 2016

MARCO SOLIERI Open the ORCID record for MARCO SOLIERI [Opens in a new window]
MARCO SOLIERI*
Affiliation:
LIPN, UMR 7030 CNRS, Université Paris 13, Sorbonne Paris Cité, Villetaneuse, France. Email: [email protected] IRIF, UMR 8243, CNRS, Université Paris 7, Sorbonne Paris Cité, Paris, France DISI, Università di Bologna, INRIA, Bologna, Italy
Get access Rights & Permissions [Opens in a new window]

Abstract

The resource λ-calculus is a variation of the λ-calculus where arguments are superpositions of terms and must be linearly used; hence, it is a model for linear and non-deterministic programming languages. Moreover, it is the target language of the Taylor–Ehrhard–Regnier expansion of λ-terms, a linearisation of the λ-calculus which develops ordinary terms into infinite series of resource terms. In a strictly typed restriction of the resource λ-calculus, we study the notion of path persistence, and define a remarkably simple geometry of resource interaction (GoRI) that characterises it. In addition, GoRI is invariant under reduction and counts addends in normal forms. We also analyse expansion on paths in ordinary terms, showing that reduction commutes with expansion and, consequently, that persistence can be transferred back and forth between a path and its expansion. Lastly, we also provide an expanded counterpart of the execution formula, which computes paths as series of objects of GoRI; thus, exchanging determinism and conciseness for linearity and simplicity.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 28 , Special Issue 5: Linearity 2014 , May 2018 , pp. 667 - 709
Copyright
Copyright © Cambridge University Press 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Alves, S. and Florido, M. (2005). Weak linearization of the lambda calculus. Theoretical Computer Science 342 (1) 79–103.Google Scholar
Asperti, A., Danos, V., Laneve, C. and Regnier, L. (1994). Paths in the lambda-calculus: Three years of communications without understanding. In: Proceeding of the 9th Annual Symposium on Logic in Computer Science, IEEE 426–436. doi: 10.1109/LICS.1994.316048CrossRefGoogle Scholar
Asperti, A. and Laneve, C. (1995). Paths, computations and labels in the lambda-calculus. Theoretical Computer Science 142 (2) 277–297.Google Scholar
Aubert, C., Bagnol, M. and Seiller, T. (2016). Unary resolution: Characterizing Ptime. In: Jacobs, B. and Löding, C. (eds.) Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science, volume 9634, Springer, Berlin & Heidelberg, 373–389.Google Scholar
Aubert, C. and Seiller, T. (2016a). Characterizing co-NL by a group action. Mathematical Structures in Computer Science 26 (4) 606–638.Google Scholar
Aubert, C. and Seiller, T. (2016b). Logarithmic space and permutations. Information and Computation. 248 2–21.Google Scholar
Boudol, G. (1993). The lambda-calculus with multiplicities. Research Report RR-2025, INRIA.Google Scholar
Dal Lago, U. (2009). Context semantics, linear logic, and computational complexity. ACM Transactions on Computational Logic (TOCL) 10 (4) 25:1–25:32.Google Scholar
Dal Lago, U., Faggian, C., Hasuo, I. and Yoshimizu, A. (2014). The geometry of synchronization. In: Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, New York, NY, USA: ACM 35:1–35:10.Google Scholar
Dal Lago, U., Faggian, C., Valiron, B. and Yoshimizu, A. (2015). Parallelism and synchronization in an infinitary context. In: Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 559–572.Google Scholar
Danos, V. and Ehrhard, T. (2011). Probabilistic coherence spaces as a model of higher-order probabilistic computation. Information and Computation 209 (6) 966–991.Google Scholar
Danos, V., Pedicini, M. and Regnier, L. (1997). Directed virtual reductions. In: van Dalen, D. and Bezem, M. (eds.) Computer Science Logic. Lecture Notes in Computer Science, volume 1258, Springer, Berlin & Heidelberg, 76–88.Google Scholar
Danos, V. and Regnier, L. (1995). Proof-nets and the Hilbert space. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic, Cambridge University Press, 307–328.CrossRefGoogle Scholar
de Falco, M. (2008). The geometry of interaction of differential interaction nets. In: Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science, LICS'08, IEEE 465–475.Google Scholar
Ehrhard, T. and Regnier, L. (2003). The differential lambda-calculus. Theoretical Computer Science 309 (1) 1–41.Google Scholar
Ehrhard, T. and Regnier, L. (2006a). Böhm trees, Krivine's machine and the Taylor expansion of lambda-terms. In: Beckmann, A., Berger, U., Löwe, B. and Tucker, J. (eds.) Logical Approaches to Computational Barriers. Lecture Notes in Computer Science, volume 3988, Springer, Berlin & Heidelberg, 186–197.Google Scholar
Ehrhard, T. and Regnier, L. (2006b). Differential interaction nets. Theoretical Computer Science 364 (2) 166–195.Google Scholar
Ehrhard, T. and Regnier, L. (2008). Uniformity and the Taylor expansion of ordinary lambda-terms. Theoretical Computer Science 403 (2) 347–372.CrossRefGoogle Scholar
Girard, J.-Y. (1987). Linear logic. Theoretical Computer Science 50 (1) 1–101.Google Scholar
Girard, J.-Y. (1989). Geometry of interaction I: Interpretation of system F. Studies in Logic and the Foundations of Mathematics 127 221–260.CrossRefGoogle Scholar
Gonthier, G., Abadi, M. and Lévy, J.-J. (1992). The geometry of optimal lambda reduction. In: Proceedings of the 19th ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages, POPL '92, ACM 15–26.Google Scholar
Kathail, V. (1990). Optimal Interpreters for Lambda-Calculus Based Functional Languages, Ph.D. thesis, Massachusetts Institute of Technology.Google Scholar
Krivine, J.-L. (2007). A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation 20 (3) 199–207.Google Scholar
Lamping, J. (1989). An algorithm for optimal lambda calculus reduction. In: Proceedings of the 17th ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages, ACM 16–30.Google Scholar
Laurent, O. (2001). A token machine for full geometry of interaction (Extended Abstract). In: Abramsky, S. (ed.) Typed Lambda Calculi and Applications '01. Lecture Notes in Computer Science, volume 2044, Springer, Berlin & Heidelberg, 283–297.Google Scholar
Lévy, J.-J. (1978). Réductions Correctes et Optimales dans le Lambda Calcul, Ph.D. thesis, Université Paris VII.Google Scholar
Mackie, I. (1995). The geometry of interaction machine. In: POPL 95 Proceedings of the 22nd ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages, ACM 198–208.Google Scholar
Maraist, J., Odersky, M., Turner, D.N. and Wadler, P. (1995). Call-by-name, call-by-value, call-by-need, and the linear lambda calculus. Electronic Notes in Theoretical Computer Science 1 370–392.Google Scholar
Mazza, D. (2015a). Infinitary affine proofs. Mathematical Structures in Computer Science. Epub ahead of print. DOI: http://dx.doi.org/10.1017/S0960129515000298Google Scholar
Mazza, D. (2015b). Simple parsimonious types and logarithmic space. In: Kreutzer, S. (ed.) Proceedings of the 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), Leibniz International Proceedings in Informatics (LIPIcs), volume 41, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik 24–40.Google Scholar
Mazza, D. and Pagani, M. (2007). The separation theorem for differential interaction nets. In: Dershowitz, N. and Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science, volume 4790, Springer, Berlin & Heidelberg, 393–407.Google Scholar
Mazza, D. and Terui, K. (2015). Parsimonious types and non-uniform computation. In: Halldórsson, M. M., Iwama, K., Kobayashi, N. and Speckmann, B. (eds.) Automata, Languages, and Programming, Proceedings of ICALP. Lecture Notes in Computer Science, volume 9135, Springer, Berlin & Heidelberg, 350–361.Google Scholar
Pagani, M., Selinger, P. and Valiron, B. (2014). Applying quantitative semantics to higher-order quantum computing. In: Sewell, P. (ed.) The 41th Annual ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages, POPL14, San Diego, USA. ACM 647–658.Google Scholar
Pagani, M. and Tranquilli, P. (2009). Parallel reduction in resource lambda-calculus. In: Hu, Z. (ed.) Programming Languages and Systems, 7th Asian Symposium (APLAS 2009). Lecture Notes in Computer Science, volume 5904, Springer, Berlin & Heidelberg, 226–242.Google Scholar
Pedicini, M., Pellitta, G. and Piazza, M. (Unpublished). Sequential and parallel abstract machines for optimal reduction. In: Preproceedings of the 15th Symposium on Trends in Functional Programming (TFP2014).Google Scholar
Pedicini, M. and Quaglia, F. (2007). PELCR: Parallel environment for optimal lambda-calculus reduction. ACM Transactions on Computational Logic 8 (3).Google Scholar
Perrinel, M. (2014). On context semantics and interaction nets. In: Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, New York, NY, USA: ACM 73:1–73:10.Google Scholar
Pinto, J.S. (2001). Parallel implementation models for the lambda-calculus using the geometry of interaction. In: Abramsky, S. (ed.) Typed Lambda Calculi and Applications. Lecture Notes in Computer Science, volume 2044, Springer, Berlin & Heidelberg, 385–399.Google Scholar
Solieri, M. (2015). Geometry of resource interaction – a minimalist approach. In: Alves, S. and Cervesato, I. (eds.) Proceedings LINEARITY 2014. Electronic Proceedings in Theoretical Computer Science, volume 176, Open Publishing Association 79–94.Google Scholar
Tranquilli, P. (2011). Intuitionistic differential nets and lambda-calculus. Theoretical Computer Science 412 (20) 1979–1997.Google Scholar