论文信息 - Lazy Functional Algorithms for Exact Real Functionals

Lazy Functional Algorithms for Exact Real Functionals

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.

Alex K. Simpson | A. Simpson

[1] erie M enissier-Morainy. Arbitrary Precision Real Arithmetic: Design and Algorithms , 1996 .

[2] Robert Cartwright,et al. Exact real arithmetic formulating real numbers as functions , 1990 .

[3] Jean Vuillemin. Exact Real Computer Arithmetic with Continued Fractions , 1990, IEEE Trans. Computers.

[4] Martín Hötzel Escardó,et al. PCF Extended with Real Numbers , 1996, Theor. Comput. Sci..

[5] Martín Hötzel Escardó,et al. Properly injective spaces and function spaces , 1998 .

[6] Ulrich Berger,et al. Total Sets and Objects in Domain Theory , 1993, Ann. Pure Appl. Log..

[7] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[8] Abbas Edalat,et al. Exact Real Computer Arithmetic , 1997 .

[9] Abbas Edalat,et al. Integration in Real PCF , 2000, Inf. Comput..

[10] Pietro Di Gianantonio. An Abstract Data Type for Real Numbers , 1999, Theor. Comput. Sci..

[11] Gordon D. Plotkin,et al. Full abstraction, totality and PCF , 1999, Mathematical Structures in Computer Science.

[12] Jean-Michel Muller,et al. Introduction to the Special Issue: "Real Numbers and Computers" , 1995, J. Univers. Comput. Sci..

[13] Hans-Juergen Boehm,et al. Exact real arithmetic: a case study in higher order programming , 1986, LFP '86.

[14] Ker-I Ko,et al. Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.