Bigraphical Nets
Logic in Computer Science
2013-02-27 v1 Programming Languages
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.
Cite
@article{arxiv.1302.6339,
title = {Bigraphical Nets},
author = {Maribel Fernández and Ian Mackie and Matthew Walker},
journal= {arXiv preprint arXiv:1302.6339},
year = {2013}
}
Comments
In Proceedings TERMGRAPH 2013, arXiv:1302.5997