Abstract
In this paper, we analyze the complexity of functional programs written in the interaction-net computation model, an asynchronous, parallel and confluent model that generalizes linear-logic proof nets. Employing user-defined sized and scheduled types, we certify concrete time, space and space-time complexity bounds for both sequential and parallel reductions of interaction-net programs by suitably assigning complexity potentials to typed nodes. The relevance of this approach is illustrated on archetypal programming examples. The provided analysis is precise, compositional and is, in theory, not restricted to particular complexity classes.
- A. Asperti, C. Giovanetti, and A. Naletto. The bologna optimal higherorder machine. JFP, 6(6):763–810, 1996.Google Scholar
Cross Ref
- R. Atkey. Amortised resource analysis with separation logic. Logical Methods in Computer Science, 7(2), 2011.Google Scholar
- M. Avanzini, U. Dal Lago, and G. Moser. Analysing the complexity of functional programs: Higher-order meets first-order, 2015. Google Scholar
Digital Library
- P. Baillot and U. Dal Lago. Higher-order interpretations and program complexity. In Proc. 21th CSL, volume 16 of LIPIcs, pages 62–76, 2012.Google Scholar
- P.v. Emde Boas. Machine models and simulation. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), pages 1–66. MIT Press, 1990. Google Scholar
Digital Library
- M. Brockschmidt, F. Emmes, S. Falke, C. Fuhs, and J. Giesl. Alternating runtime and size complexity analysis of integer programs. In Proc. 20th TACAS, volume 8413 of LNCS, pages 140–155, 2014.Google Scholar
- M. Fernández, I. Mackie, S. Sato, and M. Walker. Recursive functions with pattern matching in interaction nets. ENTCS, 253(4):55–71, 2009. Google Scholar
Digital Library
- D. Ghica and A. Smith. Bounded linear types in a resource semiring. In Proc. 23rd ESOP, volume 8410 of LNCS, pages 331–350, 2014.Google Scholar
- S. Gimenez. Programmer, calculer et raisonner avec les réseaux de la logique linéaire. PhD thesis, 2009.Google Scholar
- S. Gimenez and G. Moser. The complexity of interaction (long version). http://arxiv.org/abs/1511.01838.Google Scholar
- S. Gimenez and G. Moser. The structure of interaction. In Proc. 22nd CSL, volume 23 of LIPIcs, pages 316–331, 2013.Google Scholar
- J-Y. Girard, A. Scedrov, and P. Scott. Bounded linear logic: A modular approach to polynomial-time computability. TCS, 97(1):1–66, 1992. Google Scholar
Digital Library
- G. Gonthier, M. Abadi, and J.-J. Lévy. The geometry of optimal lambda reduction. In Proc. 19th POPL, pages 15–26. ACM Press, 1992. Google Scholar
Digital Library
- G. Gonthier, M. Abadi, and J.-J. Lévy. Linear logic without boxes. In Proc. 7th LICS, pages 223–234. IEEE, 1992.Google Scholar
- A. Hassan and S. Sato. Interaction nets with nested pattern matching. ENTCS, 203(1):79–92, 2008. Google Scholar
Digital Library
- J. Hoffmann, K. Aehlig, and M. Hofmann. Multivariate amortized resource analysis. TOPLAS, 34(3):14, 2012. Google Scholar
Digital Library
- J. Hoffmann and Z. Shao. Automatic static cost analysis for parallel programs. In Proc. 24th ESOP, volume 9032 of LNCS, pages 132–157, 2015. Google Scholar
Digital Library
- Y. Lafont. Interaction nets. In Proc. 17th POPL, pages 95–108. ACM, 1990. Google Scholar
Digital Library
- Y. Lafont. Interaction combinators. IC, 137(1):69–101, 1997. Google Scholar
Digital Library
- U. Dal Lago. Context semantics, linear logic, and computational complexity. TOCL, 10(4), 2009. Google Scholar
Digital Library
- U. Dal Lago and B. Petit. Linear dependent types in a call-by-value scenario. Sci. Comput. Program., 84:77–100, 2014. Google Scholar
Digital Library
- J. Lamping. An algorithm for optimal lambda calculus reduction. In Proc. 7th POPL, pages 16–30. ACM Press, 1990. Google Scholar
Digital Library
- S. Lippi. Universal hard interaction for clockless computation: Dem Glücklichen schlägt keine Stunde! FI, 91(2):357–394, 2009. Google Scholar
Digital Library
- The linear logic wiki: Fragments. http://llwiki.ens-lyon.fr/ mediawiki/index.php/Fragment.Google Scholar
- I. Mackie. Interaction nets for linear logic. TCS, 247(1-2):83–140, 2000. Google Scholar
Digital Library
- I. Mackie. Efficient lambda-evaluation with interaction nets. In Proc. 15th RTA, volume 3091 of LNCS, pages 155–169, 2004.Google Scholar
- D. Mazza. Interaction Nets: Semantics and Concurrent Extensions. PhD thesis, 2006.Google Scholar
- P.-A. Mellies. Functorial boxes in string diagrams. In Proc. 15th CSL, LNCS, pages 1–30, 2006. Google Scholar
Digital Library
- M. Perrinel. On context semantics and interaction nets. In Proc. Joint 23rd CSL and 29th LICS, page 73. ACM, 2014. Google Scholar
Digital Library
- J. S. Pinto. Parallel evaluation of interaction nets with mpine. In Proc. 12th RTA, volume 2051 of LNCS, pages 353–356, 2001. Google Scholar
Digital Library
- M. Sinn, F. Zuleger, and H. Veith. A simple and scalable static analysis for bound analysis and amortized complexity analysis. In Proc. 26th CAV, volume 8559 of LNCS, pages 745–761, 2014. Google Scholar
Digital Library
- P. Vasconcelos. Space Cost Analysis Using Sized Types. PhD thesis, School of Computer Science, University of St. Andrews, 2008.Google Scholar
- L. Vaux. λ-calcul différentiel et logique classique: interactions combinatoires. PhD thesis, 2007.Google Scholar
Index Terms
The complexity of interaction
Recommendations
The complexity of interaction
POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesIn this paper, we analyze the complexity of functional programs written in the interaction-net computation model, an asynchronous, parallel and confluent model that generalizes linear-logic proof nets. Employing user-defined sized and scheduled types, ...
Differential interaction nets
Logic, language, information and computationWe introduce interaction nets for a fragment of the differential lambda-calculus and exhibit in this framework a new symmetry between the of course and the why not modalities of linear logic, which is completely similar to the symmetry between the ...
Interpreting a finitary pi-calculus in differential interaction nets
We propose and study a translation of a pi-calculus without sums nor recursion into an untyped version of differential interaction nets. We define a transition system of labeled processes and a transition system of labeled differential interaction nets. ...






Comments