Rewriting Techniques and Applications
From MaRDI portal
Publication:5901561
DOI10.1007/b98160zbMath1187.68284OpenAlexW2661706449MaRDI QIDQ5901561
Publication date: 30 April 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98160
Related Items
Uncurrying for termination and complexity ⋮ Flow analysis of lazy higher-order functional programs ⋮ Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations ⋮ A Lambda-Free Higher-Order Recursive Path Order ⋮ Enhancing dependency pair method using strong computability in simply-typed term rewriting ⋮ Complexity Analysis by Rewriting ⋮ Argument Filterings and Usable Rules for Simply Typed Dependency Pairs