It's interesting how some of these diagrams are almost equivalent in the context of encoding computation in interaction nets using symmetric interaction combina

It's interesting how some of these diagrams are almost equivalent in the context of encoding computation in interaction nets using symmetric interaction combinators [1]. From the perspective of the lambda calculus for example, the duplication of the addition node in "When Adding met Copying" [2] mirrors exactly the iterative duplication of lambda terms - ie. something like (λx.x x) M! [1]: https://ezb.io/thoughts/interaction_nets/lambda_calculus/2025-04-25_normalization.html https://ezb.io/thoughts/interaction_nets/lambda_calculus/202... [2]: https://graphicallinearalgebra.net/2015/05/12/when-adding-met-copying/ https://graphicallinearalgebra.net/2015/05/12/when-adding-me...