Bounded, strongly sequential and forward-branching term rewriting systems

DOI10.1006/JSCO.1994.1050MaRDI QIDQ1892142zbMATH OpenOpenAlexFDO

Authors Irène Durand

Publication date 8 June 1995

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1994.1050

zbMATH Keywords

bounded classstrongly sequential class

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Strongly sequential and inductively sequential term rewriting systems
• Semantics and strong sequentially of priority term rewriting systems
• Termination of linear bounded term rewriting systems
• Semantics and strong sequentiality of priority term rewriting systems
• scientific article; zbMATH DE number 1722708
• A compact fixpoint semantics for term rewriting systems
• Term Rewriting and Applications
• scientific article; zbMATH DE number 177826
• A refinement of strong sequentiality for term rewriting with constructors
• Proving Termination of Rewrite Systems Using Bounds

Cited in

(7)

• Decidable call-by-need computations in term rewriting
• Constructor equivalent term rewriting systems
• Strongly sequential and inductively sequential term rewriting systems
• Semantics and strong sequentially of priority term rewriting systems
• Semantics and strong sequentiality of priority term rewriting systems
• Sequentiality in orthogonal term rewriting systems
• Strong and NV-sequentiality of constructor systems

This page was built for publication: Bounded, strongly sequential and forward-branching term rewriting systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892142)