Results 1 
2 of
2
HigherOrder Rewriting
 12th Int. Conf. on Rewriting Techniques and Applications, LNCS 2051
, 1999
"... This paper will appear in the proceedings of the 10th international conference on rewriting techniques and applications (RTA'99). c flSpringer Verlag. ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
This paper will appear in the proceedings of the 10th international conference on rewriting techniques and applications (RTA'99). c flSpringer Verlag.
Trivial
"... i # 0, C i+1 = # # C i [1]. (See below for examples.) Remark that for any prefix D of s, # # D is a prefix of s again [3]. Hence to show l# # C # s, it su#ces by C 0 = l# to show monotonicity: C i # C i+1 , #i # 0, by induction on i. The base case l# # C 1 holds since the headsymbo ..."
Abstract
 Add to MetaCart
i # 0, C i+1 = # # C i [1]. (See below for examples.) Remark that for any prefix D of s, # # D is a prefix of s again [3]. Hence to show l# # C # s, it su#ces by C 0 = l# to show monotonicity: C i # C i+1 , #i # 0, by induction on i. The base case l# # C 1 holds since the headsymbol of r traces back to any position in l. In the induction step, suppose p # C i for some i > 0. By definition of C i , there exists some q # C i1<