[plt-scheme] On continuations...

In that case, you should definitely consider the functional solution 
the best effort. It would be a literal translation of the mathematical 
"program" that specifies the solution and thus automatically comes with 
a correctness proof. The Python solution is an imperative kludge whose 
correctness not one Python programmer, including GvR, could argue. Even 
in the Scheme community, this problem only got attention with Talcott's 
thesis in 1986 and my own in 1987.

-- Matthias

P.S. If you come across a specification of the mathematical solution in 
math, could you please share with us? Most mathematicians dont really 
use higher-order functions much so there solution is typically much 
longer and I'd love to see what they do instead.

On Dec 19, 2004, at 11:56 AM, michael rice wrote:

>   For list-related administrative tasks:
>   http://list.cs.brown.edu/mailman/listinfo/plt-scheme
>
> Thanks for all the input on partitioning an integer.
> This adventure started with an entry from a book of
> problems for computer solution. I'd never heard of
> integer partitions before so I went out on the web and
> found an Icon solution (link partit from the Icon
> Library). Further exploring led me to the Python
> solution at:
> http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/218332
>
> I like to translate code from one language to another
> so I decided to try it in Scheme. I'd read about
> continuations and understood the short examples but
> always felt that real understanding comes with heavy
> usage. This problem required not only generators but
> generators within generators, a nice challenge.
>
> Well, on to Smalltalk. Has anyone heard of Croquet
> (http://www.opencroquet.org), a Smalltalk 3D
> collaborative graphical user interface?
>
>   --mr
>
>
>
> 		
> __________________________________
> Do you Yahoo!?
> Yahoo! Mail - Easier than ever with enhanced search. Learn more.
> http://info.mail.yahoo.com/mail_250
>