g a Net, Yves Lafont" src="../media/diary/808.jpg"><figcaption>Covering a Net, Yves Lafont<span class="right">17F11</span></figcaption></figure>
<h2>Interaction nets are a graph rewriting system.</h2>

<p><b>Interaction nets</b> can capture all computable functions with <a href='rewriting.html'>rewriting rules</a>, no external machinery such as copying a chunk of memory, or a garbage collector, is needed. Unlike models such as Turing machines, Lambda calculus, cellular automata, or <a href='logic.html'>comb