Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
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
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
IEEE Transactions on Computers
in2: A Graphical Interpreter for Interaction Nets
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Cellular Automata Universality Revisited
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Encoding left reduction in the λ-calculus with interaction nets
Mathematical Structures in Computer Science
Multiport interaction nets and concurrency
CONCUR 2005 - Concurrency Theory
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Hi-index | 0.00 |
We give a self-contained presentation of Hard Interaction, a rewriting system on fixed graphs. We discuss the universality of natural subclasses of hard systems and highlight the main ideas that lead to a universal system with 7 rules called Hard Combinators.