500 search results - page 55 / 100 » ACD Term Rewriting |
101
click to vote
TACS
1994
Springer
15 years 4 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
183
click to vote
POPL
2007
ACM
16 years 5 days ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
112
click to vote
ICLP
1995
Springer
15 years 3 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
177
click to vote
SIGMOD
2006
ACM
16 years 16 hour ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
RTA
1995
Springer
15 years 3 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...