Iterators, Recursors and Interaction Nets

TL;DR

This paper introduces a method to encode iterators and recursion operators using interaction nets, enabling visual representation of functional programs and extending lambda-calculus translations to recursive types.

Contribution

It presents a novel encoding technique for iterators and recursion operators in interaction nets, enhancing visualization and language translation capabilities.

Findings

Provides a visual notation for functional programs.

Extends lambda-calculus translations to recursive types.

Enables better understanding of recursion in interaction nets.

Abstract

We propose a method for encoding iterators (and recursion operators in general) using interaction nets (INs). There are two main applications for this: the method can be used to obtain a visual nota- tion for functional programs; and it can be used to extend the existing translations of the lambda-calculus into INs to languages with recursive types.