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.

BibTeX

@inproceedings{SGGM-POPL2016,
  author    = "St{\'e}phane Gimenez and Georg Moser",
  title     = "The Complexity of Interaction",
  booktitle = "Proceedings of the 43rd Annual {ACM} {SIGPLAN-SIGACT} Symposium on
               Principles of Programming Languages ({POPL} 2016)",
  pages     = "243--255",
  year      = 2016,
  doi       = "10.1145/2837614.2837646"
}