XXIIVV — interaction nets

By Devine Lu Linvega

Liurau20I12 Interaction nets are a graph rewriting system. Interaction nets(INs) encode computations in a graph of nodes that is rewritten until it stabilizes, they can capture all computable functions with no external machinery or a garbage collector. A computational step can be defined as a constant time operation, and the model allows for parallelism in which many steps can take place at the same time. Interaction Nets, Yves Lafont's original paper. A Programming Language for Interaction Nets, Ian Mackie A Low-level language for interaction nets, Shinya Sato A zine about interaction…

saved by

• Rishi Kothari

related reading

• uxntalwiki.xxiivv.com
• Circuit Tracing: Revealing Computational Graphs in Language Modelstransformer-circuits.pub
• Semantic Domain: The Geometry of Interaction, as an OCaml programsemantic-domain.blogspot.com
• Thinking like Transformersrush.github.io
• L-system - Wikipediaen.wikipedia.org
• Bireactive Programmingorionreed.github.io
• An Interactive Intro to CRDTs | jakelazaroff.comjakelazaroff.com
• Seven Implementations of Incremental :: Jane Streetjanestreet.com
• Looped Transformers as Programmable Computersarxiv.org
• A Gentle Introduction to Yao's Garbled Circuitsweb.mit.edu
• Overview ‹ λ-2D: An Exploration of Drawing as Programming Language, Featuring Ideas from Lambda Calculus - MIT Media Labmedia.mit.edu
• mb.dvicsee.umbc.edu