498 search results - page 71 / 100 » Term Rewriting |
64
Voted
FAC
2008
14 years 9 months ago
2008
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
114
click to vote
ERSHOV
2009
Springer
15 years 1 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
98
Voted
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
PPDP
2010
Springer
14 years 7 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
81
Voted
SIGSOFT
2001
ACM
15 years 10 months ago
2001
ACM
For several different reasons, such as changes in the business or technological environment, the configuration of a system may need to evolve during execution. Support for such ev...