Chaitin's (try)

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