1385 search results - page 37 / 277 » Natural Rewriting for General Term Rewriting Systems |
120
click to vote
ICLP
1997
Springer
15 years 6 months ago
1997
Springer
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...
135
click to vote
ACL2
2006
ACM
15 years 8 months ago
2006
ACM
Several users have had problems using equivalence-based rewriting in ACL2 because the ACL2 rewriter caches its results. We describe this problem in some detail, together with a pa...
107
click to vote
ENTCS
2006
15 years 2 months ago
2006
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
115
click to vote
RTA
2004
Springer
15 years 7 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
125
click to vote
RP
2010
Springer
14 years 12 months ago
2010
Springer
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...