Strong Sequentiality of Left-Linear Overlapping Rewrite Systems

@inproceedings{Jouannaud1994StrongSO,
  title={Strong Sequentiality of Left-Linear Overlapping Rewrite Systems},
  author={Jean-Pierre Jouannaud and Walid Sadfi},
  booktitle={CTRS},
  year={1994}
}
Confluent term rewriting systems can be seen as a model for functional computations, in which redexes corresponding to instances of left hand sides of rules are repeatedly replaced by their corresponding right hand side instance. Lazy sequential strategies reduce a given redex in a term if and only if this redex must be reduced by any other sequential strategy computing the normal form of the term. Lazy strategies always terminate when a normal form exist, and are indeed optimal. In a landmark… 
Reduction Strategies for Left-Linear Term Rewriting Systems
  • Y. Toyama
  • Mathematics
    Processes, Terms and Cycles
  • 2005
TLDR
It is proved that approximated external reduction is a computable normalizing strategy for the class of left-linear term rewriting systems in which every critical pair can be joined with root balanced reductions.
Sequentiality, second order monadic logic and tree automata
  • H. Comon
  • Computer Science
    Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science
  • 1995
TLDR
The paper describes a direct construction of an automaton recognizing the set of terms that have needed redexes, which yields immediate consequences: strong sequentiality of possibly overlapping linear rewrite systems is decidable in EXPTIME; for strongly sequential rewrite systems, neededRedexes can be read directly on the automaton.
Sequentiality, monadic second-order logic and tree automata
TLDR
It is shown here that the sequentiality of P is definable in SkS, the monadic second-order logic with k successors, provided P is Definable inSkS, and derives several known and new consequences of this remark.
Sequentiality, Monadic Second-Order Logic and Tree Automata
TLDR
It is shown here that the sequentiality of P is definable in SkS, the monadic secondorder logic with k successors, provided P is Definable inSkS.
Decidable call-by-need computations in term rewriting
Strong and NV-sequentiality of constructor systems
Approximations for Strategies and Termination
  • A. Middeldorp
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2002
Context-Sensitive Rewriting Strategies
TLDR
It is shown that this theory of context-sensitive rewriting is suitable for formalizing the definition and analysis of real computational strategies which are used in programming languages such as OBJ or ELAN.
NVNF-sequentiality of Left-linear Term Rewriting Systems
TLDR
This paper introduces NVNF-sequentiality which is an extension of NV- sequentiality defined by Oyamaguchi, and it is shown that the class of NVNF -sequential systems properly includes theclass of - Sequential systems, and the indices are computed for a given term when a term rewriting system is NVNFsequential.
Strong and Nv-sequentiality of Constructor Systems (extended Abstract) ?
TLDR
The fact that strongly sequential and NV-sequential CSs coincide suggests that, in programming languages, it is a good option to implement NV- sequentiality as strong sequentiality.
...
...

References

SHOWING 1-10 OF 14 REFERENCES
Strong sequentiality of left-linear overlapping term rewriting systems
  • Y. Toyama
  • Mathematics
    [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science
  • 1992
TLDR
It is shown that index reduction is normalizing for the class of strongly sequential left-linear term rewriting systems in which every critical pair can be joined with root balanced reductions.
NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
TLDR
This paper introduces a larger subclass called NV-sequentiality, which is a natural extension of strong sequentiality and is based on the analysis of both the left-hand sides and part of the right- hand sides of systems, whereas strong sequentiality isbased on theAnalysis of left-hands sides alone.
Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors
  • D. Kesner
  • Computer Science, Mathematics
    CADE
  • 1992
TLDR
An effective decision procedure is provided for free sequentiality for the class of orthogonal systems with constructors, a notion which does not impose conditions over the signature.
Sequentiality in Orthogonal Term Rewriting Systems
Rewrite Systems
  • N. Dershowitz, J. Jouannaud
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
Compiling pattern matching by term decomposition
We present a method for compiling pattern matching on lazy languages based on previous work of Huet and Lévy and, later on, Laville by coding ambiguous linear sets of patterns using “Term
Notations for Rewting
Suucient sequentiality: a decidable condition for call-by-need computations in term rewriting systems
  • Suucient sequentiality: a decidable condition for call-by-need computations in term rewriting systems
  • 1987
This article was processed using the L a T E X macro package with LLNCS style
  • This article was processed using the L a T E X macro package with LLNCS style
...
...