交互网中的条件嵌套模式匹配
Conditional Nested Pattern Matching in Interaction Net
AI总结：
本文提出交互网中支持嵌套模式匹配的扩展方法，通过转换到非嵌套匹配保持一步汇合、并行性和显式垃圾回收等核心性质，并设计了新的记法表达该匹配。
摘要：
交互网是一种受限的图重写系统，可作为图形化或文本化编程语言使用。因此，其优点包括一步汇合、易于并行化以及显式垃圾回收。然而，其中一些限制给程序员带来了负担，因此交互网已在多个方面得到扩展，特别是加入了数据类型和条件规则。本文引入了一种进一步的扩展，以允许嵌套模式匹配，并且以保留交互网的这些优点和基本性质的方式实现。我们还表明，通过引入到非嵌套匹配的转换，该扩展在重写上是保守的。此外，我们提出了一种新的记法来表达这种模式匹配。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
