113 search results - page 2 / 23 » Reduction Strategies for Left-Linear Term Rewriting Systems |
BIRTHDAY
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the...
ICLP
1997
Springer
15 years 4 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...
101
click to vote
AGTIVE
2007
Springer
15 years 6 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...
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...