Gambit-list Juillet 2014

gambit-list@iro.umontreal.ca

18 participants
20 discussions

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

LOPSTR 2014: Call for Participation
by Maurizio Proietti 24 Jul '14

24 Jul '14

===================== CALL FOR PARTICIPATION ============================= 24th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2014 http://www.iasi.cnr.it/events/lopstr14/ University of Kent, Canterbury, UK, September 9-11, 2014 Co-located with the 16th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2014) ========================================================================== Early registration by August 8, 2014 http://www.cs.kent.ac.uk/events/2014/ppdp-lopstr-14/registration.html Invited Speakers: Roberto Giacobazzi (University of Verona, Italy) "Obscuring Code -- Unveiling and Veiling Information in Programs" Viktor Kuncak (EPFL, Switzerland) Title to be announced Accepted papers - Nikita Danilenko Functional Kleene Closures - Amer Tahat and Ali Ebnenasir A Hybrid Method for the Verification and Synthesis of Parameterized Self-Stabilizing Protocols - German Vidal Concolic Execution and Test-Case Generation in Prolog - Henning Christiansen and Maja Kirkeby Confluence Modulo Equivalence in Constraint Handling Rules - Remis Balaniuk Drill & Join: A method for inductive program synthesis - Minoru Kinoshita, Kohei Suenaga and Atsushi Igarashi Automatic Synthesis of Combiners in the MapReduce Framework - An Approach with Right Inverse - Daniel De Schreye, Vincent Nys and Colin Nicholson Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction - Daniel Gall and Thom Frühwirth A Formal Semantics for the Cognitive Architecture ACT-R - J. Robert M. Cornish, Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard and Peter J. Stuckey Analyzing array manipulating programs by program transformation - Nada Sharaf, Slim Abdennadher and Thom Frühwirth A Visualization Tool for Constraint Handling Rules - Salvador Lucas, Jose Meseguer and Raúl Gutiérrez Extending the 2D DP Framework for CTRSs - Ahmed Nagah, Amira Zaki and Slim Abdennadher Exhaustive Execution of CHR through Source-to-Source Transformation - Sandra Alves, Anatoli Degtyarev and Maribel Fernandez Access control and obligations in the category-based metamodel: A rewrite-based semantics - James Lipton, Emilio Jesús Gallego Arias and Julio Mariño A Declarative Compilation of Constraint Logic Programming - Jose F. Morales and Manuel V. Hermenegildo Pre-indexed Terms for Prolog - Norbert Preining, Kokichi Futatsugi and Kazuhiro Ogata Liveness properties in CafeOBJ - a case study for meta-level specifications - Wlodzimierz Drabent On completeness of logic programs - Ranjeet Singh and Andy King Partial Evaluation for Java Malware Detection - Raul Gutierrez and Salvador Lucas Below Frozen Positions - Md Solimul Chowdhury, Jia-Huai You, Wu Chen, Arash Karimi and Fangfang Liu Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies ============================================================================= Program Co-Chairs: Maurizio Proietti, IASI-CNR, Italy (maurizio.proietti(a)iasi.cnr.it) Hirohisa Seki, Nagoya Institute of Technology, Japan (seki(a)nitech.ac.jp ) Symposium Co-Chairs: Olaf Chitil and Andy King School of Computing, University of Kent, UK ({O.Chitil,A.M.King}(a)kent.ac.uk) Organizing Committee: Emanuele De Angelis, University of Chieti-Pescara and IASI-CNR, Italy Fabrizio Smith, IASI-CNR, Italy

1 0

[ANN] Gambit-C v4.7.3 released
by gambit＠iro.umontreal.ca 23 Jul '14

23 Jul '14

1 0

ICFP Programming Contest 2014
by Nicolas Wu 23 Jul '14

23 Jul '14

===================================================================== Call for Participation The 17th ICFP Programming Contest http://www.icfpcontest.org Friday 25 July 2014 at 12:00 UTC ===================================================================== The ICFP Programming Contest 2014 is starting at the end of this week! It's nearly time to roll up your sleeves, and gain fame and glory for your programming language of choice: prepare for sleepless nights and hours of fun! The full details of the contest specification will appear on the contest website at http://www.icfpcontest.org on Friday 25 July 2014 at 12:00 UTC. No registration is required: just roll up and have some fun! For more announcements, stay tuned on our twitter feed at: https://twitter.com/icfpcontest2014 Good luck to all participants, Nicolas Wu

1 0

Modifying
by Bradley Lucier 22 Jul '14

22 Jul '14

Marc: I'd like to modify ##wr-structure in _io.scm to write Meroon objects. Conceptually, writing a structure and writing a meroon object are very similar, but ##wr-structure seems to assume a lot of low-level detail about how structures are laid out, etc. What do you think needs to be changed to achieve writing Meroon objects the same way as structures? Brad

1 0

Re: [gambit-list] p-cos blog: A Lisper's first impression of Julia
by Bradley Lucier 22 Jul '14

22 Jul '14

I'm CC'ing the gambit list. See the script make_meroon in http://www.math.purdue.edu/~lucier/software/Meroon/ Basically, it just concatenates some files to make two large files pre_meroon.scm and _meroon.scm, uses old-load.scm to load each form in pre_meroon.scm in order, and then compiles _meroon.scm. I suppose one can get this to work on Windows. Note that this version of Meroon has setters of the form <class-name>-<slot-name>-set! rather than set-<class-name>-<slot-name>!. I'd be interested in seeing Simmer. Brad On 07/22/2014 05:41 AM, Riverola Garcia, Josep wrote: > Hello: > I was an early user of meroon for my simulation system Simmer, written in MacGambit for the Mac. Sometime after, that the school moved to Windows and I stopped ising Gambit and Meroon. Now (twenty and some years later!) I would like to update Simmer. But I dont have a version of Meroon running on Gambit, nor I have the expertise to rewrite it. I have contacted with Christian Queinnec but he was not able to help, since he is no longer supporting Meroon. I believe you have such a sysytem. Please, would you give me a pointer on obtain a version running on Windows and Gambit-C? > Thanks a lot > Josep Riverola > ________________________________________ > De: gambit-list-bounces(a)iro.umontreal.ca <gambit-list-bounces(a)iro.umontreal.ca> en nombre de Bradley Lucier <lucier(a)math.purdue.edu> > Enviado: martes, 22 de julio de 2014 4:43 > Para: Gambit List > Asunto: [gambit-list] p-cos blog: A Lisper's first impression of Julia > > http://p-cos.blogspot.com/2014/07/a-lispers-first-impression-of-julia.html > > I found this discussion of Julia, a language in the tradition of Common Lisp, Scheme, and Dylan, but designed for scientific programming, quite interesting. In particular, it has a lot of similar design choices to Gambit plus the Meroon object system that I’ve been using in my numerical partial differential equations course. > > Brad > _______________________________________________ > Gambit-list mailing list > Gambit-list(a)iro.umontreal.ca > https://webmail.iro.umontreal.ca/mailman/listinfo/gambit-list

1 0

Missing files on Gambit web server
by Bradley Lucier 22 Jul '14

22 Jul '14

Marc: I tried to download MeroonV3-2012Jan20.tar.bz2 <http://dynamo.iro.umontreal.ca/wiki/index.php/File:MeroonV3-2012Jan20.tar.b…> from http://dynamo.iro.umontreal.ca/wiki/index.php/Special:ListFiles and from the dumping grounds page but I get the message Not Found The requested URL /wiki/images/c/c9/MeroonV3-2012Jan20.tar.bz2 was not found on this server. Is something wrong with the server? Or did I do something wrong. Brad

1 0

p-cos blog: A Lisper's first impression of Julia
by Bradley Lucier 21 Jul '14

21 Jul '14

http://p-cos.blogspot.com/2014/07/a-lispers-first-impression-of-julia.html I found this discussion of Julia, a language in the tradition of Common Lisp, Scheme, and Dylan, but designed for scientific programming, quite interesting. In particular, it has a lot of similar design choices to Gambit plus the Meroon object system that I’ve been using in my numerical partial differential equations course. Brad

1 0

[Call for Papers] 2014 Scheme and Functional Programming Workshop
by Jason Hemann 16 Jul '14

16 Jul '14

[Apologies for duplication from cross-postings.] DEADLINE: 5 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 5 September 2014. Authors will be notified by 10 October 2014. Camera-ready versions are due 24 Oct 2014. All deadlines are (23:59 UTC-12), "Anywhere on Earth". For more information, please see: http://homes.soic.indiana.edu/jhemann/scheme-14/ Best, Jason Hemann, Organizer, Scheme 14

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Gambit-list Juillet 2014