This paper introduces NVNF-sequentiality which is an extension of NV-sequentiality defined by Oyamaguchi. It is shown that the class of NVNF-sequential systems prop-erly includes the class of $\mathrm{N}\mathrm{V}$-sequential systems, and the indices with respect to NVNF-sequentiality are computed for a given term when a term rewriting system is NVNF-sequential. NVNF-sequentiality is decidable, and the index reduction is normalizing strat-egy for NVNF-sequential orthogonal term rewriting systems.
AbstractThe class of Strongly Sequential Term Rewriting Systems (SS) was defined in [Huet & Lévy (19...
AbstractThis paper gives an operational semantics of priority term rewriting systems (PRSs) by using...
Sekar and al. found an efficient parallel reduction strategy for the class of path sequential term r...
AbstractFor orthogonal term rewriting systems Q. Huet and J.-J. Lévy have introduced the property of...
AbstractKennaway proved the remarkable result that every (almost) orthogonal term rewriting system a...
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a ...
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a ...
AbstractGiven a term rewriting system R and a normalizable term t, a redex is needed if in any reduc...
Given a term rewriting system R and a normalizable term t, a redex is needed if in any reduction seq...
AbstractA term rewriting system is called growing if each variable occurring on both the left-hand s...
This paper gives an operational semantics of priority term rewriting systems (PRS) by using conditio...
AbstractThe notion of call-by-need evaluation has turned out to be very fruitful when applied to dia...
AbstractA modular property of term rewriting systems is one that holds for the direct sum of two dis...
International audienceThe following theorem of Huet and Lévy [HL79] forms the basis of all results o...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
AbstractThe class of Strongly Sequential Term Rewriting Systems (SS) was defined in [Huet & Lévy (19...
AbstractThis paper gives an operational semantics of priority term rewriting systems (PRSs) by using...
Sekar and al. found an efficient parallel reduction strategy for the class of path sequential term r...
AbstractFor orthogonal term rewriting systems Q. Huet and J.-J. Lévy have introduced the property of...
AbstractKennaway proved the remarkable result that every (almost) orthogonal term rewriting system a...
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a ...
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a ...
AbstractGiven a term rewriting system R and a normalizable term t, a redex is needed if in any reduc...
Given a term rewriting system R and a normalizable term t, a redex is needed if in any reduction seq...
AbstractA term rewriting system is called growing if each variable occurring on both the left-hand s...
This paper gives an operational semantics of priority term rewriting systems (PRS) by using conditio...
AbstractThe notion of call-by-need evaluation has turned out to be very fruitful when applied to dia...
AbstractA modular property of term rewriting systems is one that holds for the direct sum of two dis...
International audienceThe following theorem of Huet and Lévy [HL79] forms the basis of all results o...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
AbstractThe class of Strongly Sequential Term Rewriting Systems (SS) was defined in [Huet & Lévy (19...
AbstractThis paper gives an operational semantics of priority term rewriting systems (PRSs) by using...
Sekar and al. found an efficient parallel reduction strategy for the class of path sequential term r...