Abstract

We introduce interaction automata as a topological model of computation and
present the conceptual plane interpreter ia2d. Interaction automata form a
refinement of both interaction nets and cellular automata models that combine
data deployment, memory management and structured computation mechanisms.
Their local structure is inspired from pointer machines and allows an
asynchronous spatial distribution of the computation. Our tool can be
considered as a proof-of-concept piece of abstract hardware on which
functional programs can be run in parallel.

BibTeX

@inproceedings{SGDO-FSCD2016,
  author    = "St{\'e}phane Gimenez and David Obwaller",
  title     = "Interaction Automata and the {ia2d} Interpreter",
  booktitle = "Proceedings of the 1st International Conference on Formal
               Structures for Computation and Deduction (FSCD 2016)",
  series    = "Leibniz International Proceedings in Informatics (LIPIcs)",
  volume    = 52,
  pages     = "35:1--35:11",
  year      = 2016
}