Termination of Narrowing with Dependency Pairs
In this work, we generalize the Dependency Pairs approach for automated proofs of termination to prove the termination of narrowing.We identify the phenomenon of echoing in infinite narrowing derivations and demonstrate that the new narrowing dependency pairs faithfully capture the shape of such der...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Fecha de publicación: | 2008 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/13622 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/13622 |
| Access Level: | acceso abierto |
| Palabra clave: | Termination Dependency pairs Narrowing LENGUAJES Y SISTEMAS INFORMATICOS Máster Universitario en Ingeniería del Software, Métodos Formales y Sistemas de Información-Màster Universitari en Enginyeria del Programari, Mètodes Formals i Sistemes D&apos Informació |
| Sumario: | In this work, we generalize the Dependency Pairs approach for automated proofs of termination to prove the termination of narrowing.We identify the phenomenon of echoing in infinite narrowing derivations and demonstrate that the new narrowing dependency pairs faithfully capture the shape of such derivations and provide a termination criterion. |
|---|