Eta-Reduction in Type-Theory of Acyclic Recursion
We investigate the applicability of the classic eta-conversion in the type-theory of acyclic algorithms. While denotationally valid, classic eta-conversion is not algorithmically valid in the type theory of algorithms, with the exception of few limited cases. The paper shows how the restricted, algo...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Institución: | Universidad de Salamanca (USAL) |
| Repositorio: | GREDOS. Repositorio Institucional de la Universidad de Salamanca |
| OAI Identifier: | oai:gredos.usal.es:10366/160199 |
| Acceso en línea: | http://hdl.handle.net/10366/160199 |
| Access Level: | acceso abierto |
| Palabra clave: | algorithm denotation reduction |
| Sumario: | We investigate the applicability of the classic eta-conversion in the type-theory of acyclic algorithms. While denotationally valid, classic eta-conversion is not algorithmically valid in the type theory of algorithms, with the exception of few limited cases. The paper shows how the restricted, algorithmic eta-rule can recover algorithmic eta-conversion in the reduction calculi of type-theory of algorithms. |
|---|