Name
Abstract | ||
|---|---|---|
Arts and Giesl proved that the termination of a first-order rewrite system can be reduced to the study of its "dependency pairs". We extend these results to rewrite systems on simply typed lambda-terms by using Tait's computability technique. |
Year | Venue | DocType |
|---|---|---|
2018 | CoRR | Journal |
Volume | ISSN | Citations |
abs/1804.08855 | Eighth International Workshop on Termination - WST 2006, Aug 2006,
Seattle, United States. 2006 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frédéric Blanqui | 1 | 1 | 2.04 |