Computer Science – Logic in Computer Science
Scientific paper
2010-03-24
EPTCS 21, 2010, pp. 13-25
Computer Science
Logic in Computer Science
Scientific paper
10.4204/EPTCS.21.2
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.
Hassan Abubakar
Jiresch Eugen
Sato Shinya
No associations
LandOfFree
An Implementation of Nested Pattern Matching in Interaction Nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Implementation of Nested Pattern Matching in Interaction Nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Implementation of Nested Pattern Matching in Interaction Nets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-56723