500 search results - page 58 / 100 » ACD Term Rewriting |
LICS
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
FOCM
2006
14 years 9 months ago
2006
We present an approach that allows performing computations related to the Baker-Campbell-Haussdorff (BCH) formula and its generalizations in an arbitrary Hall basis, using labeled...
ENTCS
2007
14 years 9 months ago
2007
We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to loc...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
SOFSEM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...