¶Abstract

This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. In the same way that the lambda-calculus is the foundation for functional programming, or horn clauses are the foundation for logic programming, we give in this paper an overview of a substantial software system that is currently under development to support interaction based computation, and in particular the compilation of interaction nets.

» Theory » Interaction nets

¶BiBTeX

@article{
  Hassan_Mackie_Sato_2008,
  title={Interaction nets: programming language design and implementation},
  volume={10},
  url={https://eceasst.org/index.php/eceasst/article/view/2523},
  DOI={10.14279/tuj.eceasst.10.156},
  journal={Electronic Communications of the EASST},
  author={Hassan, Abubakar and Mackie, Ian and Sato, Shinya},
  year={2008},
  month={Jul.}
}