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

Quicksort, Timsort, Powersort - PyCon US 2023 talk - YouTube
by Bradley Lucier 05 Mar '24

05 Mar '24

https://www.youtube.com/watch?v=XjOnY-OLAPc This is cool, and may be useful. Found on the Racket "internals" Discord channel. Brad

1 0

[TFP (and TFPiE) 2024] Call For Participation (January 9-12, Seton Hall University, NJ, USA)
by Peter Achten 22 Déc '23

22 Déc '23

# TFP 2024 -- Call For Participation (trendsfp.github.io) ## Venue TFPiE and TFP will take place in-person at Seton Hall University, New Jersey in the United States. ## Dates TFPiE Workshop: Tuesday 9th January, 2024 TFP Symposium: Wednesday 10th - Friday 12th January, 2024 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. ## Keynote speakers We are happy to have the following keynotes in the programme: * Jeremy Gibbons, Oxford University * Benjamin Pierce, University of Pennsylvania * John Reppy, University of Chicago ## Programme The programme schedule can be found here: trendsfp.github.io/schedule.html ## Excursion and banquet After lunch on Thursday there is a private guided tour of the Thomas Edison National Historical Park and Museum. Thursday evening we have the TFP banquet at Forno's of Spain. During dinner the winners of the best paper awards of last year's TFP will be announced.

1 0

[TFP 2024 Final Call for Papers] 25th International Symposium on Trends in Functional Programming
by Peter Achten 30 Nov '23

30 Nov '23

# TFP 2024 -- Call for Papers (trendsfp.github.io) ## Important Dates Submission deadline: pre-symposium, full papers, Saturday 4 November, 2023 (AOE) Submission deadline: pre-symposium, draft papers, Friday 8 December, 2023 (AOE) Notification: pre-symposium full papers, Friday 8 December, 2023 Notification: pre-symposium draft papers, Thursday 14 December, 2023 Registration: Friday 5 January, 2024 TFPIE Workshop: Tuesday 9 January, 2024 TFP Symposium: Wednesday 10 - Friday 12 January, 2024 Submission deadline: post-symposium review, Friday 23 February, 2024 (AOE) Notification: post-symposium submissions, Friday 5 April, 2024 Camera-ready: post-symposium submissions, Friday 3 May, 2024 (AOE) 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. This year, TFP will take place in-person at Seton Hall University, in South Orange, NJ in the United States. It is co-located with the Trends in Functional Programming in Education (TFPIE) workshop, which will take on the day before the main symposium. Please be aware that TFP has several submission deadlines. The first, November 4, is for authors that wish to have their full paper reviewed prior to the symposium. Papers that are accepted in this way must also be presented at the symposium. The second, November 30, is for authors that wish to present their work or work-in progress at the symposium first without submitting to the full review process for publication. These authors can then take into account feedback received at the symposium and submit a full article for review by the third deadline, February 23. ## 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 2024 program chair, Jason Hemann. ## Best Paper Awards TFP awards two prizes for the best papers each year. First, to reward excellent contributions, TFP awards a prize for the best overall paper accepted for the post-conference formal proceedings. Second, each year TFP also awards a prize for the best student paper. 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 the paper's first authors, and a student would present the paper. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, then that paper will receive both prizes. ## Instructions to Authors Authors must submit papers to: https://easychair.org/conferences/?conf=tfp24 Authors of papers have the choice of having their contributions formally reviewed either before or after the Symposium. Further, pre-symposium submissions may either be full (earlier deadline) or draft papers (later deadline). ## Pre-symposium formal review Papers to be formally reviewed before the symposium should be submitted before the early deadline and will receive their reviews and notification of acceptance for both presentation and publication before the symposium. A paper that has been rejected for publication but accepted for presentation may be resubmitted 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 Guidelines web site: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… ## Organizing Committee Jason Hemann PC Chair Seton Hall University, USA Stephen Chang Symposium Chair University of Massachusetts Boston, USA Shajina Anand Local Arrangements Seton Hall University, South Orange, USA Peter Achten Publicity Chair Radboud University Nijmegen, Netherlands

1 0

Faculty position at Université de Montréal
by Marc Feeley 20 Nov '23

20 Nov '23

Our department has an open position for a new faculty member. Since some of the members of this list might be insterested I am forwarding the announcement. Fell free to share this announcement with any interested people or other mailing lists. Marc Feeley TENURE-TRACK FACULTY POSITION IN EMERGING FIELDS IN COMPUTER SCIENCE University of Montreal Faculty of Arts and Sciences Department of Computer Science and Operations Research (DIRO) Deadline: January 5th, 2024 The DIRO is seeking outstanding candidates for a full-time tenure-track faculty position at the rank of Assistant Professor starting on June 1, 2024. We are seeking candidates of exceptional scientific talent who have demonstrated research success and shown evidence of high potential in any emerging field of computer science related to, but not limited to, Internet of Things, Cyber-physical systems, Cybersecurity, Cloud computing and Infrastructure, Data management, Application of Software Engineering to an emerging field (digital twins, smart manufacturing), etc. Candidates working in the field of machine learning will not be considered for this position and are encouraged to apply to the corresponding open positions. The candidate has the possibility to become an academic member of the IVADO data science community. In addition, depending on their expertise and interest, they may be considered for an IVADO professorship, which offers enhanced start-up conditions. The candidate would then participate in the ambitious project (IAR3) for the development and adoption of robust, reasoning and responsible artificial intelligence, for which IVADO has just been awarded a Canada First Research Excellence Fund. The candidate is expected to teach undergraduate and graduate courses, supervise graduate students, be active in research, publication and the diffusion of knowledge, and contribute to the activities of the University. The position requires a Ph.D. in Computer Science or a related area, a strong research record illustrating the candidate's ability to publish influential work in top-tier venues of an emerging field, and a demonstrated ability to provide high quality university teaching. The University of Montreal is a Quebec university with an international reputation. French is the teaching language. Nevertheless, non-French speaking candidates are welcome to apply, since the university is intensively recruiting the world's best specialists to renew its teaching faculty. Furthermore, the university provides support for newly-recruited faculty to attain proficiency in French within a reasonable period of time. The University of Montreal offers competitive salaries and a full range of benefits. A complete application must include: a cover letter, resume, copies of recent publications demonstrating the candidate's research performance at the highest levels of an emerging field, a research statement, and a teaching statement. Three letters of recommendation must also be sent directly to the Department Chair by the referees. The application and letters of recommendation must be sent by email to the Chair of the DIRO before January 5th, 2024: Sylvie Hamel, Chair Department of Computer Science and Operations Research, Faculty of Arts and Science, Université de Montréal Email: mailto:directeur-EF@umontreal.ca Website: https://diro.umontreal.ca/ For more information on this position, please consult the official announcement at: https://diro.umontreal.ca/departement/offres-demploi/offre-demploi/news/det… For more information about the Department, please consult the website at: https://diro.umontreal.ca/english/home/ Informal inquiries are encouraged and should be directed to Prof. Sylvie Hamel directeur-EF(a)umontreal.ca <mailto:directeur-EF@umontreal.ca> or to myself.

1 0

Short example on how to use a shared library?
by Cleverson Casarin Uliana 09 Nov '23

09 Nov '23

Hello all, new to Gambit and scheme in general. I wanted to use some Windows API, so I searched for code snippets on how to load and call functions in a DLL, first on the FFI Cookbook[1], then at Rosetta Code[2], but no luck. Could anyone make a short example please? I know it is probably in the manual, but upon a quick search, I'm unable to identify what pieces exactly I should join to do it. One function I'd like to call is PlaySound, which is found in winmm.dll[3]. thanks for any help. [1] https://github.com/schemedoc/ffi-cookbook/ [2] https://rosettacode.org/wiki/Call_a_function_in_a_shared_library [3] https://learn.microsoft.com/en-us/previous-versions/dd743680(v=vs.85) Cleverson

1 0

Chudnovsky's Algorithm in Gambit Scheme - A novice's question
by Torbjörn Svensson Diaz 18 Aoû '23

18 Aoû '23

Hello! First of all, I don't know if this is the right place to ask this question. If you think not, please let me know. Maybe you think the question is too basic. I emphasize, it's not homework. Here's Chudnovsky's algorithm in Scheme. (define (pi (digits)) (let* ((A 13591409) (B 545140134) (C 640320) (C^3/24 (quotient (expt 640320 3) 24)) (D 12)) (define (-1^n*g n g) (if (odd? n) (- g) g)) (define (split m n) (if (= 1 (- n m)) (let* ((6n (* 6 n)) (g (* (- 6n 5) (- (+ n n) 1) (- 6n 1)))) (list g (* C^3/24 (expt n 3)) (* (-1^n*g n g) (+ (* n B) A)))) (let* ((mid (quotient (+ m n) 2)) (gpq1 (split m mid)) (gpq2 (split mid n)) (g1 (car gpq1)) (p1 (cadr gpq1)) (q1 (caddr gpq1)) (g2 (car gpq2)) (p2 (cadr gpq2)) (q2 (caddr gpq2))) (list (* g1 g2) (* p1 p2) (+ (* q1 p2) (* q2 g1)))))) (let* ((num-terms (inexact->exact (floor (+ 2 (/ digits 14.181647462))))) (sqrt-C (integer-sqrt (* C (expt 100 digits)))) (gpq (split 0 num-terms)) (g (car gpq)) (p (cadr gpq)) (q (caddr gpq))) (quotient (* p C sqrt-C) (* D (+ q (* p A))))))) ||| | |There's a C version of the same algorithm that is about sixteen times as long, so Scheme is expressive indeed. What I want to do is to compare the two implementations, ||but I get stuck and don't know how to proceed!| |First I want to write a version of the Scheme program that asks me how many digits I want to calculate and then calculate that using interpretation, but I don't manage to do that. Then I want to compile the Scheme code and see how fast it runs and how much RAM it uses. Lastly, I want to compile the C version and run it. I want to compare the performance and RAM usage in all three cases. | |Could you please help me out with the Scheme part? I guess I am supposed to use "read" somehow, but how? I am a Scheme novice. | |Best regards,| | | |-- | |Torbjörn Svensson Diaz | | |

3 3

Profiling for memory usage
by Sven Hartrumpf 16 Aoû '23

16 Aoû '23

Hi. I profile Gambit-compiled programs for runtime of functions by using the "perf" tool. But how can I profile programs for memory usage (allocations) of functions? Greetings Sven

3 3

[Call for submissions TFPiE 2024] Trends in Functional Programming in Education - January 9 2024, Seton Hall University, USA
by Peter Achten 08 Aoû '23

08 Aoû '23

TFPIE 2024 Call for papers https://wiki.tfpie.science.ru.nl/TFPIE2024 (January 9th 2024, West Orange, NJ, USA, co-located with TFP 2024 at Seton Hall University) TFPIE 2024 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. The length of the presentation should be comparable to that of a paper. In addition, the speaker can provide commentary on effectiveness or student feedback. Submissions Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 20 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 following link: https://easychair.org/conferences/?conf=tfpie2024 After the workshop, presenters are invited to submit (a revised version of) their article for the formal review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Important Dates Submission deadline: December 26th 2023, Anywhere on Earth Notification: by December 30th 2023 (Note: submissions will be evaluated on a rolling basis, so earlier submissions will receive an earlier response) TFPIE Registration Deadline: TBA Workshop: January 9th 2024 Submission for formal review: April 19th 2024, Anywhere on Earth. Notification of full article: May 24th 2024 Camera ready: June 28th 2024 Program Committee - TBD Stephen Chang (Chair) - UMass Boston, USA Registration information See https://wiki.tfpie.science.ru.nl/TFPIE2024 for updated information. Registration and attendance are mandatory for at least one author of every paper that is presented at the workshop. Presenters will have their registration fee waived. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process.

1 0

Analysis of gcc and -foptimize-sibling-calls: It seems things are good.
by Bradley Lucier 02 Aoû '23

02 Aoû '23

I built the current mainline gcc instrumented with --enable-coverage: heine:~/programs/gambit/gambit> /pkgs/gcc-mainline/bin/gcc -v Using built-in specs. COLLECT_GCC=/pkgs/gcc-mainline/bin/gcc COLLECT_LTO_WRAPPER=/pkgs/gcc-mainline/libexec/gcc/x86_64-pc-linux-gnu/14.0.0/lto-wrapper Target: x86_64-pc-linux-gnu Configured with: ../../gcc-mainline/configure --enable-coverage --enable-languages=c --disable-multilib --prefix=/pkgs/gcc-mainline --disable-werror Thread model: posix Supported LTO compression algorithms: zlib gcc version 14.0.0 20230802 (experimental) (GCC) and built Gambit with heine:~/programs/gambit/gambit> gsi/gsi -v v4.9.5-3-ge059fffd 20230730151945 x86_64-pc-linux-gnu "./configure 'CC=/pkgs/gcc-mainline/bin/gcc' '--enable-single-host' '--enable-trust-c-tco'" The code to "optimize" sibling calls is split between gcc/tree-tailcall.cc (suitable_for_tail_opt_p and suitable_for_tail_call_opt_p) and gcc/calls.cc (dealt with in maybe_complain_about_tail_call). I think tree-tailcall.cc deals with target-independent transformations, while calls.cc deals with low-level, target-dependent transformations. Because of this split, and having three places where this optimization can be interrupted/reported, it's not clear to me where to place a warning. By examining the .gcov files, for gcc/tree-tailcall.cc and gcc/calls.cc I can see that every tail call in the Gambit source tree was "optimized". Brad

1 0

Performance
by Torbjörn Svensson Diaz 29 Jul '23

29 Jul '23

Hello! "With appropriate declarations in the source code the compiled Scheme programs run roughly as fast as equivalent C programs." This is from the manual. What is "roughly as fast"? 90% of C speed? 50% of C speed? Are there some benchmarks? Best regards, -- T.

2 1