Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1238751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering |
scientific article; zbMATH DE number 1238751 |
Statements
Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (English)
0 references
12 January 1999
0 references
higher-order rewriting
0 references
typed lambda calculus
0 references
termination orderings
0 references
0.9680696
0 references
0.89581364
0 references
0.85118395
0 references
0.8507291
0 references
0 references
0.8471866
0 references
0.84281874
0 references
0.8377007
0 references
