Gambit-list Janvier 2022

gambit-list@iro.umontreal.ca

6 participants
5 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

Re: [gambit-list] Gambit v4.9.4 problems
by Jose Antonio Ortega Ruiz 25 Jan '22

25 Jan '22

[cc-ing gambit's mailing list, so that gambit users/developers can advise us on the recent changes affecting affecting geiser in 4.9.4] Hi Tara, On Sun, Jan 16 2022, Tara Lorenz wrote: > Hello all, > > i experience a problem with the recently released Gambit 4.9.4. One of > the problems is that the builtin geiser module is named differently now, > '_geiser' instead of 'gambit/geiser'. The attached patch seems to fix the > problem. I have to admit that i didn't test whether older versions > of gambit still work though. To make things easy, i renamed the > namespace used in the geiser provided scheme-implementation to match the > new upstream one. I don't know if this might lead to some controversy. I don't use gambit myself, but i guess we could just tag a new version of the geiser-gambit package and redirect users having problems to previous geiser-gambit versions. One thing that we should do together with this patch is set geiser-gambit-minimum-version to v4.9.4, though. I'm waiting a couple of days in case someone sees a problem with that. > The other problem i ran into was, that load-file (C-c C-l) no longer > works. It seems to me that including "~~lib/gambit/prim/prim#.scm" > isn't enough, 'load' will still be unknown. Thus leading to an error > message complaining about an '#!unbound' var where 'load' is expected. So you patch below doesn't fix this problem, right? Any ideas from other gambit experts? Thanks! Cheers, jao > Cheers, Tara > From 62f4c082a00e16b058da2a7b9d1327d850f884bd Mon Sep 17 00:00:00 2001 > From: Tara Lorenz <tara(a)terralonza.de> > Date: Sat, 15 Jan 2022 21:50:48 +0100 > Subject: [PATCH] Adjust to namespace changes in gambit v4.9.4 > > The namespace (and path) of the builtin geiser module changed from > gambit/geiser to _geiser > > - geiser-gambit--parameters uses correct builtin module path > - changed namespace for the version shipping with geiser to the same > as used in upstream gambit > - changed uses of namespace in geiser-gambit.el accordingly > --- > geiser-gambit.el | 14 +++++++------- > src/geiser/gambit.scm | 2 +- > 2 files changed, 8 insertions(+), 8 deletions(-) > > diff --git a/geiser-gambit.el b/geiser-gambit.el > index f8a80be..fc4f26f 100644 > --- a/geiser-gambit.el > +++ b/geiser-gambit.el > @@ -126,7 +126,7 @@ If t, Geiser will use `next-error' to jump to the error's location." > :group 'geiser-gambit) > > ;;; evaluation support when module loaded at opening > -;;; the gambit/geiser# is the namespace of geiser module for gambit > +;;; the _geiser# is the namespace of geiser module for gambit > (defun geiser-gambit--geiser-procedure (proc &rest args) > "Transform PROC in string for a scheme procedure using ARGS." > (cl-case proc > @@ -139,15 +139,15 @@ If t, Geiser will use `next-error' to jump to the error's location." > (concat "'" (car args))) > (t > "#f"))) > - (cmd (format "(gambit/geiser#geiser:eval %s '%s)" module form))) > + (cmd (format "(_geiser#geiser:eval %s '%s)" module form))) > cmd)) > ((load-file compile-file) > - (format "(gambit/geiser#geiser:load-file %s)" (car args))) > + (format "(_geiser#geiser:load-file %s)" (car args))) > ((no-values) > - "(gambit/geiser#geiser:no-values)") > + "(_geiser#geiser:no-values)") > (t > (let ((form (mapconcat 'identity args " "))) > - (format "(gambit/geiser#geiser:%s %s)" proc form))))) > + (format "(_geiser#geiser:%s %s)" proc form))))) > > ;;(defconst geiser-gambit--module-re > ;; "( *module +\$([^)]+)\\|[^ ]+\$\\|( *define-library +\$([^)]+)\\|[^ ]+\$") > @@ -314,8 +314,8 @@ If t, Geiser will use `next-error' to jump to the error's location." > (let* ((v (geiser-gambit--version (geiser-gambit--binary))) > (gambit-version (geiser--cut-version v))) > (if (version< gambit-version "4.9.4") > - `( "-:d-" ,(expand-file-name "geiser/gambit.scm" geiser-gambit-scheme-dir) "-" ) > - `("-:d-" "gambit/geiser.scm" "-")))) > + `( "-:d-" ,(expand-file-name "geiser/gambit.scm" geiser-gambit-scheme-dir) "-" ) > + `("-:d-" "_geiser" "-")))) > > ;;;###autoload > (defun connect-to-gambit () > diff --git a/src/geiser/gambit.scm b/src/geiser/gambit.scm > index e7c760c..cff56ff 100644 > --- a/src/geiser/gambit.scm > +++ b/src/geiser/gambit.scm > @@ -1,6 +1,6 @@ > ;; scheme > ;;; gambit.scm gambit geiser interaction > -(##namespace ("gambit/geiser#")) ;; in gambit/geiser# > +(##namespace ("_geiser#")) ;; in _geiser# > (##include "~~lib/gambit#.scm") ;; for macro-check-string, > ;; macro-absent-obj, etc > > -- > 2.34.1 > -- What sane person could live in this world and not be crazy? -Ursula K. Le Guin, author

3 2

Q: Understanding -target js
by Jörg F. Wittenberger 20 Jan '22

20 Jan '22

With the "silent" release of 4.9.4 I'm intrigued to learn how to actually use the alternative compile backend choice. Initially confining myself to the `js` backend with HTML output. 1) A simple `(display "Hello World!")` gave no result. Where does content written to standard-{output,error}-port end up? 2) Raising an error or `(##repl)` give me a more or less nice REPL. Unfortunately the source code does not look like a good starting point to learn how that REPL is implemented. Attached my current "Hello World!" using `##inline-host-statement` to call into JavaScript. (Deduced from digging into gambit source.) I ran into https://github.com/udem-dlteam/els2021-presentation which explains inline syntax but this syntax seems not to work with 4.9.4 unless there is a trick I missed. Is there example code out there (or anything better) to learn how working code manipulating DOM could roughly work? Any documentation on ##inline-host-* , @scm2host@ and friends would also be very welcome. 3) Figuring out what is or is not supported per backend could become a nightmare. Right now I found `open-tcp-server` to return #!void, `open-tcp-client` to complain about wrong number of arguments. Both are not really helpful to understand that this documented procedure is not yet implemented. My own solution to the recurring situation is to have (very few) all upper case acronyms defined which are easy to spot visually or via grep. NYIE in this case, which is a procedure accepting any number of arguments and raises a not-yet-implemented-exception. I don't expect a book of unimplemented features, am I missing something? Thanks for Gambit! /Jörg

2 1

[TFP'22] second call for papers: Trends in Functional Programming 2022 moved to March 17-18 online (together with TFPiE)
by Peter Achten 11 Jan '22

11 Jan '22

============== TFP 2022 =================== == MOVING TO ONLINE SYMPOSIUM, NEW DATES == =========================================== 23rd Symposium on Trends in Functional Programming 17-18 March, 2022 Online event https://trendsfp.github.io/index.html Due the pandemic, we have had to make TFP virtual this year. As a result, we've decided to push back the deadlines and conference date by a few weeks. In particular, the pre-symposium deadline for submitting the first version of your paper is now just after the ICFP deadline. == Important Dates == Submission deadline for draft papers Monday 7th March, 2022 Notification for draft submissions Friday 11th March, 2022 Symposium dates Thursday 17th - Friday 18th March, 2022 Submission deadline for post-symposium reviewing Wednesday 6th April, 2022 Notification for post-symposium submissions Friday 27th May, 2022 The Symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions. == Scope == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: * Research Articles: Leading-edge, previously unpublished research work * Position Articles: On what new trends should or should not be * Project Articles: Descriptions of recently started new projects * Evaluation Articles: What lessons can be drawn from a finished project * Overview Articles: Summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include, but are not limited to: * Functional programming and multicore/manycore computing * Functional programming in the cloud * High performance functional computing * Extra-functional (behavioural) properties of functional programs * Dependently typed functional programming * Validation and verification of functional programs * Debugging and profiling for functional languages * Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. * Interoperability with imperative programming languages * Novel memory management techniques * Program analysis and transformation techniques * Empirical performance studies * Abstract/virtual machines and compilers for functional languages * (Embedded) domain specific languages * New implementation strategies * Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2022 program chairs, Wouter Swierstra and Nicolas Wu. == Best Paper Awards == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == Instructions to Author == Papers must be submitted at: https://easychair.org/conferences/?conf=tfp22 Authors of papers have the choice of having their contributions formally reviewed either before or after the Symposium. == Post-symposium formal review process == Draft papers will receive minimal reviews and notification of acceptance for presentation at the symposium. Authors of draft papers will be invited to submit revised papers based on the feedback received at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. == Paper categories == Draft papers and papers submitted for formal review are submitted as extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which all authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. == Format == Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site. == Program Committee == Guillaume Allais University of St Andrews José Manuel Calderón Trilla Galois, Inc. Stephen Chang University of Massachusetts Boston Matthew Flatt University of Utah Jeremy Gibbons University of Oxford Zhenjiang Hu Peking University Mauro Jaskelioff CIFASIS / Universidad Nacional de Rosario Moa Johansson Chalmers University of Technology Shin-ya Katsumata National Institute of Informatics Oleg Kiselyov Tohoku University Bas Lijnse Netherlands Defence Academy / Radboud University Nijmegen Kazutaka Matsuda Tohoku University Nico Naus Virginia Tech Christine Rizkallah University of New South Wales Alejandro Serrano 47 Degrees Amir Shaikhha Ecole Polytechnique Fédérale de Lausanne Aaron Stump University of Iowa Wouter Swierstra (Co-chair) Utrecht University Baltasar Trancón Y Widemann Semantics GmbH Nicolas Wu (Co-chair) Imperial College London Ningning Xie University of Hong Kong

1 0

Dependeny graphs for reachable bindings: Gambit 4.9.3 vs 4.9.4
by Sven Hartrumpf 04 Jan '22

04 Jan '22

Hello. For a long time, I have been using gsc to determine all reachable bindings (functions and global variables) of a Scheme program with gsc -c -dg foo.scm This dependeny graph analysis is fast and was the most accurate one I found in the Scheme world. When stepping from 4.9.3 to 4.9.4(git), the analysis misses many reachable bindings (i.e. many false negatives, no false positives). For a large example program, the number drops from 7178 to 6248. Is this expected? Do I need to adjust my gsc options above? Greetings Sven

2 5

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Gambit-list Janvier 2022