Semantic Labelling for Proving Termination of Combinatory Reduction Systems
From MaRDI portal
Publication:3557095
DOI10.1007/978-3-642-11999-6_5zbMath1274.68150OpenAlexW1597717806MaRDI QIDQ3557095
Publication date: 27 April 2010
Published in: Functional and Constraint Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11999-6_5
Related Items
How to prove decidability of equational theories with second-order computation analyser SOL, Unnamed Item, Theory and practice of second-order rewriting: foundation, evolution, and SOL
Uses Software