|
(small graph rewrites systems) (research subjects)
|
|
|
|
|
|
| System IC2 v1 |
|
|
|
|
|
|
introduced at this chorasimilarity post
|
|
|
|
Inspired by Lafont Interaction Combinators rewrites, by seeing each 3-valent combinator as an unoriented stick-and-rings graphs. However the sticks-and-rings version has less information than IC graphs, which makes the rewrites too strong, i.e. there are too many paterns for rewrites.
|
|
|
|
| Rewrites |
|
|
|
|
Rewrite RW1
|
|
|
|
|
|
|
Rewrite RW2
|
|
|
|
|
|
|
Rewrite DIST
|
|
|
|
|
|
| Derived rewrites |
|
|
|
| A RM ("remove") rewrite is a particular application of RW1 |
|
|
|
|
|
|
| Another RM ("remove") rewrite is a particular application of RW2 |
|
|
|
|
|
|
| A SH (shuffle) rewrite |
|
|
|
|
|
|
| A SSH (shuffled shuffle) rewrite |
|
|
|
|
|
|
|
|
|
|
|
|
content licensed (CC BY 4.0)
unless otherwise specified |
|
|