The complexity of interaction

DOI10.1145/2837614.2837646zbMath1347.68052arXiv1511.01838OpenAlexW2258276823MaRDI QIDQ2828261

Stéphane Gimenez, Georg Moser

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.01838

zbMATH Keywords

linear logicprogram analysistime boundsinteraction netsparallel reductionssequential reductionsspace bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Types for complexity of parallel computation in pi-calculus