Abstract
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.
Publisher
Ediciones Universidad de Salamanca
Subject
Information Systems,Computer Science Applications,Computer Networks and Communications,Artificial Intelligence
Reference25 articles.
1. If structured propositions are logical procedures then how are procedures individuated?
2. Duží, M. and Kosterec, M., 2017. A Valid Rule of β-conversion for the Logic of Partial Functions. Organon F, 24(1):10–36.
3. Procedural isomorphism, analytic information and -conversion by value
4. Gallin, D., 1975. Intensional and Higher-Order Modal Logic: With Applications to Montague Semantics. North-Holland Publishing Company, Amsterdam and Oxford, and American Elsevier Publishing Company. ISBN 0 7204 0360 X.
5. Russellian and Strawsonian Definite Descriptions in Situation Semantics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献