In a previous paper we have established the theory of trans nite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of in nitary rewriting, the Bohm model of the lambda calculus can be seen as an in nitary term model. In contrast to term rewriting, there are several di erent possible notions of in nite term, which...

We investigate properties of convergent and forward-closed string rewriting systems in the context of the syntactic criteria introduced in [8] by Christopher Lynch and Barbara Morawska (we call these LM-Systems). Since a string rewriting system can be viewed as a term-rewriting system over a signature of purely monadic function symbols, we adapt their definition to the string rewriting case. We...

This paper examines left-linear non-orthogonal term graph rewriting systems that allow asymmetric connicts between redexes. Using a deenition of compatibility of sequences based on Boudol's work on the semantics of term rewriting, it shows that two properties associated with functional languages are true of such graph rewriting systems. First, that a notion of standard computation can be deened...