Results 1 - 10 of 195

Kawa|compiling dynamic languages to the Java VM

by Per Bothner - In Proceedings of the USENIX Technical Conference, FREENIX Track , 1998
"... Many are interested in Java for its portable bytecodes and extensive libraries, but prefer a different language, especially for scripting. People have implemented other languages using an interpreter (which is slow), or by translating into Java source (with poor responsiveness for eval). Kawa uses a ..."
Abstract - Cited by 13 (0 self) - Add to MetaCart
the full “numeric tower”, with complex numbers, exact infinite-precision rational arithmetic, and units. A number of extensions provide access to Java primitives, and some Java methods provide convenient access to Scheme. Since all Java objects are Scheme values and vice versa, this makes for a very

Kawa - Compiling Dynamic Languages to the Java VM

by Per Bothner Cygnus , 1998
"... Many are interested in Java for its portable bytecodes and extensive libraries, but prefer a different language, especially for scripting. People have implemented other languages using an interpreter (which is slowed), or by translating into Java source (with poor responsiveness for eval). Kawa uses ..."
Abstract - Add to MetaCart
objectoriented style. It includes the full "numeric tower", with complex numbers, exact infinite-precision rational arithmetic, and units. A number of extensions provide access to Java primitives, and some Java methods provide convenient access to Scheme. Since all Java objects are Scheme values

An exact arithmetic package for ML

by Valérie Menissier-Morain, Pierre Weis, Inria Rocquencourt
"... We present the design and implementation of an exact rational arithmetic package for the programming language Caml, an ML dialect close to the original LCF-ML. Our arithmetic, written almost entirely in Caml, combines efficiency, power and flexibility. For efficiency reasons, the package provides se ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We present the design and implementation of an exact rational arithmetic package for the programming language Caml, an ML dialect close to the original LCF-ML. Our arithmetic, written almost entirely in Caml, combines efficiency, power and flexibility. For efficiency reasons, the package provides

Exact Arithmetic on the Stern-Brocot Tree

by Milad Niqui - NIJMEEGS INSTITUUT VOOR INFORMATICA EN INFORMATEIKUNDE, 2003. HTTP://WWW.CS.RU.NL/RESEARCH/REPORTS/FULL/NIII-R0325.PDF , 2003
"... In this paper we present the Stern{Brocot tree as a basis for performing exact arithmetic on rational and real numbers. We introduce the tree and mention its relation with continued fractions. Based on the tree we present a binary representation of rational numbers and investigate various algorithms ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
In this paper we present the Stern{Brocot tree as a basis for performing exact arithmetic on rational and real numbers. We introduce the tree and mention its relation with continued fractions. Based on the tree we present a binary representation of rational numbers and investigate various

Exact Modular Arithmetic With Single Precision

by Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion , 1997
"... Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the critical operation when using real algebraic numbers and exact geometric predicates. We propose an exact and efficient method that determines the sign of a multivariate polynomial expression with ratio ..."
Abstract - Add to MetaCart
with rational coefficients. Exactness is achieved by using modular computation. Although this usually requires some multiprecision computation, our novel technique of recursive relaxation of the moduli enables us to carry out sign determination and comparisons by using only single precision. Moreover

THE CLASS LIBRARY FOR EXACT RATIONAL ARITHMETIC IN ARI\Theta MO\Sigma

by unknown authors
"... Abstract ARI\Theta MO\Sigma consists of a family of class libraries (fully IEEE compliant multiprecision floating-point, sharp multiprecision floating-point interval and exact rational arithmetic in V1.0, floating-slash, rational interval and complex arithmetic in V2.0) that are available at program ..."
Abstract - Add to MetaCart
Abstract ARI\Theta MO\Sigma consists of a family of class libraries (fully IEEE compliant multiprecision floating-point, sharp multiprecision floating-point interval and exact rational arithmetic in V1.0, floating-slash, rational interval and complex arithmetic in V2.0) that are available

Integer and Rational Arithmetic on MasPar

by Tudor Jebelean - In DISCO'96 , 1996
"... . The speed of integer and rational arithmetic increases significantly by systolic implementation on a SIMD architecture. For multiplication of integers one obtains linear speed-up (up to 29 times), using a serial--parallel scheme. A two-dimensional algorithm for multiplication of polynomials gives ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
half-linear speed-up (up to 383 times). We also implement multiprecision rational arithmetic using known systolic algorithms for addition and multiplication, as well as recent algorithms for exact division and GCD computation. All algorithms work in "least-significant digits first" pipelined

Type classes for efficient exact real arithmetic

by Robbert Krebbers, Bas Spitters - IN COQ. CORR ABS/1106.3448 , 2011
"... Floating point operations are fast, but require continuous effort by the user to ensure correctness. This burden can be shifted to the machine by providing a library of exact analysis in which the computer handles the error estimates. Previously, we provided a fast implementation of the exact real ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
Floating point operations are fast, but require continuous effort by the user to ensure correctness. This burden can be shifted to the machine by providing a library of exact analysis in which the computer handles the error estimates. Previously, we provided a fast implementation of the exact real

Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic

by Zhenyu Li, Victor Milenkovic - Algorithmica , 1992
"... One useful generalization of the convex hull of a set S of n points is the ffl-strongly convex ffi-hull. It is defined to be a convex polygon P with vertices taken from S such that no point in S lies farther than ffi outside P and such that even if the vertices of P are perturbed by as much as ffl, ..."
Abstract - Cited by 29 (5 self) - Add to MetaCart
, P remains convex. It was an open question 1 as to whether an ffl-strongly convex O(ffl)-hull existed for all positive ffl. We give here an O(n log n) algorithm for constructing it (which thus proves its existence). This algorithm uses exact rational arithmetic. We also show how to construct an ffl

Computation with the Extended Rational Numbers and an Application to Interval Arithmetic

by Richard J. Fateman, Tak W. Yan , 1994
"... Programming languages such as Common Lisp, and virtually every computer algebra system (CAS), support exact arbitrary-precision integer arithmetic as well as exact rational number computation. Several CAS include interval arithmetic directly, but not in the extended form indicated here. We explain w ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Programming languages such as Common Lisp, and virtually every computer algebra system (CAS), support exact arbitrary-precision integer arithmetic as well as exact rational number computation. Several CAS include interval arithmetic directly, but not in the extended form indicated here. We explain
Results 1 - 10 of 195