| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10328915 | Electronic Notes in Theoretical Computer Science | 2005 | 21 Pages |
Abstract
The calculus over terms is naturally generalized by using unification constraints in addition to the standard Ï-calculus matching constraints. This therefore provides us with the basics for a natural extension of an explicit substitution calculus to term graphs. Several examples illustrating the introduced concepts are given.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
C. Bertolissi, P. Baldan, H. Cirstea, C. Kirchner,