I've been sort of following Scheme since ages agoo when I read Guy Steele's masteer's thesis. I understand the concepts behind continuations. I understad some of the schemes by which they are implemented with multiple stacks, stack copying, or even Chey on the MTA.
What I don't understand is what kinds of coding patterns are effective when using them to do really hairy search problems. Can anyone give me pointers to intelligible presentations of this kind of informmation? I seen no point in reinventing wheels. -- hendrik ____________________ Racket Users list: http://lists.racket-lang.org/users
