1385 search results - page 32 / 277 » Natural Rewriting for General Term Rewriting Systems |
110
click to vote
TAPSOFT
1993
Springer
15 years 6 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
111
click to vote
FOSSACS
2011
Springer
14 years 5 months ago
2011
Springer
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
105
Voted
WWW
2008
ACM
16 years 2 months ago
2008
ACM
A lot of recent research has focused on the content-based dissemination of XML data. However, due to the heterogeneous data schemas used by different data publishers even for data...
150
click to vote
PEPM
2010
ACM
15 years 3 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
101
click to vote
GG
2008
Springer
15 years 3 months ago
2008
Springer
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...