scientific article
From MaRDI portal
Publication:4038704
zbMath0765.68008MaRDI QIDQ4038704
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
equational logicorthogonalityterminationnarrowingcombinatory logicabstract reduction systemsconditional rewritingChurch-RosserKnuth-Bendixcritical pair completionNewman's lemmarepeated variables
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)
Related Items (12)
Collapsed tree rewriting: Completeness, confluence, and modularity ⋮ Implementing term rewriting by graph reduction: Termination of combined systems ⋮ Completeness results for basic narrowing ⋮ Decidability of confluence and termination of monadic term rewriting systems ⋮ Categorical abstract machines for higher-order typed \(\lambda\)-calculi ⋮ Category-based modularisation for equational logic programming ⋮ Implementing term rewriting by jungle evaluation ⋮ An introduction to category-based equational logic ⋮ Lambda calculus with patterns ⋮ How to decide the lark ⋮ Memory Policy Analysis for Semantics Specifications in Maude ⋮ Free Burnside Semigroups
Uses Software
This page was built for publication:
