Gambit-list Avril 2018

gambit-list@iro.umontreal.ca

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

final call for papers: Trends in Functional Programming, 11-13 june 2018, Chalmers Campus Johanneberg, Gothenburg - deadline extended -
by Peter Achten 30 Avr '18

30 Avr '18

------------------------------------- F I N A L C A L L F O R P A P E R S ------------------------------------- ----- deadline extended ----- ======== TFP 2018 =========== 19th Symposium on Trends in Functional Programming 11-13 June, 2018 Chalmers Campus Johanneberg, Gothenburg http://www.cse.chalmers.se/~myreen/tfp2018/index.html 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 (see below at scope). Please be aware that TFP uses two distinct rounds of submissions (see below at submission details). TFP 2018 will be the main event of a pair of functional programming events. TFP 2018 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on June 14. == 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 2018 program chairs, Michał Pałka and Magnus Myreen. == 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. == Paper Submissions == We use EasyChair for the refereeing process. The link to the submission page is: https://easychair.org/conferences/?conf=tfp2018 Authors of papers have the choice of having their contributions formally reviewed either before or after the Symposium. == Pre-symposium formal review == Papers to be formally reviewed before the symposium should be submitted before an early deadline and receive their reviews and notification of acceptance for both presentation and publication before the symposium. A paper that has been rejected in this process may still be accepted for presentation at the symposium, but will not be considered for the post-symposium formal review. == Post-symposium formal review == 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 receive 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. == Important Dates == Submission (pre-symposium review): March 26, 2018 -- passed -- Submission (draft, post-symposium review): May 11, 2018 -- extended -- Notification (pre- and post-symposium review): May 13, 2018 -- extended -- Registration: June 3, 2018 TFP Symposium: June 11-13, 2018 TFPIE Workshop: June 14, 2018 Student papers feedback: June 21, 2018 Submission (post-symposium review): August 14, 2018 Notification (post-symposium review): September 20, 2018 Camera-ready paper (pre- and post-symposium review): November 30, 2018 == Program Committee == Program Co-chairs Michał Pałka, Chalmers University of Technology (SE) Magnus Myreen, Chalmers University of Technology (SE) Program Committee Soichiro Hidaka, Hosei University (JP) Meng Wang, University of Bristol (UK) Sam Tobin-Hochstadt, Indiana University Bloomington (US) Tiark Rompf, Purdue University (US) Patricia Johann, Appalachian State University (US) Neil Sculthorpe, Nottingham Trent University (UK) Andres Löh, Well-Typed LLP (UK) Tarmo Uustalu, Tallinn University of Technology (EE) Cosmin E. Oancea, University of Copenhagen (DK) Mauro Jaskelioff, Universidad Nacional de Rosario (AR) Peter Achten, Radboud University (NL) Dimitrios Vytiniotis, Microsoft Research (UK) Alberto Pardo, Universidad de la República (UY) Natalia Chechina, University of Glasgow (UK) Peter Sestoft, IT University of Copenhagen (DK) Scott Owens, University of Kent (UK)

1 0

Some floating-point benchmarks
by Bradley Lucier 18 Avr '18

18 Avr '18

I isolated the complex double-precision floating-point fft code from bignum.* to compile it with various compilation options. Bottom line: this page https://asteroidsathome.net/boinc/cpu_list.php claims that this cpu gets 4.42 Whetstone GFLOPS per core, and we get a maximum of 5.24 GFLOPS on this fft code. Not bad. This is with heine:~/Downloads> gsc -v v4.8.9 20170203122653 x86_64-unknown-linux-gnu "./configure 'CC=gcc -march=native -D___CAN_IMPORT_CLIB_DYNAMICALLY' '--enable-single-host' '--enable-multiple-versions' '--enable-shared'" So the default compilation options are -O1 -fno-strict-aliasing (for correctness concerns). I tried it on arrays of 2^n complex numbers---direct fft, inverse fft, and normalization pass, with input arrays of double-precision floats a[i]=i for i=0,...,2*2^n. So the largest input element is 2*2^n-1. on my workstation model name : Intel(R) Xeon(R) CPU E3-1271 v3 @ 3.60GHz I get with the default: heine:~/Downloads> gsc -cc-options "" -exe fft heine:~/Downloads> ./fft n = 3; time = 1.2792682647705076e-7; GFLOPS = 2.0636797399751012; error = 6.280369834735101e-16 n = 4; time = 2.574949264526366e-7; GFLOPS = 2.7340344514690593; error = 1.2560739669470201e-15 n = 5; time = 5.655374526977542e-7; GFLOPS = 3.1120838975462415; error = 1.3293037379376718e-14 n = 6; time = 1.257272720336914e-6; GFLOPS = 3.3596529469501935; error = 2.7519201823675253e-14 n = 7; time = 2.7076988220214864e-6; GFLOPS = 3.639991242689912; error = 1.8198773652309366e-13 n = 8; time = 6.110149383544923e-6; GFLOPS = 3.686980233358868; error = 8.83819200536562e-13 n = 9; time = 1.3053115844726564e-5; GFLOPS = 3.8832107676787273; error = 2.7517734093770814e-12 n = 10; time = 2.9251388549804685e-5; GFLOPS = 3.8507573686019816; error = 8.615107250117524e-12 n = 11; time = 6.245434570312496e-5; GFLOPS = 3.96782637317103; error = 2.5586863923536608e-11 n = 12; time = 1.3760546875000003e-4; GFLOPS = 3.9291461662928993; error = 8.374515403013386e-11 n = 13; time = 2.9157373046874956e-4; GFLOPS = 4.017700765143364; error = 2.427252058167489e-10 n = 14; time = 6.318623046874996e-4; GFLOPS = 3.993173799547781; error = 6.401279315596559e-10 n = 15; time = .001321798828125005; GFLOPS = 4.090425778081168; error = 1.9322736676846665e-9 n = 16; time = .002869578125000008; GFLOPS = 4.019523253091417; error = 6.148274594627871e-9 n = 17; time = .005964710937500006; GFLOPS = 4.109245905933724; error = 1.895030528746498e-8 n = 18; time = .01278696874999996; GFLOPS = 4.059172507166733; error = 5.416434749765215e-8 n = 19; time = .027237953124999992; GFLOPS = 4.022923143201497; error = 1.5924367682223522e-7 n = 20; time = .057735125; GFLOPS = 3.995604408927841; error = 4.5478152820930204e-7 n = 21; time = .12327618750000013; GFLOPS = 3.9297298352936125; error = 1.3135697754368119e-6 n = 22; time = .2585797499999991; GFLOPS = 3.9253714492337606; error = 3.766933517450172e-6 n = 23; time = .5431375000000003; GFLOPS = 3.907514807944579; error = 1.0091226617647086e-5 n = 24; time = 1.1226800000000026; GFLOPS = 3.9451892115295455; error = 2.8489239226962006e-5 n = 25; time = 2.383513999999998; GFLOPS = 3.8713717645459633; error = 7.694023206666354e-5 n = 26; time = 4.8833489999999955; GFLOPS = 3.930322224358738; error = 2.0768331024043966e-4 n = 27; time = 10.276466000000013; GFLOPS = 3.8790246779388897; error = 6.771006191341503e-4 n = 28; time = 22.067048; GFLOPS = 3.746677872273627; error = .00198493924264615 Upping the optimization level: heine:~/Downloads> gsc -cc-options "-fstrict-aliasing -O3 -save-temps" -exe fft heine:~/Downloads> ./fft n = 3; time = 1.1115747690200805e-7; GFLOPS = 2.3750089274942052; error = 1.4043333874306805e-15 n = 4; time = 2.0910918712615964e-7; GFLOPS = 3.366662219270467; error = 1.2560739669470201e-15 n = 5; time = 4.6715402603149463e-7; GFLOPS = 3.7674940210861934; error = 2.2748467065386707e-14 n = 6; time = 9.806089401245132e-7; GFLOPS = 4.307527524135826; error = 6.925513918651634e-14 n = 7; time = 2.1452598571777346e-6; GFLOPS = 4.594315214086175; error = 1.8986255008552728e-13 n = 8; time = 4.814510345458979e-6; GFLOPS = 4.679188200571278; error = 8.658131612109979e-13 n = 9; time = 1.0385185241699221e-5; GFLOPS = 4.88079883221288; error = 2.6212768034767646e-12 n = 10; time = 2.2970413208007773e-5; GFLOPS = 4.903699336184875; error = 9.101339655728878e-12 n = 11; time = 4.84939270019531e-5; GFLOPS = 5.110083165465636; error = 2.6234330924158545e-11 n = 12; time = 1.0720489501953121e-4; GFLOPS = 5.04335179752284; error = 8.505295203287146e-11 n = 13; time = 2.2667480468750029e-4; GFLOPS = 5.168002688322593; error = 2.457142635663205e-10 n = 14; time = 4.962851562500016e-4; GFLOPS = 5.084044864579792; error = 6.456457983110483e-10 n = 15; time = .0010395449218749964; GFLOPS = 5.201045078694684; error = 1.946559195529706e-9 n = 16; time = .0022347304687500014; GFLOPS = 5.161399176005213; error = 6.237221035700878e-9 n = 17; time = .004680433593750005; GFLOPS = 5.236793452796753; error = 1.9179232434271595e-8 n = 18; time = .009985109374999968; GFLOPS = 5.198191632227381; error = 5.455583080566663e-8 n = 19; time = .021316359374999982; GFLOPS = 5.14047404025811; error = 1.6040392061497455e-7 n = 20; time = .046797624999999954; GFLOPS = 4.929453578039489; error = 4.5965622756701105e-7 n = 21; time = .09856387499999997; GFLOPS = 4.915006760844175; error = 1.3298451540360703e-6 n = 22; time = .21956825000000002; GFLOPS = 4.622806658066455; error = 3.8105936636522594e-6 n = 23; time = .4410570000000007; GFLOPS = 4.811890127579875; error = 1.019930547729006e-5 n = 24; time = .9108285000000045; GFLOPS = 4.86280899642466; error = 2.8808951170769453e-5 n = 25; time = 1.9416279999999944; GFLOPS = 4.752439087199003; error = 7.76313343393936e-5 n = 26; time = 3.990959999999987; GFLOPS = 4.809152460560884; error = 2.0982907904532167e-4 n = 27; time = 8.455573999999999; GFLOPS = 4.71436536608869; error = 6.832370167555158e-4 n = 28; time = 17.53549000000001; GFLOPS = 4.714902203930427; error = .0020010805164815105 *** ERROR IN test -- asking for too large a table Dialing things back a bit: heine:~/Downloads> gsc -cc-options "-fstrict-aliasing -O3 -save-temps -mno-fma" -exe fft heine:~/Downloads> ./fft n = 3; time = 1.1347168684005738e-7; GFLOPS = 2.32657156469453; error = 6.280369834735101e-16 n = 4; time = 2.2617471218109142e-7; GFLOPS = 3.1126379833141034; error = 1.2560739669470201e-15 n = 5; time = 4.947843551635739e-7; GFLOPS = 3.5571051946825407; error = 1.3293037379376718e-14 n = 6; time = 1.0590076446533188e-6; GFLOPS = 3.98863976225855; error = 2.7519201823675253e-14 n = 7; time = 2.299959182739257e-6; GFLOPS = 4.285293440843364; error = 1.8198773652309366e-13 n = 8; time = 5.2182350158691345e-6; GFLOPS = 4.317168531407702; error = 8.83819200536562e-13 n = 9; time = 1.113512420654298e-5; GFLOPS = 4.552082137549558; error = 2.7517734093770814e-12 n = 10; time = 2.5001800537109394e-5; GFLOPS = 4.505275523369285; error = 8.615107250117524e-12 n = 11; time = 5.2638397216796815e-5; GFLOPS = 4.707742125569981; error = 2.5586863923536608e-11 n = 12; time = 1.1749737548828135e-4; GFLOPS = 4.601566611621245; error = 8.374515403013386e-11 n = 13; time = 2.4704760742187606e-4; GFLOPS = 4.741822890838763; error = 2.427252058167489e-10 n = 14; time = 5.420463867187482e-4; GFLOPS = 4.654834091365654; error = 6.401279315596559e-10 n = 15; time = .0011368671875000014; GFLOPS = 4.755806183384982; error = 1.9322736676846665e-9 n = 16; time = .0024570624999999957; GFLOPS = 4.694360033576688; error = 6.148274594627871e-9 n = 17; time = .005130425781249975; GFLOPS = 4.777471704118148; error = 1.895030528746498e-8 n = 18; time = .011012445312500008; GFLOPS = 4.713259455743606; error = 5.416434749765215e-8 n = 19; time = .023272265625000066; GFLOPS = 4.708445398727683; error = 1.5924367682223522e-7 n = 20; time = .05027193750000003; GFLOPS = 4.588777188068391; error = 4.5478152820930204e-7 n = 21; time = .1088502499999997; GFLOPS = 4.450537431011884; error = 1.3135697754368119e-6 n = 22; time = .22666912499999992; GFLOPS = 4.477987763000367; error = 3.766933517450172e-6 n = 23; time = .4811325000000011; GFLOPS = 4.411088055785039; error = 1.0091226617647086e-5 n = 24; time = 1.0017979999999937; GFLOPS = 4.421235642315144; error = 2.8489239226962006e-5 n = 25; time = 2.1137259999999998; GFLOPS = 4.365499028729363; error = 7.694023206666354e-5 n = 26; time = 4.3619779999999935; GFLOPS = 4.400099015630072; error = 2.0768331024043966e-4 n = 27; time = 9.149559999999994; GFLOPS = 4.356784940040836; error = 6.771006191341503e-4 n = 28; time = 18.892846000000006; GFLOPS = 4.376160185077461; error = .00198493924264615 I'll include the code if anyone's interested. Brad

3 9

2nd call for papers: Trends in Functional Programming, 11-13 june 2018, Chalmers Campus Johanneberg, Gothenburg
by Peter Achten 16 Avr '18

16 Avr '18

------------------------------------- 2 N D C A L L F O R P A P E R S ------------------------------------- ======== TFP 2018 =========== 19th Symposium on Trends in Functional Programming 11-13 June, 2018 Chalmers Campus Johanneberg, Gothenburg http://www.cse.chalmers.se/~myreen/tfp2018/index.html 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 (see below at scope). Please be aware that TFP uses two distinct rounds of submissions (see below at submission details). TFP 2018 will be the main event of a pair of functional programming events. TFP 2018 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on June 14. == 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 2018 program chairs, Michał Pałka and Magnus Myreen. == 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. == Paper Submissions == We use EasyChair for the refereeing process. The link to the submission page is: https://easychair.org/conferences/?conf=tfp2018 Authors of papers have the choice of having their contributions formally reviewed either before or after the Symposium. == Pre-symposium formal review == Papers to be formally reviewed before the symposium should be submitted before an early deadline and receive their reviews and notification of acceptance for both presentation and publication before the symposium. A paper that has been rejected in this process may still be accepted for presentation at the symposium, but will not be considered for the post-symposium formal review. == Post-symposium formal review == 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 receive 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. == Important Dates == Submission (pre-symposium review): March 26, 2018 -- passed -- Submission (draft, post-symposium review): April 26, 2018 -- open -- Notification (pre- and post-symposium review): May 3, 2018 Registration: June 3, 2018 TFP Symposium: June 11-13, 2018 TFPIE Workshop: June 14, 2018 Student papers feedback: June 21, 2018 Submission (post-symposium review): August 14, 2018 Notification (post-symposium review): September 20, 2018 Camera-ready paper (pre- and post-symposium review): November 30, 2018 == Program Committee == Program Co-chairs Michał Pałka, Chalmers University of Technology (SE) Magnus Myreen, Chalmers University of Technology (SE) Program Committee Soichiro Hidaka, Hosei University (JP) Meng Wang, University of Bristol (UK) Sam Tobin-Hochstadt, Indiana University Bloomington (US) Tiark Rompf, Purdue University (US) Patricia Johann, Appalachian State University (US) Neil Sculthorpe, Nottingham Trent University (UK) Andres Löh, Well-Typed LLP (UK) Tarmo Uustalu, Tallinn University of Technology (EE) Cosmin E. Oancea, University of Copenhagen (DK) Mauro Jaskelioff, Universidad Nacional de Rosario (AR) Peter Achten, Radboud University (NL) Dimitrios Vytiniotis, Microsoft Research (UK) Alberto Pardo, Universidad de la República (UY) Natalia Chechina, University of Glasgow (UK) Peter Sestoft, IT University of Copenhagen (DK) Scott Owens, University of Kent (UK)

1 0

TFPIE 2018: First Call for Papers
by Heather Miller 08 Avr '18

08 Avr '18

====================================================================== TFPIE 2018: First Call for Papers ====================================================================== Trends in Functional Programming in Education Gothenburg, Sweden, 14 June 2018 http://www.ccs.neu.edu/home/heather/tfpie2018/ (co-located with TFP 2018) http://www.cse.chalmers.se/~myreen/tfp2018/ ====================================================================== The goal of TFPIE is to gather researchers, teachers and professionals that use, or are interested in the use of, functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas and work-in-progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chair of TFPIE 2018 will screen submissions to ensure that all presentations are within scope and are of interest to participants. After the workshop, presenters will be invited to submit revised versions of their articles for publication in the journal Electronic Proceedings in Theoretical Computer Science (EPTCS). Scope ===== TFPIE 2018 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: - FP and beginning CS students - FP and Computational Thinking - FP and Artificial Intelligence - FP in Robotics - FP and Music - Advanced FP for undergraduates - FP in graduate education - Engaging students in research using FP - FP in Programming Languages - FP in the high school curriculum - FP as a stepping stone to other CS topics - FP and Philosophy - The pedagogy of teaching FP - FP and e-learning: MOOCs, automated assessment etc. - Best Lectures – more details below In addition to papers, we are requesting best lecture presentations. What’s your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. Submissions =========== Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 16 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website. Papers and abstracts can be submitted via EasyChair at the link below. After the workshop, presenters will be invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the journal Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Submission page: https://easychair.org/conferences/?conf=tfpie2018 Important dates =============== - Submission deadline: May 15th, Anywhere on Earth. - Notification: May 21st - Workshop: June 14th - Submission for formal review: August 17th - Notification of full article: October 5th - Camera ready: November 2nd -- Heather Miller EPFL, Scala Center Executive Director, Research Scientist http://people.epfl.ch/heather.miller +41 21 693 64 83 +41 78 625 20 23

1 0

2nd CfP: IFL 2018 (30th Symposium on Implementation and Application of Functional Languages)
by Jurriaan Hage 03 Avr '18

03 Avr '18

Hello, Please, find below the second call for papers for IFL 2018. Please forward these to anyone you think may be interested. Apologies for any duplicates you may receive. best regards, Jurriaan Hage Publicity Chair of IFL --- ================================================================================ IFL 2018 30th Symposium on Implementation and Application of Functional Languages University of Massachusetts Lowell, MA, USA September 5th-7th, 2018 http://iflconference.org ================================================================================ ### 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 2018 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. Topics of interest to IFL 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 ### Keynote Speakers * Adam Chlipala, Massachusetts Institute of Technology CSAIL * Arjun Guha, University of Massachusetts Amherst ### Submissions and peer-review Differently from previous editions of IFL, IFL 2018 solicits two kinds of submissions: * Regular papers (12 pages including references) * Draft papers for presentations ('weak' limit between 8 and 15 pages) Regular papers will undergo a rigorous review by the program committee, and will be evaluated according to their correctness, novelty, originality, relevance, significance, and clarity. A set of regular papers will be conditionally accepted for publication. Authors of conditionally accepted papers will be provided with committee reviews along with a set of mandatory revisions. Regular papers not accepted for publication will be considered as draft papers, at the request of the author. Draft papers will be screened to make sure that they are within the scope of IFL, and will be accepted for presentation or rejected accordingly. Prior to the symposium: Authors of conditionally accepted papers and accepted presentations will submit a pre-proceedings version of their work that will appear in the draft proceedings distributed at the symposium. The draft proceedings does not constitute a formal publication. We require that at least one of the authors present the work at IFL 2018. After the symposium: Authors of conditionally accepted papers will submit a revised versions of their paper for the formal post-proceedings. The program committee will assess whether the mandatory revisions have been adequately addressed by the authors and thereby determines the final accept/reject status of the paper. Our interest is to ultimately accept all conditionally accepted papers. If you are an author of a conditionally accepted paper, please make sure that you address all the concerns of the reviewers. Authors of accepted presentations 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 post-proceedings. The program committee will evaluate these submissions according to their correctness, novelty, originality, relevance, significance, and clarity, and will thereby determine whether the paper is accepted or rejected. ### Publication The formal proceedings will appear in the International Conference Proceedings Series of the ACM Digital Library. 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 ### Important dates Submission of regular papers: May 25, 2018 Submission of draft papers: July 17, 2018 Regular and draft papers notification: July 20, 2018 Deadline for early registration: August 8, 2018 Submission of pre-proceedings version: August 29, 2018 IFL Symposium: September 5-7, 2018 Submission of papers for post-proceedings: November 7, 2018 Notification of acceptance: December 22, 2018 Camera-ready version: February 10, 2019 ### Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template Authors submit through EasyChair: https://easychair.org/conferences/?conf=ifl2018 ### Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honored 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. ### Organization and Program committee Chairs: Jay McCarthy & Matteo Cimini, University of Massachusetts Lowell, USA Program Committee: * Arthur Chargueraud, Inria, FR * Ben Delaware, Purdue University, USA * Christos Dimoulas, Northwestern University, USA * David Darais, University of Vermont, USA * Dominic Orchard, University of Kent, UK * Ekaterina Komendantskaya, Heriot-Watt University, UK * Garrett Morris, University of Kansas, USA * Heather Miller, EPFL & Northeastern University, CH & USA * Jeremy Yallop, University of Cambridge, UK * Keiko Nakata, SAP Innovation Center Potsdam, DE * Laura Castro, University of A Coruna, ESP * Magnus Myreen, Chalmers University of Technology, SWE * Natalia Chechina, Bournemouth University, UK * Peter Achten, Radboud Universiteit Nijmegen, NL * Peter-Michael Osera, Grinnell College, USA * Richard Eisenberg, Bryn Mawr College, USA * Trevor McDonell, University of New South Wales, AUS * Yukiyoshi Kameyama, University of Tsukuba, JAP ### Venue The 30th IFL is organized by the University of Massachusetts Lowell. The City of Lowell is located at the heart of the Merrimack Valley just 30 miles northwest of Boston. Lowell can be easily reached by train or taxi. See the website for more information on the venue. ### Acknowledgments This call-for-papers is an adaptation and evolution of content from previous instances of IFL. We are grateful to prior organizers for their work, which is reused here. A part of IFL 2018 format and CFP language that describes conditionally accepted papers has been adapted from call-for-papers of OOPSLA conferences.

1 0

Failing macos build of old sources with new Gambit
by mikel evins 01 Avr '18

01 Avr '18

It's been a little while since I built one of my projects that it implemented in Gambit. I just did a fresh install of Gambit 4.8.9 on a system that has never had it installed before. Xcode is installed, and gcc 7 from homebrew is installed. When I try compiling my app, I get the message: *** ERROR -- missing or invalid linking information for module "/usr/local/lib/_gambit" I've tried various incantations, but haven't been able to figure out what's confusing gcc or Gambit. The error occurs at the end of initial compilation of the Scheme source files. The Makefile compiles them to c, then compiles the c files to a static library. I'm using the macos binary distribution from the Gambit home, which installs Gambit in /Library/Gambit and creates links to /usr/local. Is there anything that springs immediately to mind that I'm likely to be doing wrong? Thanks for any help.

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 Avril 2018