Interaction nets: programming language design and implementation
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.
Full Text:
PDFDOI: http://dx.doi.org/10.14279/tuj.eceasst.10.156
DOI (PDF): http://dx.doi.org/10.14279/tuj.eceasst.10.156.144
Hosted By Universitätsbibliothek TU Berlin.