Descendants and head normalization of higher-order rewrite systems

DOI10.1007/3-540-45788-7_12MaRDI QIDQ4409161zbMATH OpenFDO

Authors Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa

Publication date 30 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2441/24410198.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Higher-order rewrite systems and their confluence
• Higher-order rewriting
• scientific article; zbMATH DE number 512788
• Descendants and origins in term rewriting.
• Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering

Cited in

(2)

• scientific article; zbMATH DE number 2090069 (Why is no real title available?)
• (Head-)normalization of typeable rewrite systems

This page was built for publication: Descendants and head normalization of higher-order rewrite systems

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