Combinators for Interaction Nets

@inproceedings{Gay1994CombinatorsFI,
  title={Combinators for Interaction Nets},
  author={Simon J. Gay},
  booktitle={Theory and Formal Methods},
  year={1994}
}
The completeness property of SK combinators is well known. We consider an analogous property in the context of Lafont's Interaction Nets, a graph rewriting system based on classical linear logic. The result is a set of combinators which is complete in the sense of being able to encode all possible patterns of interaction.