Speaker
Nikolay Shilov
(Innopolis University)
Description
The problem of recursion elimination is a broad topic, including purely mathematical as well as practical formulations. Mathematical formulation may be presented as follows: What are decidable sufficient conditions to find a primitive recursive function that is equivalent to a given recursive function. A practical formulation, for instance, may be presented as follows: what are syntactic conditions for functional programs that are sufficient for implementation of recursion via iteration with static memory. In the talk I will provide an overview of known results in this direction and present some new results.
