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)
  • 1