Thomas Anberrée

Learn More
We provide a denotational model for a functional programming language for exact real number computation. A well known difficulty in real number computation is that the tests x = y and x ≤ y are undecidable and hence cannot be used to control the execution flow of programs. One solution, proposed by Boehm and Cartwright, is to use a non-deterministic test.(More)
Real PCF is a higher type language for exact real number computation introduced by Martín Escardó [1]. It is universal, in the sense that it can define all computable functions over the reals, at all types. But, in place of the usual, sequential if operator, it includes a parallel conditional satisfying pif true then x else y = x, pif false then x else y =(More)
  • 1