2015/11/03 by Abubakar Hassan, Hassan, Abubakar, Ian Mackie +3
Computer Science · #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
paper · doi:10.14279/tuj.eceasst.10.156
openalex publication_date 2024/04/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/01
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.