Types for Complexity of Parallel Computation in Pi-calculus (Long Version) - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Programming Languages and Systems (TOPLAS) Year : 2022

Types for Complexity of Parallel Computation in Pi-calculus (Long Version)

Abstract

Type systems as a technique to analyse or control programs have been extensively studied for functional programming languages. In particular some systems allow to extract from a typing derivation a complexity bound on the program. We explore how to extend such results to parallel complexity in the setting of the pi-calculus, considered as a communication-based model for parallel computation. We study two notions of time complexity: the total computation time without parallelism (the work) and the computation time under maximal parallelism (the span). We define operational semantics to capture those two notions, and present two type systems from which one can extract a complexity bound on a process. The type systems are inspired both by size types and by input/output types, with additional temporal information about communications.
Fichier principal
Vignette du fichier
rapport.pdf (551.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02961427 , version 1 (08-10-2020)
hal-02961427 , version 2 (12-10-2020)
hal-02961427 , version 3 (01-02-2021)

Identifiers

  • HAL Id : hal-02961427 , version 3

Cite

Patrick Baillot, Alexis Ghyselen. Types for Complexity of Parallel Computation in Pi-calculus (Long Version). ACM Transactions on Programming Languages and Systems (TOPLAS), 2022, 44 (3), pp.1-50. ⟨hal-02961427v3⟩
104 View
121 Download

Share

Gmail Facebook Twitter LinkedIn More