Sequentiality in orthogonal term rewriting systems

Authors:
Jan Willem Klop;Aart Middeldorp
Affiliations:
Centre for Mathematics and Computer Science, Kruislaan 413, 1098 SJ Amsterdam, The Netherland and Department of Mathematics and Computer Science, Vrije Universiteit, de Boelelaan 1081a, 1081HV Ams ...;Centre for Mathematics and Computer Science, Kruislaan 413, 1098 SJ Amsterdam, The Netherland
Venue:
Journal of Symbolic Computation
Year:
1991

Citing 9
Cited 14

On the Church-Rosser property for the direct sum of term rewriting systems

Journal of the ACM (JACM)
Conditional rewrite rules: Confluence and termination

Journal of Computer and System Sciences
A refinement of strong sequentiality for term rewriting with constructors

Information and Computation
Computational semantics of term rewriting systems

Algebraic methods in semantics
Lazy pattern matching in the ML language

Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Rewrite systems

Handbook of theoretical computer science (vol. B)
Minimal and Optimal Computations of Recursive Programs

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Implementation of an interpreter for abstract equations

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

A needed narrowing strategy

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A needed narrowing strategy

Journal of the ACM (JACM)
Context-sensitive rewriting strategies

Information and Computation
Normalization, approximation, and semantics for combinator systems

Theoretical Computer Science
On the Modularity of Deciding Call-by-Need

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Autowrite: A Tool for Checking Properties of Term Rewriting Systems

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Strong and NV-sequentiality of constructor systems

Information Processing Letters
Rules + strategies for transforming lazy functional logic programs

Theoretical Computer Science
Decidable call-by-need computations in term rewriting

Information and Computation
On Term-Graph Rewrite Strategies

Electronic Notes in Theoretical Computer Science (ENTCS)
A Needed Rewriting Strategy for Data-Structures with Pointers

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
A hybrid programming scheme combining fuzzy-logic and functional-logic resources

Fuzzy Sets and Systems
Decidable call-by-need computations in term rewriting

Information and Computation
Reduction strategies for left-linear term rewriting systems

Processes, Terms and Cycles

Quantified Score

Hi-index	0.00

Visualization

Abstract

For orthogonal term rewriting systems Q. Huet and J.-J. Levy have introduced the property of 'strong sequentiality'. A strongly sequential orthogonal term rewriting system admits an efficiently computable normalizing one-step reduction strategy. As shown by Huet and Levy, strong sequentiality is a decidable property. In this paper we present an alternative analysis of strongly sequential term rewriting systems, leading to two simplified proofs of the decidability of this property. We also compare some related notions of sequentiality that recently have been proposed.