No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
3 Posted Topics
I have never heard “center nested recursion” and googling yields 0 (!) results, so I cannot tell you how to recognise one. But, you can transform [I]every[/I] recursive function into a tail-recursive one by manually passing the call stack as an argument. If this has any advantage depends on the …
From my first days with scheme… it’s not pretty but it works. Please ignore the markup, “divide-2” is just a function name and “d” just a variable. [CODE=scheme]; divides two numbers until cutoff is reached (define (divide n d cutoff) (let ((step 10)) ; any value >1 will work (define …
Afaik, the only way for that syntax would be using: [CODE=scheme](define_class class_name content1 ...)[/CODE] and then ckecking [icode](pair? (car content))[/icode] to distinguish them.
The End.