Septembre 2014 - Gambit-list - mailman.iro.umontreal.ca

Gambit versus Python+GMP: Timing for Chudnovskys' algorithm for pi
by Bradley Lucier 07 Avr '22

07 Avr '22

Bakul Shah wrote a particularly elegant Scheme program for Chudnovskys' algorithm for pi based on the Common Lisp program here: https://bitbucket.org/tarballs_are_good/numericl/src/5fe8fe7089f48ab1c8a388… Nick Craig-Wood wrote a Python program using the GMP multiprecision library that appears to use exactly the same algorithm here: http://www.craig-wood.com/nick/articles/pi-chudnovsky/ I modified both programs a bit and include them here. They time the calculation of $10^n$ digits of pi for $n=1,2,3,4,5,6,7$. The results are heine:~/programs/gambiteer/gambit> !py python pi_chudnovsky_bs_gmpy.py 31415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679 ('chudnovsky_gmpy_mpz_bs: digits', 10, 'time', 1.0967254638671875e-05) ('chudnovsky_gmpy_mpz_bs: digits', 100, 'time', 3.0040740966796875e-05) Last 5 digits 70679 OK ('chudnovsky_gmpy_mpz_bs: digits', 1000, 'time', 0.00025582313537597656) Last 5 digits 01989 OK ('chudnovsky_gmpy_mpz_bs: digits', 10000, 'time', 0.00386810302734375) Last 5 digits 75678 OK ('chudnovsky_gmpy_mpz_bs: digits', 100000, 'time', 0.0834801197052002) Last 5 digits 24646 OK ('chudnovsky_gmpy_mpz_bs: digits', 1000000, 'time', 1.655979871749878) Last 5 digits 58151 OK ('chudnovsky_gmpy_mpz_bs: digits', 10000000, 'time', 30.67442488670349) Last 5 digits 55897 OK heine:~/programs/gambiteer/gambit> gsi chud1.scm Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 10, CPU time: 0.. Last 5 digits 26535. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 100, CPU time: 0.. Last 5 digits 70679. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 1000, CPU time: .004. Last 5 digits 1989. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 10000, CPU time: .028. Last 5 digits 75678. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 100000, CPU time: .472. Last 5 digits 24646. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 1000000, CPU time: 6.448. Last 5 digits 58151. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 10000000, CPU time: 98.612. Last 5 digits 55897. So it appears that for this algorithm applied to large integers, GMP's bignum routines are about 3-4 times as fast as Gambit's bignum routines. Not so bad. For smaller bignums, GMP has a bigger advantage. The C program gmp-chudnovsky.c includes certain optimizations to this basic algorithm: http://gmplib.org/pi-with-gmp.html ftp://ftp.gmplib.org/pub/misc/gmp-chudnovsky.c On my machine, compiled with gcc -O3 -march=native -o gmp-chudnovsky gmp-chudnovsky.c -lgmp -lm the CPU times for 1,000,000 and 10,000,000 digits are 1.064 and 18.200 seconds, respectively. This is with a somewhat older machine model name : Intel(R) Core(TM)2 Quad CPU Q8200 @ 2.33GHz running Ubuntu 13.04 with heine:~/programs/gambiteer/gambit> gcc -v Using built-in specs. COLLECT_GCC=gcc COLLECT_LTO_WRAPPER=/usr/lib/gcc/x86_64-linux-gnu/4.7/lto-wrapper Target: x86_64-linux-gnu Configured with: ../src/configure -v --with-pkgversion='Ubuntu/Linaro 4.7.3-1ubuntu1' --with-bugurl=file:///usr/share/doc/gcc-4.7/README.Bugs --enable-languages=c,c++,go,fortran,objc,obj-c++ --prefix=/usr --program-suffix=-4.7 --enable-shared --enable-linker-build-id --libexecdir=/usr/lib --without-included-gettext --enable-threads=posix --with-gxx-include-dir=/usr/include/c++/4.7 --libdir=/usr/lib --enable-nls --with-sysroot=/ --enable-clocale=gnu --enable-libstdcxx-debug --enable-libstdcxx-time=yes --enable-gnu-unique-object --enable-plugin --with-system-zlib --enable-objc-gc --with-cloog --enable-cloog-backend=ppl --disable-cloog-version-check --disable-ppl-version-check --enable-multiarch --disable-werror --with-arch-32=i686 --with-abi=m64 --with-multilib-list=m32,m64,mx32 --with-tune=generic --enable-checking=release --build=x86_64-linux-gnu --host=x86_64-linux-gnu --target=x86_64-linux-gnu Thread model: posix gcc version 4.7.3 (Ubuntu/Linaro 4.7.3-1ubuntu1) heine:~/programs/gambiteer/gambit> gsi -v v4.6.9 20130607151908 x86_64-unknown-linux-gnu "./configure '--enable-single-host' '--enable-multiple-versions' '--enable-shared'" and the Ubuntu-provided GMP 5.0.5. (I'm sure the GMP folks have a better way to build GMP on my machine than the "generic" 64-bit version provided by Ubuntu.) Brad

7 18

object->u8vector as tree shaker?
by Bradley Lucier 29 Mar '15

29 Mar '15

Marc: It's not quite clear to me what object->u8vector does with procedures. I was thinking that if it pulled in all the functions not in system libraries, then it could be used as a tree-shaker. This is only a vague thought, but I find its interesting. Brad

3 6

JFP Special Issue on Parallel and Concurrent Programming
by Robby Findler 27 Sep '14

27 Sep '14

If you're working on parallel or concurrent programming, consider submitting! Robby ------------------------------------------------------------------------------ CALL FOR PAPERS JFP Special Issue on Parallel and Concurrent Programming Submission Deadline: 22 December 2014 Expected Publication Date: November/December issue 2015 * Scope Functional languages are uniquely suited to provide programmers with a programming model for parallel and concurrent computing. This is reflected in the wide range of work that is currently underway, both on parallel and concurrent functional languages, but also on bringing functional language features to other programming languages. This has resulted in a rapidly growing number of practical applications. The Journal of Functional Programming will devote a special issue to functional programming for concurrent and parallel computing. The purpose of this special issue is to showcase the state of the art on how functional languages and functional concepts currently assist programmers with the task of managing the challenges of creating parallel and concurrent systems. Language designers as well as systems builders and application programmers are invited to submit papers describing the current state of the art of language support and experiences with functional programming in building real-world systems. We encourage the submission of consolidated, condensed and extended work based on prior conference and workshop publications. * Submission Details Manuscripts should be submitted to CUP's Manuscript Central formatted according to JFP's standards. Authors should specify in their cover message that the paper is intended for the special issue and choose the appropriate desired editor from the menu. For submission and formatting details, please consult the Journal of Functional Programming [ http://bit.ly/jfpadvice ] website. Guest Editors --------------------------------------------------------------------------------- Gabriele Keller Fritz Henglein keller @cse.unsw.edu.au henglein(a)diku.dk School of Computer Science & Engineering Department of Computer Science (DIKU) UNSW Sydney NSW 2052 University of Copenhagen and Universitetsparken 5 The Software Systems Research Group@ NICTA DK-2100 Copenhagen Australia Denmark ---------------------------------------------------------------------------------

1 0

A |table-for-each| /whose traversal continuation is/ wrapped in a closure
by Mikael 22 Sep '14

22 Sep '14

Dear Marc, A |table-for-each| whose traversal continuation is wrapped in a closure would be much needed! Actually, this could be delivered by a |table-for-each| that is wrapped completely into a closure i.e. (table-enumerator table) => a procedure either returning a pair (key . value), or #f = reached table's end. Preferably this should implemented as part of Gambit itself, as the hashtables functionality is Gambit-internal. The reason for the need is that sometimes you need to be able to return at dynamic points within a table traversal in the same fashion as you can in an ordinary Scheme loop. It's easy to traverse a list or a vector in this fashion using |car|/|cdr| and |vector-ref| , however for tables right now there's no way to do the same but all that is locked into |for-each|'s semanstics which is incredibly limited as long as you don't work around it using |call/cc| , which is really unnecessary - so, |table-enumerator| implementation time? :D Reflections? Thanks, Mikael

1 0

Automatic build of new commits and pull-requests
by Marc Feeley 18 Sep '14

18 Sep '14

Hello. I have setup the Gambit github repo so that on every new commit and pull-request the whole system will be built on travis-ci.com . The result of the latest build will be shown on the main github repo page. That way it will be easy to see if any issues are present. For a detailed view of the builds, check the page: https://travis-ci.org/feeley/gambit/builds Marc

1 0

[ANN] *Extended Deadline* CFP for 2014 Scheme and Functional Programming Workshop
by Jason Hemann 03 Sep '14

03 Sep '14

The paper submission deadline has been extended one week, to Friday, Sept. 12 23:59 (UTC-12). [Apologies for duplication from cross-postings.] NEW DEADLINE: 12 September 2014, 23:59 (UTC-12) WEBSITE: http://homes.soic.indiana.edu/jhemann/scheme-14/ LOCATION: Washington, DC (co-located with Clojure/conj) DATE: 19 November 2014 The 2014 Scheme and Functional Programming Workshop is calling for submissions. Submissions related to Scheme and functional programming are welcome and encouraged. Topics of interest include but are not limiteThe paper submission deadline has been extended one week, to Friday, Sept. 12 23:59 (UTC-12). [Apologies for duplication from cross-postings.] NEW DEADLINE: 12 September 2014, 23:59 (UTC-12) WEBSITE: http://homes.soic.indiana.edu/jhemann/scheme-14/ LOCATION: Washington, DC (co-located with Clojure/conj) DATE: 19 November 2014 The 2014 Scheme and Functional Programming Workshop is calling for submissions. Submissions related to Scheme and functional programming are welcome and encouraged. Topics of interest include but are not limited to: - Program-development environments, debugging, testing - Implementation (interpreters, compilers, tools, benchmarks, etc) - Syntax, macros, and hygiene - Distributed computing, concurrency, parallelism - Interoperability with other languages, FFIs - Continuations, modules, object systems, types - Theory, formal semantics, correctness - History, evolution and standardization of Scheme - Applications, experience and industrial uses of Scheme - Education - Scheme pearls (elegant, instructive uses of Scheme) We also welcome papers related to dynamic or multiparadigmatic languages and programming techniques. Full papers are due 12 September 2014. Authors will be notified by 10 October 2014. Camera-ready versions are due 24 October 2014. All deadlines are 23:59 (UTC-12, "Anywhere on Earth"). For more information, please see: http://homes.soic.indiana.edu/jhemann/scheme-14/ Jason Hemann Organizer, Scheme '14 d to: - Program-development environments, debugging, testing - Implementation (interpreters, compilers, tools, benchmarks, etc) - Syntax, macros, and hygiene - Distributed computing, concurrency, parallelism - Interoperability with other languages, FFIs - Continuations, modules, object systems, types - Theory, formal semantics, correctness - History, evolution and standardization of Scheme - Applications, experience and industrial uses of Scheme - Education - Scheme pearls (elegant, instructive uses of Scheme) We also welcome papers related to dynamic or multiparadigmatic languages and programming techniques. Full papers are due 12 September 2014. Authors will be notified by 10 October 2014. Camera-ready versions are due 24 October 2014. All deadlines are 23:59 (UTC-12, "Anywhere on Earth"). For more information, please see: http://homes.soic.indiana.edu/jhemann/scheme-14/ Jason Hemann Organizer, Scheme '14

1 0

Flat Namespace on OSX/iOS
by Álvaro Castro-Castilla 02 Sep '14

02 Sep '14

Hi, As can be seen in makefiles, the options -flat_namespace and -undefined suppress are forced in the build. Apparently, these options cause some trouble in certain situations (see this https://lists.macosforge.org/pipermail/macports-dev/2008-October/006266.html ) Do we need these options in the Gambit build or should we thing about removing them? Best regards, Álvaro

1 0

Third call for papers, IFL 2014
by publicityifl＠gmail.com 02 Sep '14

02 Sep '14

Hello, Please, find below the third call for papers for IFL 2014. The submission page is now open. The submission date has been delayed to Sep. 8 2014 anywhere on the world. Please forward these to anyone you think may be interested. Apologies for any duplicates you may receive. best regards, Jurriaan Hage --- CALL FOR PAPERS 26th SYMPOSIUM ON IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES - IFL 2014 NORTHEASTERN UNIVERSITY/BOSTON, USA OCTOBER 1-3, 2014 http://ifl2014.github.io We are pleased to announce that the 26th edition of the IFL series will be held at Northeastern University in Boston, USA. The symposium will be held from 1st to 3rd of October 2014. Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2014 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2014 will use a post-symposium review process to produce the formal proceedings. All participants of IFL 2014 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. At no time may work submitted to IFL be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/Resources/Policies/Republication The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. Hence, publications that appear only in the draft proceedings do not count as publication for the ACM SIGPLAN republication policy. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. Submission Details ------------------ Submission deadline draft papers: September 8 Notification of acceptance for presentation: September 10 Early registration deadline: September 11 Late registration deadline: September 17 Submission deadline for pre-symposium proceedings: September 24 26th IFL Symposium: October 1-3 Submission deadline for post-symposium proceedings: December 15 Notification of acceptance for post-symposium proceedings: January 31 2015 Camera-ready version for post-symposium proceedings: March 15 2015 Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English. Papers must adhere to the standard ACM two columns conference format. For the pre-symposium proceedings we adopt a 'weak' page limit of 12 pages. For the post-symposium proceedings the page limit of 12 pages is firm. A suitable document template for LaTeX can be found at: http://www.acm.org/sigs/sigplan/authorInformation.htm Papers should be submitted online at https://easychair.org/conferences/?conf=ifl2014 Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools in the context of functional programming. If you are not sure whether your work is appropriate for IFL 2014, please contact the PC chair at samth(a)cs.indiana.edu. Topics of interest include, but are not limited to: • language concepts • type systems, type checking, type inferencing • compilation techniques • staged compilation • run-time function specialization • run-time code generation • partial evaluation • (abstract) interpretation • metaprogramming • generic programming • automatic program generation • array processing • concurrent/parallel programming • concurrent/parallel program execution • embedded systems • web applications • (embedded) domain specific languages • security • novel memory management techniques • run-time profiling performance measurements • debugging and tracing • virtual/abstract machine architectures • validation, verification of functional programs • tools and programming techniques • (industrial) applications Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Sam Tobin-Hochstadt, Indiana University (Chair) Rinus Plasmeijer, Radboud University Nijmegen (Co-Chair) Atze Dijkstra, Utrecht University Colin Runciman, University of York Graham Hutton, University of Nottingham Mary Sheeran, Chalmers University of Technology Patricia Johann, Appalachian State University Matthew Fluet, Rochester Institute of Technology Josef Svenningsson, Chalmers University of Technology Małgorzata Biernacka, University of Wroclaw Peter Achten, Radboud Univerity Nijmegen Laura Castro, University of A Coruña Hai Paul Liu, Intel Labs Kathryn Gray, Cambridge University Lars Bergstrom, Mozilla Research Lindsey Kuper, Indiana University Nicolas Wu, Oxford T. Stephen Strickland, University of Maryland Xavier Clerc, INRIA Venue ----- The 26th IFL will be held in association with the College of Computer and Information Science at Northeastern University. It can be reached quickly and easily by public transport.

1 0