How Bend Works

How Bend uses interaction nets to achieve fast parallel computing.

Bend uses interaction nets when compiling your code. Interaction nets are a graphical model of computation devised by French mathematician Yves Lafont in 1990 as a generalisation of the proof structures of linear logic.

Video explanation

An interaction net system is specified by a set of agent types and a set of interaction rules.

One of the simplest interaction systems that can simulate any other interaction system is that of interaction combinators.

Its signature is: Σ={ϵ,δ,γ} with ar(ϵ)=0 and ar(δ)=ar(γ)=2.

With an example of a non-terminating interaction net that reduces to itself. Its infinite reduction sequence starting from the corresponding configuration in the interaction calculus is as follows:

Graphically, the erasing and duplication rules can be represented as follows:

You can read more about Interaction Combinators here.