Bigraphical Nets
Maribel Fern\'andez, Ian Mackie, Matthew Walker
TL;DR
Bigraphical nets (binets) extend interaction nets by incorporating bigraph and port graph ideas, enabling more expressive and potentially more parallel computation models, with formal semantics and illustrative applications.
Contribution
The paper introduces bigraphical nets (binets) as a novel generalization of interaction nets, combining bigraph and port graph concepts with formal semantics.
Findings
Binets provide greater expressive power than traditional interaction nets.
Formal operational semantics for binets are established.
Examples demonstrate the applicability of binets in various computational scenarios.
Abstract
Interaction nets are a graphical model of computation, which has been used to define efficient evaluators for functional calculi, and specifically lambda calculi with patterns. However, the flat structure of interaction nets forces pattern matching and functional behaviour to be encoded at the same level, losing some potential parallelism. In this paper, we introduce bigraphical nets, or binets for short, as a generalisation of interaction nets using ideas from bigraphs and port graphs, and we present a formal notation and operational semantics for binets. We illustrate their expressive power by examples of applications.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.