Re: Mneson announcement and help request

[Marius Amado Alves <amado.alves@netcabo.pt>]

Ok, so the secret formula is:

   cost(exception check) < cost(condition check) < cost(raising)

And of course which idiom is best for algorithm A depends on the nature 
and casuistics of A. Finding the critical algorithms and determining 
these properties for each one is the hard work now.

In the ASCLWG discussion I didn't intend to demonstrate past the case at 
hand then, namely the first two costs above. Maybe I was blissfully 
ignorant of the third.

Now I'll have one more hint next time I find some Mneson function slow.

Thanks for the byte :-)