scientific article; zbMATH DE number 2043542

MaRDI QIDQ4447246zbMATH OpenFDO

Authors Takahito Aoto, Toshiyuki Yamada

Publication date 16 February 2004

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1722716
• Term Rewriting and Applications
• scientific article; zbMATH DE number 794240
• Normal higher-order termination
• scientific article; zbMATH DE number 759443

Cited in

(12)

• Enhancing dependency pair method using strong computability in simply-typed term rewriting
• Higher-order interpretations and program complexity
• scientific article; zbMATH DE number 1722716 (Why is no real title available?)
• A Lambda-Free Higher-Order Recursive Path Order
• Uncurrying for termination and complexity
• On the Relation between Sized-Types Based Termination and Semantic Labelling
• Argument filterings and usable rules for simply typed dependency pairs
• scientific article; zbMATH DE number 4078756 (Why is no real title available?)
• Real_Impl
• Transforming SAT into termination of rewriting
• Term Rewriting and Applications
• Tyrolean termination tool: techniques and features

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 Q4447246)