Publication:4447246
From MaRDI portal
zbMath1038.68060MaRDI QIDQ4447246
Toshiyuki Yamada, Takahito Aoto
Publication date: 16 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2706/27060380.htm
68Q42: Grammars and rewriting systems
Related Items
Transforming SAT into Termination of Rewriting, Higher-order interpretations and program complexity, Uncurrying for termination and complexity, Tyrolean termination tool: techniques and features, A Lambda-Free Higher-Order Recursive Path Order, Argument Filterings and Usable Rules for Simply Typed Dependency Pairs