An impure solution to the problem of matching fans
Anton Salikhmetov
TL;DR
This paper introduces an algorithm for matching fans in interaction net implementations of lambda calculus reduction, utilizing a specific reduction strategy and side effects, without additional agent types.
Contribution
It presents a novel algorithm that addresses fan matching in interaction nets without extra agents, leveraging side effects and a specialized reduction strategy.
Findings
Effective fan matching achieved without extra agents
Utilizes side effects in interaction rules
Improves interaction net reduction techniques
Abstract
We propose an algorithm to solve the problem of matching fans in interaction net implementations of optimal reduction for the pure untyped lambda calculus without use of any additional agent types. The algorithm relies upon a specific interaction nets reduction strategy and involves side effects in one of interaction rules.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Advanced Database Systems and Queries · Logic, programming, and type systems