Sciweavers

94 search results - page 13 / 19
» Confluence of Conditional Rewrite Systems
Sort
View
PLILP
1993
Springer
13 years 11 months ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...
CIKM
2008
Springer
13 years 9 months ago
Rewriting of visibly pushdown languages for xml data integration
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
Alex Thomo, Srinivasan Venkatesh
TAPSOFT
1993
Springer
13 years 11 months ago
Optimal Reductions in Interaction Systems
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
Andrea Asperti, Cosimo Laneve
WIDM
2003
ACM
14 years 24 days ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
ENTCS
2007
168views more  ENTCS 2007»
13 years 7 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...