1385 search results - page 17 / 277 » Natural Rewriting for General Term Rewriting Systems |
149
click to vote
ACL
1992
15 years 7 months ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
159
click to vote
ALP
1994
Springer
15 years 10 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
158
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
159
click to vote
ICTAC
2004
Springer
15 years 11 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
143
click to vote
RTA
2004
Springer
15 years 11 months ago
2004
Springer
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...