Building exact computation sequences

DOI10.1016/0304-3975(87)90029-6zbMath0625.68026OpenAlexW1986503158MaRDI QIDQ579925

Jean H. Gallier, Alex Pelin

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90029-6

zbMATH Keywords

free algebraword problemrewritingstep functionequational theoriesconditional equationstop-down reduction extensions

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Free algebras (08B20) Equational classes, universal algebra in model theory (03C05) Word problems (aspects of algebraic structures) (08A50)

Cites Work

• Orderings for term-rewriting systems
• Proofs by induction in equational theories with constructors
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Building exact computation sequences