scientific article; zbMATH DE number 785049

zbMATH Open0832.68062MaRDI QIDQ4842538FDOQ4842538

Authors: Jean-Pierre Jouannaud 

Publication date: 14 August 1995

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 50648
• scientific article; zbMATH DE number 4155899
• scientific article; zbMATH DE number 1368955
• scientific article; zbMATH DE number 177826
• Computing with rewrite systems

zbMATH Keywords

tree automataequational logicrewriting techniques

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cited In (10)

• Rewriting, inference, and proof
• Title not available (Why is that?)
• Rewrite systems for natural, integral, and rational arithmetic
• Rewriting Induction + Linear Arithmetic = Decision Procedure
• Rewriting, computation and proof. Essays dedicated to Jean-Pierre Jouannaud on the occasion of his 60th birthday.
• Title not available (Why is that?)
• Proving structural properties of sequent systems in rewriting logic
• Interaction nets and term rewriting systems (extended abstract)
• Collapsed tree rewriting: Completeness, confluence, and modularity
• Proving and rewriting

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 Q4842538)