An implementation of interaction nets as a forth-like language.
- Untyped.
- Using a stack-based meta language to build nets.
- Programming with interaction nets directly (no compilation via combinators).
define-node <name> <input-ports> -- <output-ports> end
define-rule <name> <name> <function-body> end
define <name> <function-body> enddefine-node nzero -- value! end
define-node nadd1 prev -- value! end
define-node nadd target! addend -- result end
The rule between (nadd1) and (nadd) as ASCII art:
value value value
| | |
(nadd) => => (nadd1)
/ \ \ |
(nadd1) addend addend (nadd)
| | / \
prev prev prev addend
Define the rule between (nadd1) and (nadd):
define-rule nadd1 nadd
( addend result ) ( prev )
prev addend nadd
nadd1 result connect
end
To apply this rule is to disconnect and delete (nadd1) and (nadd) and reconnect newly exposed wires:
( addend result )save the wires that were connected to(nadd)to local variableaddendandresult.( prev )save the wire that was connected to(nadd1)to local variableprev.prevpush local variables to the stack.addendpush local variables to the stack.naddtake two arguments from the stack and create a new(nadd)node.nadd1take one argument from the stack and create a new(nadd1)node.resultpush local variable to the stack.connecttake two wires from the stack and connect them.
The rule between (nzero) and (nadd) as ASCII art:
value value value
| | |
(nadd) => => |
/ \ \ \
(nzero) addend addend addend
Define the rule between (nzero) and (nadd):
define-rule nzero nadd
( addend result )
addend result connect
end
To apply this rule is to disconnect and delete (nzero) and (nadd) and reconnect newly exposed wires:
( addend result )save the wires that were connected to(nadd)to local variableaddendandresult.addendpush local variables to the stack.resultpush local variables to the stack.connecttake two wires from the stack and connect them.
Example interaction:
| | | |
(nadd) (nadd1) (nadd1) (nadd1)
/ \ | | |
(nadd1) (nadd1) (nadd) (nadd1) (nadd1)
| | => / \ => | => |
(nadd1) (nadd1) (nadd1) (nadd1) (nadd) (nadd1)
| | | | / \ |
(nzero) (nzero) (nzero) (nadd1) (nzero) (nadd1) (nadd1)
| | |
(nzero) (nadd1) (nzero)
|
(nzero)
The whole program with test:
define-node nzero -- value! end
define-node nadd1 prev -- value! end
define-node nadd target! addend -- result end
define-rule nzero nadd
( addend result )
addend result connect
end
define-rule nadd1 nadd
( addend result ) ( prev )
prev addend nadd
nadd1 result connect
end
define two
nzero nadd1 nadd1
end
wire-print-net
run
wire-print-net
output
<net>
<root>
(nadd₇)-result-<>-
</root>
<body>
(nadd1₃)-value!-<>-!target-(nadd₇)
(nadd1₆)-value!-<>-addend-(nadd₇)
(nadd1₅)-value!-<>-prev-(nadd1₆)
(nzero₄)-value!-<>-prev-(nadd1₅)
(nadd1₂)-value!-<>-prev-(nadd1₃)
(nzero₁)-value!-<>-prev-(nadd1₂)
</body>
</net>
<net>
<root>
(nadd1₉)-value!-<>-
</root>
<body>
(nadd1₁₁)-value!-<>-prev-(nadd1₉)
(nadd1₆)-value!-<>-prev-(nadd1₁₁)
(nadd1₅)-value!-<>-prev-(nadd1₆)
(nzero₄)-value!-<>-prev-(nadd1₅)
</body>
</net>define-node nil -- value! end
define-node cons tail head -- value! end
define-node append target! rest -- result end
define-rule nil append
( rest result )
rest result connect
end
define-rule cons append
( rest result ) ( tail head )
tail rest append
head cons result connect
end
define-node sole -- value! end
nil sole cons sole cons sole cons
nil sole cons sole cons sole cons
append
wire-print-net
run
wire-print-net
output
<net>
<root>
(append₁₅)-result-<>-
</root>
<body>
(cons₇)-value!-<>-!target-(append₁₅)
(cons₁₄)-value!-<>-rest-(append₁₅)
(cons₁₂)-value!-<>-tail-(cons₁₄)
(sole₁₃)-value!-<>-head-(cons₁₄)
(cons₁₀)-value!-<>-tail-(cons₁₂)
(sole₁₁)-value!-<>-head-(cons₁₂)
(nil₈)-value!-<>-tail-(cons₁₀)
(sole₉)-value!-<>-head-(cons₁₀)
(cons₅)-value!-<>-tail-(cons₇)
(sole₆)-value!-<>-head-(cons₇)
(cons₃)-value!-<>-tail-(cons₅)
(sole₄)-value!-<>-head-(cons₅)
(nil₁)-value!-<>-tail-(cons₃)
(sole₂)-value!-<>-head-(cons₃)
</body>
</net>
<net>
<root>
(cons₁₇)-value!-<>-
</root>
<body>
(cons₁₉)-value!-<>-tail-(cons₁₇)
(sole₆)-value!-<>-head-(cons₁₇)
(cons₂₁)-value!-<>-tail-(cons₁₉)
(sole₄)-value!-<>-head-(cons₁₉)
(cons₁₄)-value!-<>-tail-(cons₂₁)
(sole₂)-value!-<>-head-(cons₂₁)
(cons₁₂)-value!-<>-tail-(cons₁₄)
(sole₁₃)-value!-<>-head-(cons₁₄)
(cons₁₀)-value!-<>-tail-(cons₁₂)
(sole₁₁)-value!-<>-head-(cons₁₂)
(nil₈)-value!-<>-tail-(cons₁₀)
(sole₉)-value!-<>-head-(cons₁₀)
</body>
</net>For more examples, please see the examples/ directory.
Dependencies:
libx11:- debian:
sudo apt install libx11-dev - ubuntu:
sudo apt install libx11-dev
- debian:
Compile:
git clone https://github.com/cicada-lang/inet-forth
cd inet-forth
make -j
make test
The compiled binary ./bin/inet-forth is the command-line program.
$ ./bin/inet-forth
inet-forth 0.1.0
commands:
run -- run files
self-test -- run self test
version -- print version
help -- print help messageFor examples:
./bin/inet-forth run examples/nat.fthmake all # compile src/ files to lib/ and bin/
make run # compile and run the command-line program
make test # compile and run test
make clean # clean up compiled filesPapers:
Inspirations:
Books:
To make a contribution, fork this project and create a pull request.
Please read the STYLE-GUIDE.md before you change the code.
Remember to add yourself to AUTHORS. Your line belongs to you, you can write a little introduction to yourself but not too long.