| R. Kennaway and F.-J. d. Vries. Infinitary rewriting. To appear as chapter in a book on rewriting edited by J. W. Klop. Draft is available at http://www.etl.go.jp/ ferjan/drafts.html, 2000. |
.... 0 . i) We de ne the binary reduction relation as the least compatible binary relation on 0 containing the beta rule: x:X)M X[M=x] ii) A redex is a term in 0 of the form ( x:X)M . Substitution in the in nitary lambda calculus 1 needs some attention. We refer to [16,18]. We generalize the notion of zero term given in De nition 1.1 and that of strong zero term [7] 2 De nition 2.5 Let 0 and 0 a reduction relation on 0 . 2 Equivalent alternative formulations for strong zero term are unsolvable of order 0 in [19] and strongly unsolvable in [1] ....
....tree equality to observational equivalence via in nite rewriting In this section we will represent Berarducci trees explicitly as terms. Then the Berarducci tree T (M) of a term M of is nothing else but the (possibly in nite) unique normal form of M in the in nitary extension 1 as shown in [16,18]. In this term interpretation, the previous coinductive construction of Berarducci tree translates into a parallel outermost reduction strategy which replaces occurring outermost rootactive subterms by . Because Berarducci trees of nite terms can be in nite (cf. I in Figure 1) one has to ....
[Article contains additional citation context not shown here]
R. Kennaway and F.-J. d. Vries. Innitary rewriting. To appear as chapter in a book on rewriting edited by J. W. Klop. Draft is available at http://www. etl.go.jp/~ferjan/drafts.html, 2000.
No context found.
R. Kennaway and F.-J. d. Vries. Infinitary rewriting. To appear as chapter in a book on rewriting edited by J. W. Klop. Draft is available at http://www.etl.go.jp/ ferjan/drafts.html, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC