882 search results - page 26 / 177 » A Taste of Rewrite Systems |
ICDE
2007
IEEE
13 years 11 months ago
2007
IEEE
The problem of building Recommender Systems has attracted considerable attention in recent years, but most recommender systems are designed for recommending items for individuals....
RTA
2005
Springer
14 years 1 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
FPCA
1987
13 years 11 months ago
1987
: Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Catego...