Interaction nets constitute a visual programming language grounded in graph transformation. Owing to their distinctive properties, they inherently facilitate parallelism in the rewriting step. This paper showcases a simple and concise approach to encoding interaction nets within the programming language OCaml, emphasising correctness guarantees. To achieve this objective, we encode not only the interaction net primitives, but also Lafont's original type system.

翻译：交互网是一种基于图变换的可视化编程语言。由于其独特性质，该系统在重写步骤中天然支持并行化。本文展示了一种在OCaml编程语言中实现交互网编码的简洁方法，并着重论证其正确性保证。为实现这一目标，我们不仅编码了交互网的基本元素，还实现了拉丰原始类型系统。