#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2007

2010

- This year (0)
- Last five years (0)

#### Publication Type

#### Publication Venue

#### Key Phrases

Learn More

- Thomas Anberrée
- Electr. Notes Theor. Comput. Sci.
- 2007

- Thomas Anberrée
- TAMC
- 2008

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)

- Thomas Anberrée
- 2007

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)

- Thomas Anberrée
- Mathematical Structures in Computer Science
- 2010

- Thomas Anberrée
- CiE
- 2009

- ‹
- 1
- ›