An Implementation of Nested Pattern Matching in Interaction Nets
Logic in Computer Science
2010-04-08 v1 Programming Languages
Software Engineering
Abstract
Reduction rules in interaction nets are constrained to pattern match exactly one argument at a time. Consequently, a programmer has to introduce auxiliary rules to perform more sophisticated matches. In this paper, we describe the design and implementation of a system for interaction nets which allows nested pattern matching on interaction rules. We achieve a system that provides convenient ways to express interaction net programs without defining auxiliary rules.
Cite
@article{arxiv.1003.4562,
title = {An Implementation of Nested Pattern Matching in Interaction Nets},
author = {Abubakar Hassan and Eugen Jiresch and Shinya Sato},
journal= {arXiv preprint arXiv:1003.4562},
year = {2010}
}