1385 search results - page 54 / 277 » Natural Rewriting for General Term Rewriting Systems |
183
click to vote
UPP
2004
Springer
15 years 11 months ago
2004
Springer
The chemical reaction metaphor describes computation in terms of a chemical solution in which molecules interact freely according to reaction rules. Chemical solutions are represen...
159
click to vote
IANDC
2007
15 years 6 months ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
144
click to vote
WADT
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
157
click to vote
RTA
1995
Springer
15 years 9 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
161
click to vote
CASES
2010
ACM
15 years 4 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...