On equal \(\mu \)-terms

DOI10.1016/j.tcs.2011.04.011zbMath1227.68041OpenAlexW55323366MaRDI QIDQ549186

Clemens Grabmayer, Jörg Endrullis, Vincent van Oostrom, Jan Willem Klop

Publication date: 7 July 2011

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.011

zbMATH Keywords

tree automatarenaming\(\alpha\)-equivalencestrong \(\mu\)-equalityweak \(\mu\)-equality

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (4)

A decision procedure for (co)datatypes in SMT solvers ⋮ A logical framework with higher-order rational (circular) terms ⋮ On abstract normalisation beyond neededness ⋮ Clocks for Functional Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Rational rewriting
• A duality between proof systems for cyclic term graphs
• Iterative Lexicographic Path Orders
• Context rewriting
• Theoretical Computer Science
• Automated Deduction – CADE-19
• Rudiments of \(\mu\)-calculus

This page was built for publication: On equal \(\mu \)-terms