Eta-Reduction in Type-Theory of Acyclic Recursion

• Loukanova, Roussanka ^[1]
  1. [1] Institute of Mathematics and Informatics

     Institute of Mathematics and Informatics

     Bulgaria

     
• Localización: ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, ISSN-e 2255-2863, Vol. 12, Nº. 1, 2023
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

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