query: Recursive function in lisp goes wrong
positive_passages.docid: 145469
positive_passages.text: In Common Lisp, why do multi-expression bodies of (if) statements require (progn)?
negative_passages.docid: 115412
negative_passages.text: Why does this function fail when a non-function version of the same code works?
negative_passages.docid: 135066
negative_passages.text: How do the authors deduce this weaker version of Transfinite Recursion?
negative_passages.docid: 131774
negative_passages.text: get a recursive parent list
negative_passages.docid: 135542
negative_passages.text: take a char and print out from char to 'a' and reverse it should be recursive
negative_passages.docid: 57036
negative_passages.text: find not recursive when given a pattern on the command line
negative_passages.docid: 73206
negative_passages.text: recursion-consecutive numbers
negative_passages.docid: 125542
negative_passages.text: Function behaves differently inside a package than outside
negative_passages.docid: 102450
negative_passages.text: Are nested functions a bad thing in gcc ?
negative_passages.docid: 3752
negative_passages.text: Dynamic and Lexical variables in Common Lisp
negative_passages.docid: 10665
negative_passages.text: What is tail recursion?
negative_passages.docid: 99172
negative_passages.text: List extending strange behaviour
negative_passages.docid: 112290
negative_passages.text: Weird behavior of & function in Set
negative_passages.docid: 38056
negative_passages.text: Reversing a linked list in Java, recursively
negative_passages.docid: 124280
negative_passages.text: Test if array is inside a list in lisp
negative_passages.docid: 123433
negative_passages.text: Why aren't my include guards preventing recursive inclusion and multiple symbol definitions?
negative_passages.docid: 94164
negative_passages.text: Can every recursion be converted into iteration?