Hard combinators

Authors:
Denis Béchet;Sylvain Lippi
Affiliations:
LINA, Université de Nantes, Nantes, France;I3S, Université de Nice, Sophia Antipolis, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 7
Cited 0

Interaction nets

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

Information and Computation
YALE: yet another lambda evaluator based on interaction nets

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
in2: A Graphical Interpreter for Interaction Nets

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Termination Detection of Distributed Algorithms by Graph Relabelling Systems

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Encoding left reduction in the λ-calculus with interaction nets

Mathematical Structures in Computer Science
Multiport interaction nets and concurrency

CONCUR 2005 - Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hard Interaction systems can be presented as graph relabeling with a handshake mechanism that provide local synchronization. We present a particular one with only four symbols and seven rules that can be used to simulate all the other hard interaction systems.