Rewriting Techniques and Applications
From MaRDI portal
Publication:5901559
DOI10.1007/b98160zbMath1187.68127OpenAlexW2661706449MaRDI QIDQ5901559
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
Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)
Related Items (6)
Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ The Strength of the SCT Criterion ⋮ The Computability Path Ordering: The End of a Quest ⋮ Unnamed Item ⋮ A SAT-Based Approach to Size Change Termination with Global Ranking Functions ⋮ A complexity tradeoff in ranking-function termination proofs
This page was built for publication: Rewriting Techniques and Applications
