Newsgroups: comp.archives Path: utzoo!utgpu!news-server.csri.toronto.edu!ox.com!emv From: pjg@sunbim.be Subject: [sci.math] Summary of replies: Bignums, Rationals, Incremental Simplex and Gaussian Elimination Message-ID: <1991Feb27.051613.25637@ox.com> Followup-To: sci.math Sender: emv@ox.com (Edward Vielmetti) Reply-To: pjg@sunbim.be Organization: Dept. of Computer Science (K.U.Leuven) References: <2149@n-kulcs.cs.kuleuven.ac.be> Date: Wed, 27 Feb 1991 05:16:13 GMT Approved: emv@ox.com (Edward Vielmetti) X-Original-Newsgroups: sci.math Archive-name: symbolic-math/big-numbers/survey/1991-02-26 Original-posting-by: pjg@sunbim.be Original-subject: Summary of replies: Bignums, Rationals, Incremental Simplex and Gaussian Elimination Reposted-by: emv@ox.com (Edward Vielmetti) Hello, Here is a summary of the replies to my posting on Bignums, Rationals, Incremental Simplex and Gaussian Elimination. First I want to thanks all those of you who answered my posting, I.E.: Bruce Smith , Gordon Joly , Hans Boehm , Ian Rogers , Marios D. Dikaiakos , Mark Shand , Mat Watson , Mats Carlsson , Owen Thomas , Pentti JUHANI Jaakola , Peter Stuckey , Peter Thompson , Spiro.Michaylov@A.GP.CS.CMU.EDU, Tim Duncan , Torbjorn Granlund (tege@sics.se, tege@ai.mit.edu) , arndt@zyx.ZYX.SE (Arndt Jonasson), ath@linkoping.telesoft.se (Anders Thulin), bothner@sevenlayer.cs.wisc.edu (Per Bothner), brech@bernina.ethz.ch, ddean@rain.andrew.cmu.edu (Drew Dean), dirk@triton.cs.kuleuven.ac.be (Dirk Craeynest), emv@math.lsa.umich.edu (Edward Vielmetti), emv@ox.com (Ed Vielmetti), foo@rice.edu (Mark Hall), lavinus@csgrad.cs.vt.edu, mjs@hubcap.clemson.edu (m j saltzman), pardo@cs.washington.edu (David Keppel), pms@vicorp.com (Peter Shirley), ra@intsys.no (Robert Andersson), scorpion@rice.edu (Vernon Lee), sherlock!bert (Bertram N. Shure), steven@cwi.nl, vaughan%cadillac.cad.mcc.com@mcc.com (Paul Vaughan), wald@theory.lcs.mit.edu (David Wald), waleffe@prlb.philips.be Second, as many of you asked, I'll try to explain what we're doing. BIM is involved in an Esprit II Research and Development Project called Prince, in collaboration, among many others, with PrologIA. PrologIA is a French company located in Marseilles which markets Prolog-II+ and Prolog-III, (Alain Colmerauer, Michel Van Caneghem ao). BIM is a Belgian company located near Brussels which, besides many other hardware & software offers, develops and markets ProLog_by_BIM (Formerly known under the name BIM_Prolog). One of the goals of the Prince project is to develop a compiler for a Prolog-III style langage. Prolog-III is a Constraint Logic Programming language; the Prolog-III commercial product is currently interpreter-based. The purpose of my posting was to get feedback on the state of the art on the rational domain for CLP. The summary of the replies I received follows. Given the size of the answers I got (roughly 60 pages), extensive editing was required; I tried, though, to keep as much credit to the originators as possible. Any information is also given on a "as is" basis. Pierre-Joseph GAILLY E-Mail: pjg@sunbim.be B.I.M.-Zaventem Phone : + 32 2 759 59 25 (Bim general) Leuvensesteeweg 510, : + 32 2 719 26 11 (Bim Zaventem) B-1930 Zaventem Fax : + 32 2 725 47 83 Belgique / Belgium -------------------- Start of Summary -------------------- 1) Exact Arithmetic. 1.a) Available packages: * DEC/INRIA Bignum package has been strongly recommended by many people (I cannot quote all their names). This package is free for non commercial purposes. Here is additional info: Jean-Claude Herve (Digital Paris Research Laboratory, herve@decprl.dec.com) said in a previous posting to the net: > We have a package named bignum containing a library managing > big numbers of arbitrary length. This library has been > developped jointly by INRIA and Digital-PRL. The library is > running on U*ix, VMS, MSDOS.Assembler codes for vax, mips, > pyramid, NSC, 68000, i960 are available. The package is > distributed freely. > > To know more, you could order the PRL report #2: "Bignum: a > portable and efficient package for arbitrary-precision > arithmetic". > > The report is sent by postal mail (don't forget to send your > postal address). The package is sent by electronic mail. > > Send your orders to: librarian@prl.dec.com > > Jean-Claude Herve. > > Digital Paris Research Lab - 85 Av Victor Hugo - > 92500 Rueil Malmaison, FRANCE - > - Tel: +33 (1) 47 14 28 11 - Fax: +33 (1) 47 14 28 99 - > - herve@decprl.dec.com At present, the package is not available from anonymous FTP servers but it might change in the future. * Per Bothner (bothner@cs.wisc.edu Computer Sciences Dept, U. of Wisconsin-Madison) writes: > I have a set of C++ classes and routines that implement > generic arithmetic, including two's complement integers > (which gives compatibility with Common Lisp), fractions, > double floats, and complex numbers. It is by no means > "complete", but most of the non-trivial rational and > integer routines are implemented. > > The code is in sevenlayer.cs.wis.edu:pub/gennum.[Ch]. > Please let me know if you use this code, or improve it. * BSD mp Multiple Precision package; see the man entries on your local unix machine. * GNU mp (From Free Software foundation). This seems to be work in progress; further information will probably appear on the news sometimes. Torbjorn Granlund (tege@sics.se, tege@ai.mit.edu) is very busy working on that but he could probably provide additional info to those who cannot live without waiting. * ath@linkoping.telesoft.se (Anders Thulin) Writes: > I know of a this one: > > * MIRACL by ... (I've forgotten his name) in Dublin. Integer and > fractional multiple precision package in C. Comes with several routines > for factorization, prime number identification, encryption etc. I've > been using the version from C Users Group, but I have seen later > versions advertised in Byte for about 50 Irish pounds. > > * BMP by Brent. This is available from the mail server at > netlib@ornl.gov. Send a message containing 'send help' and you'll get > further information. * Several suggestions also for: ftp.math.lsa.umich.edu:/pub/kevin/arith.tar.Z for Kevin Coombes's arbitrary precision library. * Suggestions also for a standalone infinite-precision simulated desk calculator: > The calculator program is (or used to be) available by > anonymous ftp from titan.rice.edu in the files > public/C_calc.tar.Z and public/calc.instr. * Many symbolic computation packages (Maple, Macsyma, DOE-Macsyma, Pari, Mathematica) were also cited but these do not really fall within the scope of this request. If you want more info mail me. * Many programming languages include bignums and rationals, including ABC and Poplog. Again these do not fall within the scope of this request. In case it might help, here is some additional info: + Steven Pemberton, CWI, Amsterdam; steven@cwi.nl Writes: > ... The interactive programming language ABC has direct > support for unbounded-length rational numbers. ... > > Further information is available in the file abc.intro, > which is available by ftp from mcsun.eu.net [192.16.202.1] > in directory programming/languages/abc, or by email from > info-server@hp4nl.nluug.nl, by sending the message > > request programming/languages/abc > topic abc.intro + Ian Rogers