23201 search results - page 42 / 4641 » Rewriting Systems with Data |
RTA
1991
Springer
14 years 1 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
DGO
2003
13 years 11 months ago
2003
To query XML data over the Web, query engines need to be able to resolve semantic differences between heterogeneous attributes that are conceptually similar. This demo presents a ...
BIRTHDAY
2005
Springer
14 years 3 months ago
2005
Springer
We explore the connection between term rewriting systems (TRS) and aspect-oriented programming (AOP). Term rewriting is a paradigm that is used in fields such as program transform...
IANDC
2008
13 years 10 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
TAGT
1994
Springer
14 years 2 months ago
1994
Springer
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...