*Result*: Type-Theory of Algorithms with Chain-Free Memory and Iterative Computations.
*Further Information*
*I introduce an extended version of the Type-Theory of Acyclic Recursion and Acyclic Algorithms (TTAR / TTAA) and its reduction calculi, by adding an extended chain-reduction rule. TTAA provides specialized recursion terms for stepwise, mutually recursive computations. The results of the recursive computations are saved in memory slots, according to assignments, and can be reused, by accessing the corresponding memory slots. The chain-like assignments copy values of terms from one memory slot to another, without any other essential algorithmic steps. The extended reduction calculus eliminates repeated, chainlike assignments of copies of functional values in memory slots. The primary applications of the chain-free type theory of recursion are for algorithmic semantics of formal and natural languages, including of programming languages and parts of compilers that transform recursive programs into iterative ones. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Applied Logics- IfCoLog Journal of Logics & their Applications (FLAP) is the property of College Publications and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)*