On the correspondence between two classes of reduction systems

DOI10.1016/0020-0190(85)90068-7zbMath0566.68036OpenAlexW2065568880MaRDI QIDQ1059392

Satish R. Thatte

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/25754

zbMATH Keywords

semanticscomputable functionsterm rewriting systemsdata constructorsequationally specified reduction systems

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items

Constructor equivalent term rewriting systems are strongly sequential: A direct proof, A refinement of strong sequentiality for term rewriting with constructors, Inductive proofs by specification transformations, Transforming strongly sequential rewrite systems with constructors for efficient parallel execution, Implementing first-order rewriting with constructor systems, Transformations and confluence for rewrite systems, Constructor equivalent term rewriting systems, Remarks on Thatte's transformation of term rewriting systems

Cites Work

• Unnamed Item
• Computing in systems described by equations
• Abstract Implementations and Their Correctness Proofs
• Implementation of an interpreter for abstract equations
• Initial Algebra Semantics and Continuous Algebras
• A Machine-Oriented Logic Based on the Resolution Principle
• Tree-Manipulating Systems and Church-Rosser Theorems