Sciweavers

1458 search results - page 35 / 292
» Extended Term Rewriting Systems
Sort
View
JAR
2006
87views more  JAR 2006»
14 years 9 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...
ICLP
1997
Springer
15 years 1 months ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
TCS
1998
14 years 9 months ago
Bubbles in Modularity
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
Massimo Marchiori
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
14 years 7 months ago
Query Rewrites with Views for XML in DB2
There is much effort to develop comprehensive support for the storage and querying of XML data in database management systems. The major developers have extended their systems to h...
Parke Godfrey, Jarek Gryz, Andrzej Hoppe, Wenbin M...
FUIN
2006
66views more  FUIN 2006»
14 years 9 months ago
Observation of String-Rewriting Systems
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
Matteo Cavaliere, Peter Leupold