Abubakar Hassan (University of Sussex) |
Eugen Jiresch (Vienna University of Technology) |
Shinya Sato (Himeji Dokkyo University) |
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. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.21.2 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |