498 search results - page 75 / 100 » Term Rewriting |
171
click to vote
GPCE
2007
Springer
16 years 2 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...
120
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...
151
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
307
click to vote
CADE
2011
Springer
14 years 5 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
151
click to vote
ICEIS
2005
IEEE
15 years 11 months ago
2005
IEEE
The World Wide Web contains a huge and increasing volume of information. The web warehouse is an efficient and effective means to facilitate utilization of information on the Web,...