Looking for an example of a typical tree-recursion turned into a tail-recursive form.

Posted by Skeptic on Stack Overflow See other posts from Stack Overflow or by Skeptic
Published on 2010-04-22T14:09:50Z Indexed on 2010/04/22 14:13 UTC
Read the original article Hit count: 221

Filed under:

Scheme

|

tail-recursion

Anything like flatten, count-atoms, etc. over nested lists would do fine.

BTW, I'm not interested in a CPS transformation or "pairs-trees".

© Stack Overflow or respective owner

Related posts about Scheme

About "If.." in Scheme (plt-scheme)

as seen on Stack Overflow - Search for 'Stack Overflow'
I had a pretty simple requirement in my Scheme program to execute more than one statement, in the true condition of a 'if'. . So I write my code, something like this: (if (= 1 1) ((expression1) (expression2)) ; these 2 expressions are to be executed when the condition is true (expression3)… >>> More
Detecting EOF in a Binary File using Scheme

as seen on Stack Overflow - Search for 'Stack Overflow'
(define (read-all-input) (local ((define line (bytes->list (read-bytes 4)))) (if (eof-object? line) empty (cons line (read-all-input))))) (void (read-all-input)) The above code fails because bytes-list expects an argument of type byte string, but is given # >>> More
Scheme: Detecting duplicate elements in a list

as seen on Stack Overflow - Search for 'Stack Overflow'
Does R6RS or Chez Scheme v7.9.4 have a library function to check if a list contains duplicate elements? Alternatively, do either have any built in functionality for sets (which dis-allow duplicate elements)? So far, I've only been able to find an example here. The problem with that is that it doesn't… >>> More
Traversing Scheme function as a list

as seen on Stack Overflow - Search for 'Stack Overflow'
Isn't it possible to treat functions in Scheme as any other list? Basically, what I want do to is something like this: (define (foo) "hello") (cdr foo) ; or similar, should return the list ((foo) "hello") I've found a similar discussion about this, and I feel a bit disappointed if this is not… >>> More
Scheme implementations - what does it mean?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I'm a beginning student in CS, and my classes are mostly in Java. I'm currently going through "Little Schemer" as a self study, and in the process of finding out how to do that I have found numerous references to "implementations" of Scheme. My question is, what are implementations? Are they… >>> More

Related posts about tail-recursion

Tail recursion in C++

as seen on Stack Overflow - Search for 'Stack Overflow'
Can someone show me a simple tail-recursive function in C++? Why is tail recursion better, if it even is? What other kinds of recursion are there besides tail recursion? >>> More
Tail recursion in Erlang

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I am really struggling to understand tail recursion in Erlang. I have the following eunit test: db_write_many_test() -> Db = db:new(), Db1 = db:write(francesco, london, Db), Db2 = db:write(lelle, stockholm, Db1), ?assertEqual([{lelle, stockholm},{francesco, london}], Db2)… >>> More
tail recursion vs. forward recursion

as seen on Stack Overflow - Search for 'Stack Overflow'
Can someone give me the difference between these two kinds recursions and example? specifically in ocaml. Thanks >>> More
Javascript tail recursion

as seen on Stack Overflow - Search for 'Stack Overflow'
Why the following code runs so.... slow....... ? <html><body><script type="text/javascript"> var i = 0; f(); function f() { if (i == 5000) { document.write("Done"); } else { i++; tail(); } } function… >>> More
Help me to refactor this F# code to tail recursion

as seen on Stack Overflow - Search for 'Stack Overflow'
I write some code to learning F#. Here is a example: let nextPrime list= let rec loop n= match n with | _ when (list |> List.filter (fun x -> x <= ( n |> double |> sqrt |> int)) |> List.forall (fun x -> n % x <> 0)) -> n | _ -> loop… >>> More