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...

Descripción completa

Detalles Bibliográficos
Autor: Loukanova, Roussanka
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
id ES_9cf6aa10efd2f162147fa5138b2f4caf
oai_identifier_str oai:gredos.usal.es:10366/160199
network_acronym_str ES
network_name_str España
repository_id_str
spelling Eta-Reduction in Type-Theory of Acyclic RecursionLoukanova, RoussankaalgorithmdenotationreductionWe 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.Ediciones Universidad de Salamanca (España)202420242023info:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10366/160199reponame:GREDOS. Repositorio Institucional de la Universidad de Salamancainstname:Universidad de Salamanca (USAL)info:eu-repo/semantics/openAccessoai:gredos.usal.es:10366/1601992026-06-07T06:28:51Z
dc.title.none.fl_str_mv Eta-Reduction in Type-Theory of Acyclic Recursion
title Eta-Reduction in Type-Theory of Acyclic Recursion
spellingShingle Eta-Reduction in Type-Theory of Acyclic Recursion
Loukanova, Roussanka
algorithm
denotation
reduction
title_short Eta-Reduction in Type-Theory of Acyclic Recursion
title_full Eta-Reduction in Type-Theory of Acyclic Recursion
title_fullStr Eta-Reduction in Type-Theory of Acyclic Recursion
title_full_unstemmed Eta-Reduction in Type-Theory of Acyclic Recursion
title_sort Eta-Reduction in Type-Theory of Acyclic Recursion
dc.creator.none.fl_str_mv Loukanova, Roussanka
author Loukanova, Roussanka
author_facet Loukanova, Roussanka
author_role author
dc.subject.none.fl_str_mv algorithm
denotation
reduction
topic algorithm
denotation
reduction
description 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.
publishDate 2023
dc.date.none.fl_str_mv 2023
2024
2024
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/10366/160199
url http://hdl.handle.net/10366/160199
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Ediciones Universidad de Salamanca (España)
publisher.none.fl_str_mv Ediciones Universidad de Salamanca (España)
dc.source.none.fl_str_mv reponame:GREDOS. Repositorio Institucional de la Universidad de Salamanca
instname:Universidad de Salamanca (USAL)
instname_str Universidad de Salamanca (USAL)
reponame_str GREDOS. Repositorio Institucional de la Universidad de Salamanca
collection GREDOS. Repositorio Institucional de la Universidad de Salamanca
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869414703052095488
score 15.811543

Similares en LA Referencia