1385 search results - page 39 / 277 » Natural Rewriting for General Term Rewriting Systems |
101
click to vote
CADE
2010
Springer
15 years 3 months 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...
121
click to vote
CSR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
113
click to vote
ENTCS
2007
15 years 1 months ago
2007
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
121
click to vote
AGTIVE
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
100
click to vote
FMOODS
2003
15 years 3 months ago
2003
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitions over configurations. The minism provides an abstraction over scheduling, net...