Contributed Papers Programming

Mathematical Foundations of Computer Science 1998

Volume 1450 of the series Lecture Notes in Computer Science pp 456-464


Lazy functional algorithms for exact real functionals

  • Alex K. SimpsonAffiliated withLFCS, Department of Computer Science, University of Edinburgh

* Final gross prices may vary according to local VAT.

Get Access


We show how functional languages can be used to write programs for real-valued functionals in exact real arithmetic. We concentrate on two useful functionals: definite integration, and the functional returning the maximum value of a continuous function over a closed interval. The algorithms are a practical application of a method, due to Berger, for computing quantifiers over streams. Correctness proofs for the algorithms make essential use of domain theory.