Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-16 |
| Number of pages | 16 |
| Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
| Volume | 417 |
| DOIs | |
| State | Published - 26 Mar 2025 |
| Externally published | Yes |
| Event | 14th and 15th International Workshop on Graph Computation Models, GCM 2023 and 2024 - Enschede, Netherlands Duration: 9 Jul 2024 → … |