scientific article
From MaRDI portal
Publication:2778883
zbMath0981.68067MaRDI QIDQ2778883
Publication date: 21 March 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2051/20510261
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Coq formalization of the higher-order recursive path ordering ⋮ An effective proof of the well-foundedness of the multiset path ordering ⋮ Normal Higher-Order Termination ⋮ Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations ⋮ Enhancing dependency pair method using strong computability in simply-typed term rewriting ⋮ Expression reduction systems with patterns
