Publication:4783327
From MaRDI portal
zbMath0999.68094MaRDI QIDQ4783327
Publication date: 4 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2142/21420484
automata; graphs; termination; lambda-calculus; well-foundedness; path orderings; higher-order path orderings; Knuth-Bendix orderings
68Q45: Formal languages and automata
68Q42: Grammars and rewriting systems
03B40: Combinatory logic and lambda calculus
Related Items
Proving weak properties of rewriting, Jumping and escaping: modular termination and the abstract path ordering, Dependent choice as a termination principle, On the Computational Content of Termination Proofs, Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations, The Computability Path Ordering: The End of a Quest