1385 search results - page 77 / 277 » Natural Rewriting for General Term Rewriting Systems |
264
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
171
click to vote
GPCE
2007
Springer
16 years 9 days ago
2007
Springer
Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs in...
122
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
177
click to vote
LOPSTR
2009
Springer
16 years 21 days ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
185
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...