On equal -terms

DOI10.1016/J.TCS.2011.04.011zbMATH Open1227.68041OpenAlexW55323366MaRDI QIDQ549186FDOQ549186

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

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

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)

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rudiments of \(\mu\)-calculus
• A duality in proof systems for recursive type equality and for bisimulation equivalence on cyclic term graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rational rewriting
• A duality between proof systems for cyclic term graphs
• Iterative Lexicographic Path Orders
• Context rewriting
• Decidability properties of recursive types.
• \(\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)