2009/10/17 by Ian Mackie, Mackie, Ian, Jorge Sousa Pinto +4
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL) #cs.PL
paper · pdf · doi:10.48550/arxiv.0910.3321
ISBN: 978-972-9348-18-1
arxiv created 2009/10/17 · openalex publication_date 2009/10/17 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.