Summary: A Denotational Semantics for Total Correctness
of Sequential Exact Real Programs
Thomas Anberr´ee
Dr. Mart´in H¨otzel Escard´o
Supervisor
Dr. Alex Simpson
External Examiner
Dr. Steve Vickers
Internal Examiner
A thesis submitted to
The University of Birmingham
for the degree of
doctor of philosophy
School of Computer Science
The University of Birmingham
October 2007
Abstract
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

Source: Anberrée, Thomas - School of Computer Science, University of Nottingham Ningbo, China

Collections: Computer Technologies and Information Sciences