I'm trying to find a scheme to translate a functional language with let rec into a set of primitives called generalized arrows, i.e. $\kappa$-calculus with extensions. The problem is that general recursion is not expressible in $\kappa$-calculus, so I had to extend it with minimization operator.There is a previous question asking about translation of Ackerman function into $\mu$-recursive operators, but the solution of Klaus Draeger doesn't seem to me to be generalizable.Is there any previous work on translating general recursion into a set of $\mu$-recursive operator applications?
How to translate general recursion into a set of $\mu$-recursive operator applications?
lo.logic;computability;type theory;lambda calculus