Sciweavers

498 search results - page 75 / 100
» Term Rewriting
Sort
View
GPCE
2007
Springer
15 years 3 months ago
Debugging macros
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...
Ryan Culpepper, Matthias Felleisen
LICS
1997
IEEE
15 years 1 months ago
Ground Reducibility is EXPTIME-Complete
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...
Hubert Comon, Florent Jacquemard
CADE
2006
Springer
15 years 10 months ago
Stratified Context Unification Is NP-Complete
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...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
CADE
2011
Springer
13 years 9 months ago
Experimenting with Deduction Modulo
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...
Guillaume Burel
ICEIS
2005
IEEE
15 years 3 months ago
Change Detection and Maintenance of an XML Web Warehouse
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,...
Ching-Ming Chao