| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10328914 | Electronic Notes in Theoretical Computer Science | 2005 | 18 Pages |
Abstract
We present a case study where Synchronising Graphs, a system of parallel graph transformation, are used to solve the syntactic unification problem for first order rational terms (with possibly infinite unifier). The solution we offer is efficient, that is quasi-linear, and simple: a program of 28 characters.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Pietro Cenciarelli, Alessandro Tiberi,