The Abstract Machinery of Interaction (Long Version)

by   Beniamino Accattoli, et al.

This paper revisits the Interaction Abstract Machine (IAM), a machine based on Girard's Geometry of Interaction, introduced by Mackie and Danos Regnier. It is an unusual machine, not relying on environments, presented on linear logic proof nets, and whose soundness proof is convoluted and passes through various other formalisms. Here we provide a new direct proof of its correctness, based on a variant of Sands's improvements, a natural notion of bisimulation. Moreover, our proof is carried out on a new presentation of the IAM, defined as a machine acting directly on λ-terms, rather than on linear logic proof nets.


page 1

page 2

page 3

page 4


Complexity of correctness for pomset logic proof nets

We show that it is coNP-complete to decide whether a given proof structu...

Cobordisms and commutative categorial grammars

We propose a concrete surface representation of abstract categorial gram...

Proof nets through the lens of graph theory: a compilation of remarks

This document is intended to eventually gather a few small remarks on th...

Sequentialization for full N-Graphs via sub-N-Graphs

Since proof-nets for MLL- were introduced by Girard (1987), several stud...

Exponentially Handsome Proof Nets and Their Normalization

Handsome proof nets were introduced by Retoré as a syntax for multiplica...

Neural Proof Nets

Linear logic and the linear λ-calculus have a long standing tradition in...

Interpreting a concurrent λ-calculus in differential proof nets (extended version)

In this paper, we show how to interpret a language featuring concurrency...