高阶递归抽象：如何让Ackermann、Knuth和Conway看起来像一堆原始体，形象地说
Higher-Order Recursion Abstraction: How to Make Ackermann, Knuth and Conway Look Like a Bunch of Primitives, Figuratively Speaking
摘要：
Ackermann函数是自然数上著名的全递归二元函数。这是一个典型的例子，这样的一个函数，不是原始递归，在经典递归理论的意义。然而，在表面上矛盾，有广义的概念，总递归，阿克曼函数实际上是原始递归，并经常作为一个证人的特点，额外的权力所获得的推广。在这里，我们调查的技术，发现和分析复杂的递归函数的原始形式，即也克努特和康威的箭头符号，特别是递归抽象，在功能程序转换的框架。
英文摘要：
The Ackermann function is a famous total recursive binary function on the natural numbers. It is the archetypal example of such a function that is not primitive recursive, in the sense of classical recursion theory. However, and in seeming contradiction, there are generalized notions of total recursion, for which the Ackermann function is in fact primitive recursive, and often featured as a witness for the additional power gained by the generalization. Here, we investigate techniques for finding and analyzing the primitive form of complicated recursive functions, namely also Knuth's and Conway's arrow notations, in particular by recursion abstraction, in a framework of functional program transformation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
