scientific article; zbMATH DE number 1841839
From MaRDI portal
Publication:4783327
zbMath0999.68094MaRDI QIDQ4783327
Publication date: 4 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2142/21420484
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
automatagraphsterminationlambda-calculuswell-foundednesspath orderingshigher-order path orderingsKnuth-Bendix orderings
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)
Related Items
On the Computational Content of Termination Proofs, Jumping and escaping: modular termination and the abstract path ordering, Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations, The Computability Path Ordering: The End of a Quest, Proving weak properties of rewriting, Dependent choice as a termination principle
