584 search results - page 16 / 117 » Logic Programs as term Rewriting Systems |
112
click to vote
CADE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
104
click to vote
RCC
2002
14 years 10 months ago
2002
In recent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specifi...
120
click to vote
PEPM
2010
ACM
15 years 1 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...
CADE
2010
Springer
15 years 8 days ago
2010
Springer
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
CADE
2012
Springer
13 years 1 months ago
2012
Springer
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...