Building exact computation sequences

DOI10.1016/0304-3975(87)90029-6MaRDI QIDQ579925zbMATH OpenOpenAlexFDO

Authors Alex Pelin, Jean Gallier

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

step functionrewritingword problemfree algebraequational theoriesconditional equationstop-down reduction extensions

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3870639 (Why is no real title available?)
• scientific article; zbMATH DE number 3870640 (Why is no real title available?)
• scientific article; zbMATH DE number 3869406 (Why is no real title available?)
• scientific article; zbMATH DE number 3871335 (Why is no real title available?)
• scientific article; zbMATH DE number 3978368 (Why is no real title available?)
• scientific article; zbMATH DE number 3702108 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Orderings for term-rewriting systems
• Proofs by induction in equational theories with constructors

Cited in

(1)

• scientific article; zbMATH DE number 975358 (Why is no real title available?)

This page was built for publication: Building exact computation sequences

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