scientific article; zbMATH DE number 4191131
From MaRDI portal
zbMATH Open0722.68070MaRDI QIDQ3210187FDOQ3210187
Authors: Nachum Dershowitz, David A. Plaisted 
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
General topics in the theory of software (68N01) Theory of programming languages (68N15) Logic programming (68N17) Grammars and rewriting systems (68Q42)
Cited In (24)
- C-expressions: A variable-free calculus for equational logic programming
- Deductive and inductive synthesis of equational programs
- Equation solving in conditional AC-theories
- Programming with narrowing: a tutorial
- Title not available (Why is that?)
- Local confluence of conditional and generalized term rewriting systems
- Schematization of infinite sets of rewrite rules generated by divergent completion processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- Towards a foundation of completion procedures as semidecision procedures
- More problems in rewriting
- Title not available (Why is that?)
- Ternary Equational Languages
- Compiling concurrent rewriting onto the Rewrite Rule Machine
- Equational completion in order-sorted algebras
- Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
- Extended term rewriting systems
- An abstract concurrent machine for rewriting
- A rationale for conditional equational programming
- Confluence of the disjoint union of conditional term rewriting systems
- Elimination of conditions
- Conditional rewriting logic: Deduction, models and concurrency
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210187)
