Talk:Recurl

Interesting. However, I don't think "Set" is the best description of the data structure. Normal sets are unordered and cannot contain more than one of the same element, making these data structures more like lists or arrays. Another difference between these and traditional sets is how they contain others of their type. Normal sets can have a set (or more) as an element, which can be tested for membership, etc. as normal. Your structures seem to recursively include all elements of any included arrays, creating confusingly infinite lists when they include themselves. Consider renaming. —Maharba 17:57, 22 June 2011 (UTC)

Would "List" do? 71.63.79.112 14:10, 23 June 2011 (UTC)


 * Sure. A list is usually ordered and allows multiple elements with the same value. It is also a generic enough term that the weird recursive inclusion of sublists won't confuse people too much. You'll also need to think of a better name for your esolang, since "List" doesn't have much ring to it, and "Lisp" (LISt Processing) is already taken. What about "Recurl" for "RECURsive Lists"? Just an idea. —Maharba 17:21, 23 June 2011 (UTC)

Aren't the 0 and the 1 inverted in the examples for conditional statements? If not then it probably needs some clarifications. conditional statement, only do the code in the brackets if the first number in A is >0 A?1<...> inverted conditional, do the code if the sum of all numbers in A is <1 A!0<...> --Koen (talk) 17:11, 27 September 2012 (UTC)