Skip to main navigation Skip to search Skip to main content

The machinery of interaction

  • University of Bologna

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming, PPDP 2020 - Part of BOPL 2020 - Bologna Federated Conference on Programming Languages 2020
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450388214
DOIs
Publication statusPublished - 8 Sept 2020
Event22nd International Symposium on Principles and Practice of Declarative Programming, PPDP 2020 - Part of 2020 Bologna Federated Conference on Programming Languages, BOPL 2020 - Bologna, Online, Italy
Duration: 8 Sept 202010 Sept 2020

Publication series

NameACM International Conference Proceeding Series

Conference

Conference22nd International Symposium on Principles and Practice of Declarative Programming, PPDP 2020 - Part of 2020 Bologna Federated Conference on Programming Languages, BOPL 2020
Country/TerritoryItaly
CityBologna, Online
Period8/09/2010/09/20

Keywords

  • abstract machines
  • geometry of interaction
  • lambda-calculus

Fingerprint

Dive into the research topics of 'The machinery of interaction'. Together they form a unique fingerprint.

Cite this