[racket] coding with continuations

What do you mean by "hairy search problem"?
Because the answer might be "They don't apply."

George Rudolph
Associate Professor of Computer Science
Department of Mathematics and Computer Science
225 Thompson Hall
The Citadel
171 Moultrie Street
Charleston, SC 29409
843.953.5032



-----Original Message-----
From: users [mailto:users-bounces at racket-lang.org] On Behalf Of Hendrik Boom
Sent: Sunday, October 26, 2014 10:25 PM
To: users at racket-lang.org
Subject: [racket] coding with continuations

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