Is Escardó's metric semantic for PCF+timeouts fully abstract ? In his 1999 workshop paper "A Metric Model of PCF", Mart&iacute;n Escard&oacute;  showed that it is possible to give a simple interpretation of PCF in the category of complete ultrametric spaces and nonexpansive maps. 

He showed this model was adequate, and that it could model the addition of a timeout construct (i.e., an operator which would run its argument for some finite number of steps, and either yield an answer or signal an error if it failed to terminate within the time limit). He then suggested that it would be natural to investigate whether the metric model was fully abstract with respect to PCF+timeouts. 


Has anyone investigated this, and if so, what's the answer?
Does PCF+timeouts realize the same functions as Turing machines, including at higher type?


(As an aside, how do you put accents into the text? I've dropped an accent from both  his first and last names. EDIT: Name fixed. I'm leaving this parenthetical in so that the comments to the post continue to make sense.)
Regarding your second question, I seem to remember that for higher-order types the question was linked closely to whether PCF+timeout was equivalent to Type Two Effectivity (Turing machines with infinite inputs and outpus), i.e., Kleene's second partial combinatory algebra. John Longley claimed for a while that Kleene's second algebra was equivalent to PCF+timeout+catch, but in the end he never published a detailed result.

On the other hand, I am pretty sure that John Longley opus magnum "On the ubiquity of certain total type structures" (Mathematical Structures in Computer Science 17(5) (2007), 841--953) implies that the higher-order functionals definable in PCF+timeout are precisely the hereditarily effective ones.