Year: 2010
Type: article
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.
DOI: 10.4204/eptcs.21.2
Authors: Abubakar Hassan, Eugen Jiresch, Shinya Sato
Institutions: University of Sussex, TU Wien, Himeji Dokkyo University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2085856752