An efficient representation of arithmetic for term rewriting

DOI10.1007/3-540-53904-2_100MaRDI QIDQ5055764zbMATH OpenOpenAlexFDO

Authors Dave Cohen, Phil Watson

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53904-2_100

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Recommendations

• Rewrite systems for integer arithmetic
• Rewrite systems for natural, integral, and rational arithmetic
• scientific article; zbMATH DE number 177461
• Datatype defining rewrite systems for naturals and integers
• scientific article; zbMATH DE number 2043518

Cites work

• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Termination of rewriting

Cited in

(7)

• Characterizing arithmetic read-once formulae
• Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
• More problems in rewriting
• Rewrite systems for integer arithmetic
• Problems in rewriting III
• LEMA
• Datatype defining rewrite systems for naturals and integers

This page was built for publication: An efficient representation of arithmetic for term rewriting

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