Nonoblivious normalization algorithms for nonlinear rewrite systems

DOI10.1007/BFB0032045MaRDI QIDQ4038705zbMATH OpenFDO

Authors Rakesh M. Verma, I. V. Ramakrishnan

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0032045

zbMATH Keywords

confluent rewrite systemsnoetherian systemsnonoblivious normalization algorithmsnonoverlapping systemsreductions

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Incremental techniques for efficient normalization of nonlinear rewrite systems
• Optimal normalization in orthogonal term rewriting systems
• Transformations and confluence for rewrite systems
• Infinite normal forms for non-linear term rewriting systems
• Confluent term rewriting systems

Cited in

(6)

• \texttt{KNOSOS}: a fast orbit-averaging neoclassical code for stellarator geometry
• Non-linear rewrite closure and weak normalization
• Incremental techniques for efficient normalization of nonlinear rewrite systems
• Unique normal forms for nonlinear term rewriting systems: Root overlaps
• Normalization by leftmost innermost rewriting
• Transformations and confluence for rewrite systems

This page was built for publication: Nonoblivious normalization algorithms for nonlinear rewrite systems

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