1. Mutual recursionIn mathematics and computer science, mutual recursion is a form of recursion where two mathematical or computational functions are defined in terms of each other. In mathematics, the Hofstadter Female and Male sequences are an example of a pair of integer sequences defined in a mutually recursive manner. Mutual recursion is very common in the functional programming style, and is often used for programs written in LISP, Scheme, ML, and similar languages.
Read “Mutual recursion” on English Wikipedia
Read “相互再帰” on Japanese Wikipedia
Read “Mutual recursion” on DBpedia
Read “Mutual recursion” on English Wikipedia
Read “相互再帰” on Japanese Wikipedia
Read “Mutual recursion” on DBpedia
Discussions
Log in to talk about this word.