Sequential and Concurrent Abstract Machines for Interaction Nets

Authors:
Jorge Sousa Pinto
Affiliations:
-
Venue:
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Year:
2000

Citing 10
Cited 3

Linear logic

Theoretical Computer Science
An algorithm for optimal lambda calculus reduction

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The chemical abstract machine

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An abstract frame work for environment machines

Theoretical Computer Science
The geometry of optimal lambda reduction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From proof-nets to interaction nets

Proceedings of the workshop on Advances in linear logic
YALE: yet another lambda evaluator based on interaction nets

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
A Calculus for Interaction Nets

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Wait-free Computing

WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms

Parallel Evaluation of Interaction Nets with MPINE

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
An Explicit Framework for Interaction Nets

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Call-by-name and call-by-value as token-passing interaction nets

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a formal study of how to implement interaction nets, filling an important gap in the work on this graphical rewriting formalism, very promising for the implementation of languages based on the λ-calculus. We propose the first abstract machine for interaction net reduction, based on a decomposition of interaction rules into more atomic steps, which tackles all the implementation details hidden in the graphical presentation. As a natural extension of this, we then give a concurrent shared-memory abstract machine, and show how to implement it, resulting in the first parallel implementation of interaction nets.