Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enhancing dependency pair method using strong computability in simply-typed term rewriting |
scientific article |
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
