Publication:4247081
From MaRDI portal
zbMath0927.03054MaRDI QIDQ4247081
Publication date: 16 June 1999
higher-order rewrite systems; higher-order terms without \(\lambda\)-abstraction; precedence-based termination ordering
68N18: Functional programming and lambda calculus
03B70: Logic in computer science
68Q42: Grammars and rewriting systems
03B40: Combinatory logic and lambda calculus
Related Items
A Lambda-Free Higher-Order Recursive Path Order, Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations