基于GPU的交互网络实现

Haskell中交互网的一种简单并行实现

A Simple Parallel Implementation of Interaction Nets in Haskell

由于其“固有的并行性”，交互网自引入以来一直被认为是函数式编程的一种有吸引力的实现机制。我们表明，在Haskell中的一个简单的高并发实现可以在多个核心上实现有希望的加速。

一种交互网的实现模型

An Implementation Model for Interaction Nets

为了研究交互网络系统的实现和优化，我们提出了一种演算，使我们能够推理网络，一种与演算密切对应的具体数据结构，以及一种低级语言来创建和操作这种数据结构。这些工作在一起，使我们能够描述交互网络的编译过程，推理实现的行为，并研究效率和属性。

交互网中嵌套模式匹配的实现

An Implementation of Nested Pattern Matching in Interaction Nets

交互网络中的约简规则被限制为每次只匹配一个参数。因此，程序员必须引入辅助规则来执行更复杂的匹配。在本文中，我们描述了一个系统的设计和实现的互动网，它允许嵌套的模式匹配的互动规则。我们实现了一个系统，提供了方便的方式来表达交互网络程序，而无需定义辅助规则。

A token-passing net implementation of optimal reduction with embedded read-back

In this paper, we introduce a new interaction net implementation of optimal reduction for pure untyped lambda calculus. Unlike others, our implementation allows to reach normal form regardless of interaction net reduction strategy using the approach of so-called token-passing nets. Another new feature is the read-back mechanism also implemented without leaving the formalism of interaction nets.

Δ-网：基于交互的最优并行λ-归约系统

$Δ$-Nets: Interaction-Based System for Optimal Parallel $λ$-Reduction

提出Δ-网通用并行计算模型及λ项与Δ-网转换方法，构成最优并行λ-归约算法，解决长期谜题，揭示λ演算与Δ-网关系，突破限制，为高效并行编程语言和计算机架构发展提供可能。

Compiling Process Networks to Interaction Nets

Kahn process networks are a model of computation based on a collection of sequential, deterministic processes that communicate by sending messages through unbounded channels. They are well suited for modelling stream-based computations, but are in no way restricted to this application. Interaction nets are graph rewriting systems that have many interesting properties for implementation. In this paper we show how to encode process networks using interaction nets, where we model both networks and messages in the same framework.