MIG

MIG or Mission: Impossible graphs in a language that runs solely on a graph

Here's the definition:

In MIG each line consists of a stack of values x_1,x_2,...,x_n. When the line is run put the first value at the bottom of the stack then go to the corresponding line. Because there should be some way to get output, each value can come with a string. When the value is put on the bottom of the stack, output the string. Going to zero exits the program. For input, using i in the place of a program uses the nth value after i (n is user-defined)

Programs

Hello world

0"Hello world"

Looping counter(Infinite program)

2"*",2"**",2"***",...
1"\n"

Truth machine(0->1,1->2)

i,0"0",2
2"1"

Cat program(limited)

i,1"1",1"2"

a sequence

1"1",2"2",3"3",4"4",...
1"1",2"2",3"3",4"4",...
.
.
.