On equal -terms

DOI10.1016/J.TCS.2011.04.011MaRDI QIDQ549186zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 1189296
• Infinitary rewriting: foundations revisited
• Rational term rewriting revisited: decidability and confluence
• Decidability properties of recursive types.
• scientific article; zbMATH DE number 1373518

Cites work

• scientific article; zbMATH DE number 2185708 (Why is no real title available?)
• scientific article; zbMATH DE number 1189296 (Why is no real title available?)
• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• scientific article; zbMATH DE number 1332646 (Why is no real title available?)
• scientific article; zbMATH DE number 1064116 (Why is no real title available?)
• scientific article; zbMATH DE number 2043525 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 1456960 (Why is no real title available?)
• A duality between proof systems for cyclic term graphs
• A duality in proof systems for recursive type equality and for bisimulation equivalence on cyclic term graphs
• Context rewriting
• Decidability properties of recursive types.
• Iterative Lexicographic Path Orders
• Rational rewriting
• Rudiments of \(\mu\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• \(\rightthreetimes\)

Cited in

(4)

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

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

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