Sciweavers

11740 search results - page 61 / 2348
» More Problems in Rewriting
Sort
View
ALP
1992
Springer
14 years 2 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
CORR
2008
Springer
140views Education» more  CORR 2008»
13 years 10 months ago
A Cloning Pushout Approach to Term-Graph Transformation
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...
Dominique Duval, Rachid Echahed, Fréd&eacut...
ICEIS
2005
IEEE
14 years 3 months ago
Change Detection and Maintenance of an XML Web Warehouse
The World Wide Web contains a huge and increasing volume of information. The web warehouse is an efficient and effective means to facilitate utilization of information on the Web,...
Ching-Ming Chao
ICFP
2008
ACM
14 years 10 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
LICS
2009
IEEE
14 years 4 months ago
The Inverse Taylor Expansion Problem in Linear Logic
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Michele Pagani, Christine Tasson