Term Rewriting and Applications
From MaRDI portal
Publication:5703843
DOI10.1007/b135673zbMath1078.68651MaRDI QIDQ5703843
Toshiyuki Yamada, Takahito Aoto
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135673
68Q42: Grammars and rewriting systems
Related Items
Uncurrying for termination and complexity, Tyrolean termination tool: techniques and features, Enhancing dependency pair method using strong computability in simply-typed term rewriting, Harnessing First Order Termination Provers Using Higher Order Dependency Pairs, Argument Filterings and Usable Rules for Simply Typed Dependency Pairs
Uses Software