CMU-CS-01-141Computer Science Department School of Computer Science, Carnegie Mellon University
CMU-CS-01-141
Aleksandar Nanevski, Guy Blelloch, Robert Harper June 2001
CMU-CS-01-141.ps
Keywords: Robust predicates, floating-point filters,
exact arithmetic, program transformation, computational
geometry, PSciGo project
We extend Shewchuk's method to arbitrary polynomial expressions. The expressions are given as programs in a suitable source language featuring basic arithmetic operations of addition, subtraction, multiplication and squaring, which are to be perceived by the programmer as exact. The source language also allows for anonymous functions, and thus enables the common functional programming technique of staging. The method is presented formally through several judgments that govern the compilation of the source expression into target code, which is then easily transformed into SML or, in case of single-stage expressions, into C. 28 pages
| |

Return to:
SCS Technical Report Collection This page maintained by reports@cs.cmu.edu |