Application wiich massively use exceptions

Application wiich massively use exceptions

[Frédéric Gava]

Dear Caml-list,

With my research teams, we are working on parallel exceptions in parallel
programs.

To have pratical examples, we are looking for an application which massively
use exceptions, i.e. use exceptions (many different ones if possible) to
propagate results/errors in an algorithm.

Would somebody have an idea of such an algorithm or such an application ?
Many thanks !

Best,
Frédéric Gava

Re: [Caml-list] Application wiich massively use exceptions

[Till Varoquaux]

First  things that comes to my mind is a prolog interpretor:
backtracking can be done via exceptions.

Cheers,

Till



On 10/25/06, Frédéric Gava <gava@univ-paris12.fr> wrote:
> Dear Caml-list,
>
> With my research teams, we are working on parallel exceptions in parallel
> programs.
>
> To have pratical examples, we are looking for an application which massively
> use exceptions, i.e. use exceptions (many different ones if possible) to
> propagate results/errors in an algorithm.
>
> Would somebody have an idea of such an algorithm or such an application ?
> Many thanks !
>
> Best,
> Frédéric Gava
>
> _______________________________________________
> Caml-list mailing list. Subscription management:
> http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
> Archives: http://caml.inria.fr
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs
>

Re: [Caml-list] Application wiich massively use exceptions

[Jon Harrop]

On Wednesday 25 October 2006 14:59, Frédéric Gava wrote:
> With my research teams, we are working on parallel exceptions in parallel
> programs.
>
> To have pratical examples, we are looking for an application which
> massively use exceptions, i.e. use exceptions (many different ones if
> possible) to propagate results/errors in an algorithm.
>
> Would somebody have an idea of such an algorithm or such an application ?
> Many thanks !

IIRC, you did the parallel Set implementation. You could dust that off and 
reuse it, implementing insertion of an already-present element into a set 
using an exception and applying it to the "n"th-nearest neighbours example 
from my book again.

-- 
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
Objective CAML for Scientists
http://www.ffconsultancy.com/products/ocaml_for_scientists