Classes of equational programs that compile into efficient machine code
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Sequentiality in orthogonal term rewriting systems
Journal of Symbolic Computation
NV-sequentiality: a decidable condition for call-by-need computations in term-rewriting systems
SIAM Journal on Computing
Bounded, strongly sequential and forward-branching term rewriting systems
Journal of Symbolic Computation
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that
Strongly sequential and inductively sequential term rewriting systems
Information Processing Letters
Root-neededness and approximations of neededness
Information Processing Letters
Sequentiality, monadic second-order logic and tree automata
Information and Computation
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Context-sensitive rewriting strategies
Information and Computation
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Decidable Call by Need Computations in term Rewriting (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Strong Sequentiality of Left-Linear Overlapping Rewrite Systems
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Sequentiality, Second-order Monadic Logic and Tree Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.89 |
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used as an abstract model of some programming languages. While normalizing strategies are always desirable for achieving a good computational behavior of programs, when dealing with lazy languages infinitary normalizing strategies should be considered instead since (finite approximations of) infinite data structures can be returned as the result of computations. We have shown that NV-sequential TRSs (hence strongly sequential TRSs, a subclass of them) provide an appropriate basis for the effective definition of normalizing and infinitary normalizing strategies. In this paper, we show that strongly sequential and NV-sequential CSs coincide. Since the implementation of NV-sequential TRSs has been underexplored in comparison to strongly sequential TRSs, this coincidence suggests that, in programming languages, it is a good option to implement NV-sequentiality as strong sequentiality.