scientific article; zbMATH DE number 785049

MaRDI QIDQ4842538zbMATH OpenFDO

Authors Jean-Pierre Jouannaud

Publication date 14 August 1995

zbMATH Keywords

tree automataequational logicrewriting techniques

Mathematics Subject Classification ID

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

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

Cited in

(11)

• Proving and rewriting
• Collapsed tree rewriting: Completeness, confluence, and modularity
• Composing proof terms
• Rewriting, inference, and proof
• scientific article; zbMATH DE number 2090037 (Why is no real title available?)
• 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.
• scientific article; zbMATH DE number 50648 (Why is no real title available?)
• Proving structural properties of sequent systems in rewriting logic
• Interaction nets and term rewriting systems (extended abstract)

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)