From coinductive proofs to exact real arithmetic: theory and applications

Details From coinductive proofs to exact real arithmetic: theory and applications From coinductive proofs to exact real arithmetic: theory and applications

2011-01-11

arxiv.org/abs/1101.2162v3

LMCS 7 (1:8) 2011

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-7(1:8)2011

Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with respect to the binary signed digit representation of real numbers. The data type corresponding to the coinductive definition of continuous functions consists of finitely branching non-wellfounded trees describing when the algorithm writes and reads digits. We discuss several examples including the extraction of programs for polynomials up to degree two and the definite integral of continuous maps.

Affiliated with

Also associated with

No associations

Rating

From coinductive proofs to exact real arithmetic: theory and applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with From coinductive proofs to exact real arithmetic: theory and applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From coinductive proofs to exact real arithmetic: theory and applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-160870