2017/04/15 by Ugo Dal Lago, Lago, Ugo Dal, Ryō Tanaka +3
Computer Science · #Computability, Logic, AI Algorithms #Distributed systems and fault tolerance #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.1704.04620
openalex publication_date 2017/04/15 · openalex created_date 2017/05/19 · openalex updated_date 2026/07/28
We introduce a geometry of interaction model for Mazza's multiport interaction combinators, a graph-theoretic formalism which is able to faithfully capture concurrent computation as embodied by process algebras like the π-calculus. The introduced model is based on token machines in which not one but multiple tokens are allowed to traverse the underlying net at the same time. We prove soundness and adequacy of the introduced model. The former is proved as a simulation result between the token machines one obtains along any reduction sequence. The latter is obtained by a fine analysis of convergence, both in nets and in token machines.