I already read the response concerning Peyton-Jones "Awkward Squad". Just a comment on
Chaitin's try. The "try" Lisp operator is basically a bounded Turing machine, i guess??
Regards, Bill Halchin
>From: Carl McTague
>To: haskell@haskell.org
>Subject: Chaitin's (try)
>Date: Thu, 30 Aug 2001 17:24:01 -0600
>
>Does anybody have an interest in something like Gregory Chaitin's
>function (try) from his custom lisp in Haskell? (Please see
>http://www.umcs.maine.edu/~chaitin/rov.html for more information.) It
>would be a function that attempts to evaluate its argument within a
>specified amount of cpu time, returning something like Maybe's Nothing
>(but perhaps more informative) in the case that time runs out, and
>something like Just, otherwise. Would that toy with referential
>transparency?
>
>Carl
>
>_______________________________________________
>Haskell mailing list
>Haskell@haskell.org
>http://www.haskell.org/mailman/listinfo/haskell