Interaction nets are a form of restricted graph rewrite system that can serve as a graphical or textual programming language. As such, benefits include one-step confluence, ease of parallelism and explicit garbage collection. However, some of these restrictions burden the programmer, so they have been extended in several ways, notably to include data types and conditional rules. This paper introduces a further extension to allow nested pattern matching and to do so in a way that preserves these benefits and fundamental properties of interaction nets. We also show that by introducing a translation to non-nested matching, this extension is conservative in rewriting. In addition, we propose a new notation to express this pattern matching.

翻译：交互网是一种受限的图重写系统，可作为图形或文本编程语言。其优势包括单步汇流性、易于并行化以及显式垃圾回收。然而，某些限制给编程者带来了负担，因此已通过多种方式对其进行了扩展，特别是引入了数据类型和条件规则。本文提出一种进一步扩展，允许嵌套模式匹配，并以保持交互网这些优势与基本性质的方式实现。我们通过引入到非嵌套匹配的转换，证明该扩展在重写意义上是保守的。此外，我们提出了一种表达此类模式匹配的新记法。