Walther recursion

In computer programming, Walther recursion (named after Christoph Walther) is a method of analysing recursive functions that can determine if the function is definitely terminating, given finite inputs. It allows a more natural style of expressing computation than simply using primitive recursive functions.

Since the halting problem cannot be solved in general, there must still be programs that terminate, but which Walther recursion cannot prove to terminate. Walther recursion may be used in total functional languages in order to allow a more liberal style of showing primitive recursion.

## See also

* BlooP and FlooP
* Termination analysis
* Total Turing machine

## References

* Walther, Christoph (1991). "On Proving the Termination of Algorithms by Machine". Artificial Intelligence 70 (1). doi:10.1016/0004-3702(94)90063-9. https://www.researchgate.net/profile/Christoph-Walther/publication/220545855_On_Proving_the_Termination_of_Algorithms_by_Machine/links/5a974a8eaca27214056b3bf4/On-Proving-the-Termination-of-Algorithms-by-Machine.pdf.
* Wu, Alexander (1994). Automated termination proofs using Walther recursion (Thesis). Massachusetts Institute of Technology. Retrieved 2014-09-15.
* McRobbie, Michael A., ed (1996). "Walther recursion". 13th International Conference on Automated Deduction (CADE-13). 1104. New Brunswick, NJ, USA: Springer-Verlag. pp. 643–657. doi:10.1007/3-540-61511-3_119. ISBN 3-540-61511-3. http://ttic.uchicago.edu/~dmcallester/walther.ps.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Walther recursion. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Walther_recursion&oldid=231401"