Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908)
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 5212875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enhancing dependency pair method using strong computability in simply-typed term rewriting |
scientific article; zbMATH DE number 5212875 |
Statements
Enhancing dependency pair method using strong computability in simply-typed term rewriting (English)
0 references
19 November 2007
0 references
termination
0 references
simply-typed term rewriting system
0 references
plain function-passing
0 references
dependency pair
0 references
strong computability
0 references
0.7997061014175415
0 references
0.7750342488288879
0 references
0.7551495432853699
0 references
0.7500933408737183
0 references
