- Haskell-Cafe - Haskell.org

GHC 9.12.3 status update
by Zubin Duggal 28 Oct '25

28 Oct '25

Hi all, I'm currently working on the final set of backports for GHC 9.12.3-rc2. This has been delayed due to #26166 making bootstrapping GHC impossible on the new macOS release. I am currently in the process of backporting the fix for this ticket (among a few other patches) to GHC 9.12. I expect to have rc2 out in the next few days, by the end of this week. Cheers, Zubin. #26166: https://gitlab.haskell.org/ghc/ghc/-/issues/26166

1 0

Adding `reverse` and `sortBy` to `Traversable`
by Keith 27 Oct '25

27 Oct '25

Folks[1] have known for a long time that `reverse` and `sortBy` can both be implemented in terms of `mapAccumL`. Would it make sense to add those to `Data.Traversable` as functions or methods? [1] For example, Will Fancher wrote about it in 2017. --- Sent from my phone with K-9 Mail.

2 1

TFPiE 2026, second call for submissions
by Mart Lubbers 27 Oct '25

27 Oct '25

TFPIE 2026 Call for papers https://wiki.tfpie.science.ru.nl/TFPIE2026 (January 26th 2026, Odense, Denmark, co-located with TFP 2026 at University of Southern Denmark) TFPIE 2026 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/my/conference?conf=tfpie26 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 2025, Anywhere on Earth Notification: by December 30th 2025 (Note: submissions will be evaluated on a rolling basis, so earlier submissions will receive an earlier response) TFPIE Registration Deadline: TBA Workshop: January 26th 2026 Submission for formal review: April 22nd 2026, Anywhere on Earth Notification of full article: May 27th 2026 Camera ready: June 24th 2026 ## Program Committee Mart Lubbers, Radboud University, Nijmegen, Netherlands (PC Chair) Tim Steenvoorden, Open Universitei, Heerlen, Netherlands Marco T. Morazán, Seton Hall University, South Orange, NJ, USA Guannan Wei, Tufts University, Medford, MA, USA Marcos Viera, Universidad de la República, Montevideo, Uruguay Johannes Åman Pohjola, Chalmers University of Technology, Götenburg, Sweden ## Registration information See https://wiki.tfpie.science.ru.nl/TFPIE2026 for updated information. Registration and attendance are mandatory for at least one author of every paper that is presented at the workshop. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process.

1 0

POPL 2026 Call for Student Volunteers
by Ningning Xie 14 Oct '25

14 Oct '25

*Call for Student Volunteers* Sign up to be a Student Volunteer and help us make POPL 2026 a unique experience for all attendants! POPL 2026 is pleased to offer a number of opportunities for student volunteers, who are vital to the efficient operation and continued success of the conference each year. The student volunteer program is a chance for students from around the world to participate in the conferences whilst assisting us in preparing and running the event. The Student Volunteer Program helps more students attend the POPL conference by covering registration to the conferences, tutorials, workshops, and all associated events (but not travel or lodging expenses). In exchange for a fixed number of work hours (around 18) helping with the conference organization, you will be able to closely interact with researchers, mentors, and other students at POPL 2026. We are looking forward to seeing you in the SV team! *Eligibility* Applicants can be undergraduate, Master’s, Ph.D. full- or part-time students, of computer science or related fields, with or without previous experience as volunteers. Everyone is encouraged to apply! *Duration* Applicants must be available for at least four (4) full days between the 11th and 17th of January 2026, and will be expected to provide at least 18 hours of volunteering work in that time. Volunteers will also be expected to be available for some amount of pre-conference discussion and training if necessary. *Compensation* Every student volunteer will receive: - A complimentary conference registration, offering access to all open sessions (i.e., parallel paper presentations, demonstrations, and workshops) and conference proceedings. - Free lunches and refreshments during breaks. - Student volunteer garments. Please note that Student Volunteers are responsible for their own travel and accommodation arrangements. However, Student Volunteers can apply for extra funding from SIGPLAN PAC funding or PLMW when eligible. You can send questions about student volunteering to Aurèle Barrière ( aurele.barriere(a)epfl.ch) and Stephen Mell (sm1(a)cis.upenn.edu) *Applications* To apply, fill out the form on this link, before November 10th: https://forms.gle/YiMy1PXVF6QWggsb8 <https://urldefense.com/v3/__https://forms.gle/YiMy1PXVF6QWggsb8__;!!IBzWLUs…> . The form is very short and won’t take more than 5 minutes to complete. We will NOT evaluate the applications in a first come first serve order. *Deadline for submission: November 10th 2025, AoE.*

1 0

Re: fplangc
by Anthony Clayden 13 Oct '25

13 Oct '25

Hi Asher, good question! I've been waiting in case 'former members' might respond. You're presumably aware of Wadler's 'Proposal: Overloading in Haskell' 1988 that originally appeared on fplangc. Link from https://homepages.inf.ed.ac.uk/wadler/topics/type-classes.html I've tried the wayback machine for fplangc(a)cs.ucl.ac.uk, but got nothing useful. The repository I dig through is on wayback (various save dates) http://web.archive.org/web/20151208175102/http://code.haskell.org/~dons/has… The earliest 1990 threads are clearly continuations from somewhere. If ~dons (Don Stewart) kept archives of those, they're defeating my google-fu. But hmmm, wayback is unreliable: it can peremptorily just delete stuff if it gets a copyright strike, or for no apparent reason. The Haskell developers (for Hugs and ghc) generally published papers with the motivations for their innovations. What additional to that thinking do you hope to find in the mailing lists? Good luck! AntC

1 0

PEPM 2026: Second Call for Papers
by Ningning Xie 08 Oct '25

08 Oct '25

CALL FOR PAPERS The 2026 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation https://popl26.sigplan.org/home/pepm-2026 # Important Dates, AoE, UTC-12h Paper due Fri 25 Oct 2025 Notification Fri 28 Nov 2025 Workshop Tue 13 Jan 2026 # About The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) has a history going back to 1991 and has been held in conjunction with POPL every year since 2006. The origin of PEPM is in the discoveries of practically useful automated techniques for evaluating programs with only partial input. Over time, PEPM has broadened its scope to include a variety of research areas centered around semantics-based program manipulation — the systematic exploitation of treating programs not only as subject to black-box execution, but also as data structures that can be generated, analyzed, and transformed while establishing or maintaining important semantic properties. # Scope Topics of interest for PEPM 2026 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. * Cross-fertilization with other fields, such as semantics based and machine-learning based program synthesis and program optimisation, and modeling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Yukiyoshi Kameyama (kameyama at acm.org) and Ningning Xie (ningningxie at cs.toronto.edu) # Submission Categories and Guidelines Three kinds of submissions will be accepted: 1. Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages. 2. Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar. Short papers must not exceed 6 pages. 3. Talk Proposals may propose lectures about topics of interest for PEPM, existing work representing relevant contributions, or promising contributions that are not mature enough to be proposed as papers of the other categories. Talk Proposals must not exceed 2 pages. References and appendices are not included in page limits. Appendices may not necessarily be read by reviewers. All the submissions should be typeset using the two-column ‘sigplan’ sub-format of the new ‘acmart’ format available at: https://sigplan.org/Resources/Author/ and submitted electronically via HotCRP: https://pepm26.hotcrp.com Reviewing will be single-blind. Submissions are welcome from PC members (except the two co-chairs). Accepted regular research papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Accepted short papers do not constitute formal publications and will not appear in the proceedings. At least one author of each accepted contribution must attend the workshop (physically or virtually) to present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. ## Program co-chairs Yukiyoshi Kameyama, University of Tsukuba, Japan Ningning Xie, University of Toronto, Canada ## PC members Kenichi Asai, Ochanomizu University Robert Atkey, University of Strathclyde Stephanie Balzer, CMU William J. Bowman, University of British Columbia Paul Downen, University of Massachusetts, Lowell Sebastian Erdweg, JGU Mainz Robert Glück, University of Copenhagen Zhenjiang Hu, Peking University Yusuke Izawa, Tokyo Metropolitan University Naoki Kobayashi, University of Tokyo Geoffrey Mainland, Drexel University Keisuke Nakano, Tohoku University Lionel Parreaux, Hong Kong University of Science and Technology Morten Rhiger, Roskilde University Tom Schrijvers, KU Leuven Guannan Wei, Tufts University Leo White, Jane Street

1 0

package takeover request: bumper
by Artem Pelenitsyn 07 Oct '25

07 Oct '25

Hey all, I'm interested in taking over https://hackage.haskell.org/package/bumper The package has not seen updates in a long while, so I assume it's fine with the previous maintainer but I CC the email listed in the maintainer field of the package description. -- Best, Artem

1 0

fplangc
by Asher Olsen 06 Oct '25

06 Oct '25

As an enthusiast of programming language history, I think it would be valuable to make archives of the original Haskell design mailing list FPLANGC, if they exist anywhere, publically available online. Such accessible archives exist for Common Lisp and Scheme (< http://cl-su-ai.lisp.se/threads.html> and < https://groups.csail.mit.edu/mac/projects/scheme/rrrs-archive.html>). Would that be possible (addressing any former members of that list who might be reading this)? Thanks, Asher Olsen

1 0

TFPIE 2026 - Call for Papers
by Mart Lubbers 29 Sep '25

29 Sep '25

TFPIE 2026 Call for papers https://wiki.tfpie.science.ru.nl/TFPIE2026 (January 26th 2026, Odense, Denmark, co-located with TFP 2026 at University of Southern Denmark) TFPIE 2026 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=tfpie2026 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: Workshop: January 26th 2026 Submission for formal review: April 22nd 2026, Anywhere on Earth Notification of full article: May 27th 2026 Camera ready: June 24th 202 ## Program Committee Mart Lubbers, Radboud University, Nijmegen, Netherlands (PC Chair) Tim Steenvoorden, Open Universitei, Heerlen, Netherlands Marco T. Morazán, Seton Hall University, South Orange, NJ, USA Guannan Wei, Tufts University, Medford, MA, USA Marcos Viera, Universidad de la República, Montevideo, Uruguay Johannes Åman Pohjola, Chalmers University of Technology, Götenburg, Sweden ## Registration information See https://wiki.tfpie.science.ru.nl/TFPIE2026 for updated information. Registration and attendance are mandatory for at least one author of every paper that is presented at the workshop. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process.

1 0

[TFP 2026] Call for Papers for the 27th International Symposium on Trends in Functional Programming, Odense, Denmark, January 2026
by Peter Achten 22 Sep '25

22 Sep '25

# TFP 2026 -- Call for Papers (trendsfp.github.io) ## Important Dates * Submission deadline (pre-symposium, full papers): Thu 13th Nov 2025 (AOE) * Notification (pre-symposium, full papers): Thu 11th Dec 2025 * Submission deadline (pre-symposium draft papers): Thu 11th Dec 2025 (AOE) * Notification (pre-symposium draft papers): Fri 19th Dec 2025 * Submission deadline (post-symposium review): Thu 5th Mar 2026 (AOE) * Notification (post-symposium submissions): Thu 16th Apr 2026 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 the University of Southern Denmark, in Odense, Denmark. 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, 13th November, is for authors who 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, 11th December, is for authors who 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 paper for review by the third deadline, 19th February. ## 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 paper categories. High-quality submissions are solicited in any of these categories: * Research Papers: Leading-edge, previously unpublished research work * Position Papers: On what new trends should or should not be * Project Papers: Descriptions of recently started new projects * Evaluation Papers: What lessons can be drawn from a finished project * Overview Papers: Summarizing work with respect to a trendy subject Papers 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 paper is within the scope of TFP, please contact the programme chair, Casper Bach. ## 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 Submission is via HotCRP: https://tfp26.hotcrp.com/ 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). See below for more details. Submission is single-blind. Submissions are welcome from PC members (except the chair). Accepted papers from the pre-symposium and post-symposium formal review will appear in a formal proceedings, published by Springer. 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…) ### 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 revised and 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 received at the symposium. A post-symposium refereeing process will then select a subset of these papers 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 (up to 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. ## Organizing Committee | Casper Bach | University of Southern Denmark, DK | Programme Chair | | Jeremy Gibbons | University of Oxford | General Chair | | Peter Achten | Radboud University Nijmegen, NL | Publicity Chair | | Marco T. Morazán | Seton Hall University, US | Steering Committee Chair | ## Programme Committee | Alex Gerdes | University of Gothenburg and Chalmers, SE | | Andrew Tolmach | Portland State University, US | | Ben Greenman | University of Utah, US | | Bruno Oliveira | University of Hong Kong, HK | | Cas van der Rest | Shielded Technologies, NL | | Cristina Matache | University of Edinburgh, UK | | Di Wang | Peking University, CN | | Dylan McDermott | University of Oxford, UK | | Eric Van Wyk | University of Minnesota, US | | Jan de Muijnck-Hughe | Strathclyde, UK | | Jeremy Yallop | University of Cambridge, UK | | Jesper Cockx | Delft University of Technology, NL | | Jules Jacobs | Cornell University, US | | Mart Lubbers | Radboud University, NL | | Matthew Lutze | Aarhus University, DK | | Max S. New | University of Michigan, US | | Nicolas Wu | Imperial College London, UK | | Patrick Bahr | IT University of Copenhagen, DK |

1 0

GHC 9.12.3-rc1 is now available
by Zubin Duggal 22 Sep '25

22 Sep '25

The GHC developers are very pleased to announce the availability of the release candidate for GHC 9.12.3. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][] and via [GHCup](https://www.haskell.org/ghcup/). GHC 9.12.3 is a bug-fix release fixing several issues of a variety of severities and scopes. A full accounting of these fixes can be found in the [release notes][]. As always, GHC's release status, including planned future releases, can be found on the GHC Wiki [status][]. This release candidate will have a two-week testing period. If all goes well the final release will be available the week of 2 October 2025. We would like to thank Well-Typed, Tweag I/O, Juspay, QBayLogic, Channable, Serokell, SimSpace, the Haskell Foundation, and other anonymous contributors whose on-going financial and in-kind support has facilitated GHC maintenance and release management over the years. Finally, this release would not have been possible without the hundreds of open-source contributors whose work comprise this release. As always, do give this release a try and open a [ticket][] if you see anything amiss. [release notes]: https://gitlab.haskell.org/ghc/ghc/-/blob/ghc-9.12/docs/users_guide/9.12.3-… [status]: https://gitlab.haskell.org/ghc/ghc/-/wikis/GHC-status [downloads.haskell.org] https://downloads.haskell.org/ghc/9.12.3-rc1 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new

1 0

Haskell Symposium 2025 Last Call for Talks (deadline Sept 15th)
by Ningning Xie 14 Sep '25

14 Sep '25

======================================================== Haskell Symposium 2025 Call for Talks Thu 16 - Fri 17 Oct 2025, Singapore https://conf.researchr.org/home/icfp-splash-2025/haskellsymp-2025 ======================================================== The ACM SIGPLAN Haskell Symposium 2025 will be co-located with the 2025 International Conference on Functional Programming (ICFP) and the 2025 International Conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH). The Haskell Symposium presents original research on Haskell, discusses practical experience and future development of the language, and promotes other forms of declarative programming. We invite proposals from potential speakers for talks. Talk proposals should report work in progress relevant to Haskell language design, theory, tools, or applications. Talks are proposed by submitting an abstract. Please submit a talk title and abstract of no more than 300 words. There will be no published proceedings. Papers should be submitted through HotCRP at: https://haskell25.hotcrp.com/ Submission deadline: 15 September 2025 (Mon) Deadlines are valid anywhere on Earth. Talk proposals will go through a lightweight reviewing process, evaluated by the PC for relevance to the Haskell community, but are not expected to include finished results. Talk proposals will not be distributed to attendees, but authors of talk proposals may provide links to materials to be included on the program. Topics of interest include: * Language design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal semantics of the present language or future extensions, type systems, effects, metatheory, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management, as well as foreign function and component interfaces; * Libraries, that demonstrate new ideas or techniques for functional programming in Haskell; * Tools, such as profilers, tracers, debuggers, preprocessors, and testing tools; * Applications, to scientific and symbolic computing, databases, multimedia, telecommunication, the web, and so forth; * Experience Reports, to document general practice and experience in education, industry, or other contexts; * System Demonstrations, based on running software rather than novel research results.

1 0

[Call for participation]: North American Haskell Hackathon in New York
by Jose Calderon 13 Sep '25

13 Sep '25

Hello Haskell Cafe, The Haskell Foundation is proud to announce the inaugural AmeriHac, a two day haskell hackathon, with this iteration being in New York City! Jane Street has kindly offered to host the Haskell Foundation’s first North American Haskell event. The event will take place on Feb 7th and Feb 8th 2026 within Jane Street’s New York premises (https://maps.app.goo.gl/eHweQfEGkRJiYkct6) Registration will be free, thanks to Jane Street’s generosity as hosts. ## Organization Much like ZuriHac, there will be dedicated space for specific projects (GHC, cabal, stack, etc.), with the full details being determined by registrant interest. The webpage, https://haskell.foundation/events/2026-amerihac.html, will be updated with more information as we finalize keynote speakers and the schedule. ## Summary: - Who: Haskell Foundation and Jane Street - What: Weekend Haskell hackathon - Where: Jane Street NYC (https://maps.app.goo.gl/eHweQfEGkRJiYkct6) Register here: https://forms.gle/3dZvn3VAvwa3JgJK8 We look forward to seeing you there! -Jose

1 0

GHC 9.10.3 is now available
by Zubin Duggal 11 Sep '25

11 Sep '25

The GHC developers are very pleased to announce the availability of the final release for GHC 9.10.3. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][]. GHC 9.10.3 is a bug-fix release fixing many issues of a variety of severities and scopes, including: * Fix a number of crashes in the compiler frontend (#25960, #25004, #25056) * Fix incorrect results in the NCG (#25601, #26061) * Support for far jumps in the AArch64 NCG (#24648) * A fix for a segfault in the RTS when running certain code involving STM (#26205) * And many more! A full accounting of these fixes can be found in the [release notes][]. As always, GHC's release status, including planned future releases, can be found on the GHC Wiki [status][]. We would like to thank Well-Typed, Tweag I/O, Juspay, QBayLogic, Channable, Serokell, SimSpace, the Haskell Foundation, and other anonymous contributors whose on-going financial and in-kind support has facilitated GHC maintenance and release management over the years. Finally, this release would not have been possible without the hundreds of open-source contributors whose work comprise this release. As always, do give this release a try and open a [ticket][] if you see anything amiss. [release notes]: https://downloads.haskell.org/~ghc/9.10.3/docs/users_guide/9.10.3-notes.html [status]: https://gitlab.haskell.org/ghc/ghc/-/wikis/GHC-status [downloads.haskell.org] https://downloads.haskell.org/ghc/9.10.3 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new

1 0

CGO 2026 - Call For Tutorials
by Luisa Cicolini 10 Sep '25

10 Sep '25

Dear all, This is a reminder that only one week is left to submit tutorial proposals<https://2026.cgo.org/track/cgo-2026-workshops-and-tutorials> for CGO 2026 (deadline 17th September). The International Symposium on Code Generation and Optimization (CGO) provides a premier venue to bring together researchers and practitioners working at the interface of hardware and software on a wide range of optimization and code generation techniques and related issues. The conference spans the spectrum from purely static to fully dynamic approaches, and from pure software-based methods to specific architectural features and support for code generation and optimization. CGO will be held in Sydney, Australia from 31st January – 4th February 2026 and tutorials (half- or full-day) will be held before the main conference. Best, Luisa

1 0

[ANN] Copilot 4.5.1
by Ivan Perez 09 Sep '25

09 Sep '25

Hi everyone!! We are really excited to announce Copilot 4.5.1 [1,2]. Copilot is a stream-based EDSL in Haskell for writing and monitoring embedded C programs, with an emphasis on correctness and hard realtime requirements. Copilot is typically used as a high-level runtime verification framework, and supports temporal logic (LTL, PTLTL and MTL), clocks and voting algorithms. Compilation to Bluespec, to target FPGAs, is also supported. Copilot is NASA Class D open-source software, and is being used at NASA in drone test flights. Through the NASA tool Ogma [3] (also written in Haskell), Copilot also serves as a programming language and runtime framework for NASA's Core Flight System, Robot Operating System (ROS2), FPrime (the software framework used in the Mars Helicopter). Ogma now supports producing flight and robotics applications directly in Copilot, not just for monitoring, but for implementing the logic of the applications themselves. Since the last announcement, the major updates and improvements are: - Copilot maintream now includes the verification, FPGA and visualization backends. - Copilot now includes a tutorial showing how to generate code for FPGA and run it (thanks to Sukhman Kahlon!). - Compatibility with newer versions of dependencies has been extended. - Cleaning efforts in `copilot-theorem`, and `copilot-core`. A picture of the Copilot visualizer can be seen at [5]. The new implementation is compatible with versions of GHC from 8.6 to 9.12. This release has been made possible thanks to key submissions from Sukhman Kahlon (NASA). We also thank Corey Carter (NASA), Ryan Scott (Galois) and Kaveh Zare (NASA) for their input. We are grateful to them for their contributions, and for making Copilot better every day. For details on this release, see [1]. As always, we're releasing exactly 2 months since the last release. Our next release is scheduled for Nov 7th, 2025. We want to remind the community that Copilot is now accepting code contributions from external participants again. Please see the discussions and the issues in our github repo [4] to learn how to participate. Current emphasis is on using Copilot for full data processing applications (e.g, system control, arduinos, rovers, drones), improving usability, performance, and stability, increasing test coverage, removing unnecessary dependencies, hiding internal definitions, and formatting the code to meet our coding standards. Users are encouraged to participate by opening issues, asking questions, extending the implementation, and sending bug fixes. Happy Haskelling! Ivan -- [1] https://github.com/Copilot-Language/copilot/releases/tag/v4.5.1 [2] https://hackage.haskell.org/package/copilot [3] https://github.com/nasa/ogma [4] https://github.com/Copilot-Language/copilot [5] https://www.reddit.com/r/haskell/comments/1nci0u6/ann_copilot_451/

1 0

IFL2025 Call for Participation
by Mart Lubbers 05 Sep '25

05 Sep '25

========================================================== Call for Participation IFL 2025 37th Symposium on Implementation and Application of Functional Languages Montevideo, Uruguay October 1-3, 2025 (Tutorials September 29-30) https://www.fing.edu.uy/inco/congresos/ifl2025 ========================================================== 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 2025 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. ### Registration The registration fee covers use of facilities, participation in the tutorials and symposium, lunches, coffee breaks, social outing, symposium dinner and access to draft proceedings. Early Bird Registration Deadline is Sep 5, 2025. https://www.fing.edu.uy/inco/congresos/ifl2025/register.html If you choose online payment at registration, you will receive payment instructions during the week. ### Keynote speakers Roberto Ierusalimschy Departamento de Informática, PUC-Rio, Río de Janeiro, Brazil Functions in Lua Iván Pérez NASA Ames Research Center, California, USA Making Haskell Fly https://www.fing.edu.uy/inco/congresos/ifl2025/keynotes.html ### Tutorials On September 29 and 30, the two days prior to the symposium, four tutorials will be held: Gradual typing Éric Tanter, University of Chile, Chile Type Based Static Analysis Jurriaan Hage, Heriot-Watt University, UK Development of dApps in the UTxO model TxPipe, Argentina Programming-Based Automata Theory Marco T. Morazán, Seton Hall University, USA https://www.fing.edu.uy/inco/congresos/ifl2025/tutorials.html ### Accepted Papers Regular Papers: Compilation of the Stochastic Language ALEA, Baltasar Trancón Y Widemann and Markus Lepper. Design and Implementation of DSLs for Unit Testing, Marco T. Morazán and Andres Garced. Recipe-Based Errors: Methodology, Implementation, and Evaluation, Marco T. Morazán, Shamil Dzhatdoyev, Josephine Des Rosiers, Rose Bohrer, Andres Garced and David Anthony Fields. Refinement-Types Driven Development: A study, Facundo Domínguez and Arnaud Spiwack. Draft Papers: AI-Assisted Program Design Using Structural Recursion, Marco T. Morazán. A Quantum-Control Lambda-Calculus with Multiple Measurement Bases, Nicolas A. Monzon and Alejandro Díaz-Caro. Automatic Testing for Finite-State Machines, Marco T. Morazán, Sophia G. Turano, Andres Garced and David Anthony Fields. Closures in a Higher-Order Polymorphic DSL for GPU programming, Andre Rauber Du Bois, Henrique Gabriel Rodrigues and Rodrigo Geraldo Ribeiro. Energy-aware Data-Parallel Functional Array Processing for Heterogeneous Platforms, Clemens Grelck. Formalizating System I with type Top in Agda, Agustín Séttimo, Cristian Sottile and Cecilia Manzino. Foundations of Gradual Abstract Interpretation, Gaspar Ricci, Sebastian Erdweg, Éric Tanter and Matías Toro. Heuristics-based Type Error Diagnosis for Haskell: the case of type families, Niels Kwadijk and Jurriaan Hage. Higher-ranked region inference for polymorphic, lazy languages, Ivo Gabe de Wolff and Jurriaan Hage. Improving a Group Membership Protocol Implementation using Liquid Haskell and QuickCheck, Jianhao Li and Viktoria Zsok. List Fold Operators in Dafny, Juan Michelini, Nora Szasz and Alvaro Tasistro. Reducibility candidates modulo isomorphisms, Cristian Sottile and Alejandro Díaz-Caro. Type Checking Dependently Sorted Nominal Signatures, Maribel Fernandez, Miguel Pagano, Nora Szasz and Alvaro Tasistro. Unrestricted Grammar Design and Visualization: A Design Recipe and Dynamic Visualization Tool, Marco T. Morazán, Andres Garced and Tijana Minić.

1 0

Haskell Symposium 2025 Call for Talks (deadline Sept 15th)
by Ningning Xie 02 Sep '25

02 Sep '25

======================================================== Haskell Symposium 2025 Call for Talks Thu 16 - Fri 17 Oct 2025, Singapore https://conf.researchr.org/home/icfp-splash-2025/haskellsymp-2025 ======================================================== The ACM SIGPLAN Haskell Symposium 2025 will be co-located with the 2025 International Conference on Functional Programming (ICFP) and the 2025 International Conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH). The Haskell Symposium presents original research on Haskell, discusses practical experience and future development of the language, and promotes other forms of declarative programming. We invite proposals from potential speakers for talks. Talk proposals should report work in progress relevant to Haskell language design, theory, tools, or applications. Talks are proposed by submitting an abstract. Please submit a talk title and abstract of no more than 300 words. There will be no published proceedings. Papers should be submitted through HotCRP at: https://haskell25.hotcrp.com/ Submission deadline: 15 September 2025 (Mon) Deadlines are valid anywhere on Earth. Talk proposals will go through a lightweight reviewing process, evaluated by the PC for relevance to the Haskell community, but are not expected to include finished results. Talk proposals will not be distributed to attendees, but authors of talk proposals may provide links to materials to be included on the program. Topics of interest include: * Language design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal semantics of the present language or future extensions, type systems, effects, metatheory, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management, as well as foreign function and component interfaces; * Libraries, that demonstrate new ideas or techniques for functional programming in Haskell; * Tools, such as profilers, tracers, debuggers, preprocessors, and testing tools; * Applications, to scientific and symbolic computing, databases, multimedia, telecommunication, the web, and so forth; * Experience Reports, to document general practice and experience in education, industry, or other contexts; * System Demonstrations, based on running software rather than novel research results.

1 0

Takeover of AvlTree and COrdering
by Andrew Lelechenko 22 Aug '25

22 Aug '25

I’d like to take over Hackage packages https://hackage.haskell.org/package/COrdering and https://hackage.haskell.org/package/AvlTree. Last uploads were in 2008. Both packages fail to compile with modern GHCs; my intention is to bring them back to life. There are no maintainer contacts and no source code repository linked, so I cannot reach out to the maintainer to offer my services. Best regards, Andrew

1 0

GHC 9.10.3-rc4 is now available
by Zubin Duggal 18 Aug '25

18 Aug '25

The GHC developers are very pleased to announce the availability of the fourth release candidate for GHC 9.10.3. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][] and via [GHCup](https://www.haskell.org/ghcup/). GHC 9.10.3 is a bug-fix release fixing over 50 issues of a variety of severities and scopes. A full accounting of these fixes can be found in the [release notes][]. As always, GHC's release status, including planned future releases, can be found on the GHC Wiki [status][]. The changes from the third release candidate are: - A fix for a rare segfault with code involving STM (#26205) - A fix for the `naturalAndNot` returning bogus results (#26205) - A fix for a crash in the renamer (#25056) This release candidate will have a two-week testing period. If all goes well the final release will be available the week of 1 September 2025. We would like to thank Well-Typed, Tweag I/O, Juspay, QBayLogic, Channable, Serokell, SimSpace, the Haskell Foundation, and other anonymous contributors whose on-going financial and in-kind support has facilitated GHC maintenance and release management over the years. Finally, this release would not have been possible without the hundreds of open-source contributors whose work comprise this release. As always, do give this release a try and open a [ticket][] if you see anything amiss. [release notes]: https://gitlab.haskell.org/ghc/ghc/-/blob/ghc-9.10/docs/users_guide/9.10.3-… [status]: https://gitlab.haskell.org/ghc/ghc/-/wikis/GHC-status [downloads.haskell.org] https://downloads.haskell.org/ghc/9.10.3-rc4 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new

1 0

GHC 9.10.3-rc3 is now available
by Zubin Duggal 08 Aug '25

08 Aug '25

The GHC developers are very pleased to announce the availability of the third release candidate for GHC 9.10.3. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][] and via [GHCup](https://www.haskell.org/ghcup/). GHC 9.10.3 is a bug-fix release fixing over 50 issues of a variety of severities and scopes. A full accounting of these fixes can be found in the [release notes][]. As always, GHC's release status, including planned future releases, can be found on the GHC Wiki [status][]. The changes from the second release candidate are: - Reverting a change the exports of the `Backtrace` constructor in the base library that was backported due to confusion on CLC approvals (!14587) - Reverting a change to the configure script (!14324) that dropped probing for ld.gold This release candidate will have a two-week testing period. If all goes well the final release will be available the week of 22 August 2025. We would like to thank Well-Typed, Tweag I/O, Juspay, QBayLogic, Channable, Serokell, SimSpace, the Haskell Foundation, and other anonymous contributors whose on-going financial and in-kind support has facilitated GHC maintenance and release management over the years. Finally, this release would not have been possible without the hundreds of open-source contributors whose work comprise this release. As always, do give this release a try and open a [ticket][] if you see anything amiss. [release notes]: https://gitlab.haskell.org/ghc/ghc/-/blob/ghc-9.10/docs/users_guide/9.10.3-… [status]: https://gitlab.haskell.org/ghc/ghc/-/wikis/GHC-status [downloads.haskell.org] https://downloads.haskell.org/ghc/9.10.3-rc3 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new

2 1

Correct parsers for bounded integral values
by Stefan Klinger 08 Aug '25

08 Aug '25

Hello everybody =) I've been bugged by the silent overflowing of integer parsers as provided by `base`, `attoparsec`, and others. I'd go so far as to call it a bug when the user types `298` and the parser says `Right 42`. Unfortunately, all parsing libraries I've looked at get this wrong. A [solution][4] is proposed below. I'm asking for feedback on how to continue from here. Kind regards Stefan The following examples can be reproduced with $ git clone 'https://github.com/s5k6/robust-int.git' $ cd robust-int $ cabal repl robust-int:demo Situation --------- This is the current situation with [read][1] from base: > read "298" :: Word8 42 And with [decimal][2] from attoparsec: > A.parseOnly (A.decimal :: A.Parser Word8) $ pack "298" Right 42 And the solution [usually suggested][5] for Parsec (which relies on `read`): parsecWord8 :: P.Parser Word8 parsecWord8 = read <$> P.many1 P.digit > P.runParser parsecWord8 () "" "298" Right 42 Even worse, the latter would rather exhaust memory than realise its input is way out of bounds: > P.runParser parsecWord8 () "" $ repeat '1' ⊥ Also, some 3rd-party libraries get this wrong, e.g., [parsec3-numbers][6]: > P.runParser (PN.decimal :: P.Parser Word8) () "" "298" Right 42 And [megaparsec][8], which is at least nice enough to warn about this in its documentation: > M.parseMaybe (M.decimal :: M.Parsec () String Word8) "298" Just 42 I find this misses the point of a parser validating its input. Solution -------- It is [possible to implement][7] parsers for bounded integral types which verify the bounds of the parsed value *while* parsing, and even doing this without the use of a “bigger” type. The idea is as follows: As usual, we parse digits left to right, and collect the resulting value in an accumulator `acc`, i.e., for each new digit `d`, the accumulator is updated to base * acc + d Nothing new up to here. However, before we start parsing, calculate (lim, m) = upper_bound `divMod` base and before updating the accumulator with another digit `d`, verify that acc < lim || (acc == lim && d <= m) which exactly guarantees that the accumulator will not overflow. The reason why this works is is easily seen by doing the example for `Word16` in base 10: > (maxBound :: Word16) `divMod` 10 (6553,5) > 10 * fst it + snd it 65535 Complexity: This adds a modulo operation and two comparisons for every literal being parsed, plus one comparison for every digit. In order to limit memory consumption, some comparison has to take place during parsing, at least for limiting the number of digits consumed. In total, this does not look too expensive. I have [implemented][4] this idea for `parsec` and `attoparsec` to demonstrate the idea (only for decimal values). What now? --------- Obviously, this *should not be a another library*, trying to fix some aspect of some other libraries. My code is rather intended for demonstration. I'd prefer to help this idea migrate to the libraries (`base`, `parsec`, `attoparsec`, …), where the correct parsers should be. Unfortunately, I got a bit lost when trying to track down the code of `read` in the `base` package. And I think I may have overengineered my solution for attoparsec to accommodate different stream types. Also, I get the impression that Haskell *library* code seems to be written with a different mindset, a deeper understanding of GHC than mine, i.e., more tailored to what the compiler will *actually do* when using the code, trying not to spoil opportunities for optimisation. And I'm not sure I'm up to that task. So I'm asking for feedback on the proposed algorithm, my implementation, and hints on where and how to get this into established libraries. Build instructions ================== $ cabal build $ cabal run demo $ cabal test $ cabal haddock [1]: https://hackage.haskell.org/package/base-4.21.0.0/docs/Prelude.html#v:read [2]: https://hackage.haskell.org/package/attoparsec-0.14.4/docs/Data-Attoparsec-… [3]: https://hackage.haskell.org/package/parsec-3.1.18.0/docs/Text-Parsec-Token.… [4]: https://github.com/s5k6/robust-int [5]: https://stackoverflow.com/questions/24171005/how-to-parse-an-integer-with-p… [6]: https://hackage.haskell.org/package/parsec3-numbers [7]: https://github.com/s5k6/robust-int/blob/master/src/Data/RobustInt/Parsec.hs… [8]: https://hackage.haskell.org/package/megaparsec-9.7.0/docs/Text-Megaparsec-C… -- Stefan Klinger, Ph.D. -- computer scientist o/X http://stefan-klinger.de /\/ https://github.com/s5k6 \ I prefer receiving plain text messages, not exceeding 32kB.

9 23

TargirDotCom
by walid falcon 07 Aug '25

07 Aug '25

https://www.targir.com/ https://www.targir.com/2025/04/blog-post_14.html

1 0

شهادة الأبوة في المغرب
by walid falcon 07 Aug '25

07 Aug '25

Spam detection software, running on the system "mail.haskell.org", has identified this incoming email as possible spam. The original message has been attached to this so you can view it (if it isn't spam) or label similar future email. If you have any questions, see @@CONTACT_ADDRESS@@ for details. Content preview: ÙÙ ÙØ§ ØªØØªØ§Ø¬ ÙØ¹Ø±ÙØªÙ ØÙÙ Ø´ÙØ§Ø¯Ø© Ø§ÙØ£Ø¨ÙØ© Ø¨Ø§ÙÙØºØ±Ø¨ ÙÙÙÙÙ ØªØÙÙÙ Ø§ÙØ·ÙØ¨ ÙÙ Ø®ÙØ§Ù Ø§ÙØ±Ø§Ø¨Ø· Ø§ÙÙØ¨Ø§Ø´Ø± https://www.targir.com/2025/04/blog-post_14.html [...] Content analysis details: (6.6 points, 5.0 required) pts rule name description ---- ---------------------- -------------------------------------------------- 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider (pikolasikolatest2[at]gmail.com) -0.0 SPF_PASS SPF: sender matches SPF record 0.1 FREEMAIL_ENVFROM_END_DIGIT Envelope-from freemail username ends in digit (pikolasikolatest2[at]gmail.com) 5.0 UNWANTED_LANGUAGE_BODY BODY: Message written in an undesired language 0.0 HTML_MESSAGE BODY: HTML included in message 1.5 BODY_8BITS BODY: Body includes 8 consecutive 8-bit characters 0.0 T_DKIM_INVALID DKIM-Signature header exists but is not valid 0.0 T_TO_NO_BRKTS_FREEMAIL T_TO_NO_BRKTS_FREEMAIL The original message was not completely plain text, and may be unsafe to open with some email clients; in particular, it may contain a virus, or confirm that your address can receive spam. If you wish to view it, it may be safer to save it to a file and open it with an editor.

1 0

POPL 2026 Call For Tutorials
by Ningning Xie 06 Aug '25

06 Aug '25

POPL 2026 CALL FOR TUTORIALS https://popl26.sigplan.org/track/POPL-2026-tutorials#Call-For-Tutorials The 53rd ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2026) will be held in Rennes, France. POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation, and verification of programming languages, programming systems, and programming abstractions. Tutorials for POPL 2026 are solicited on any topic relevant to the POPL community. We particularly encourage submissions of introductory tutorials that make the research presented at POPL more accessible to the participants. Tutorials will be held on Jan 11–13, 2026. The expected length of a tutorial is 3 hours, including questions and discussion (Q&A). Submission details Deadline for submission: October 10th, 2025 Notification of acceptance: October 24th, 2025 A tutorial proposal should provide the following information: - Tutorial title - Presenter(s), affiliation(s), and contact information - 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation approach, target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees if available. - 1-2 paragraph abstract suitable for tutorial publicity. - 1-paragraph biography suitable for tutorial publicity. Proposals must be submitted by email to Robert Rand (rand(a)uchicago.edu) and Alan Schmitt (alan.schmitt(a)inria.fr) with the subject line "POPL 2026 Tutorial Proposal: [tutorial name]". The proposal should be attached as a PDF, docx, or txt file. Further information Any questions regarding POPL 2026 tutorials should be addressed to the workshops chairs, Robert Rand (rand(a)uchicago.edu) and Alan Schmitt (alan.schmitt(a)inria.fr)

1 0

GHC 9.10.3-rc2 is now available
by Zubin Duggal 06 Aug '25

06 Aug '25

The GHC developers are very pleased to announce the availability of the second release candidate for GHC 9.10.3. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][] and via [GHCup](https://www.haskell.org/ghcup/). GHC 9.10.3 is a bug-fix release fixing over 50 issues of a variety of severities and scopes. A full accounting of these fixes can be found in the [release notes][]. As always, GHC's release status, including planned future releases, can be found on the GHC Wiki [status][]. The changes from the first release candidate are: - Bumping the text submodule to 2.1.3 - Reverting a bug fix (!14291) that restricted previously allowed namespace specifiers (#26250) - Reverting the bump of the deepseq submodule to 1.5.2.0 (#26251) This release candidate will have a two-week testing period. If all goes well the final release will be available the week of 19 August 2025. We would like to thank Well-Typed, Tweag I/O, Juspay, QBayLogic, Channable, Serokell, SimSpace, the Haskell Foundation, and other anonymous contributors whose on-going financial and in-kind support has facilitated GHC maintenance and release management over the years. Finally, this release would not have been possible without the hundreds of open-source contributors whose work comprise this release. As always, do give this release a try and open a [ticket][] if you see anything amiss. [release notes]: https://gitlab.haskell.org/ghc/ghc/-/blob/ghc-9.10/docs/users_guide/9.10.3-… [status]: https://gitlab.haskell.org/ghc/ghc/-/wikis/GHC-status [downloads.haskell.org] https://downloads.haskell.org/ghc/9.10.3-rc2 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new

1 0

ICFP 2025 (Co-Located with SPLASH!): Call for Participation
by ICFP Publicity 03 Aug '25

03 Aug '25

================================================== Call for Participation The 30th ACM SIGPLAN International Conference on Functional Programming (ICFP 2025) and affiliated events *** This year, co-located with SPLASH for a *** *** joint ICFP/SPLASH Conference *** https://icfp25.sigplan.org Singapore; Oct 12-18, 2025 *** Register by Aug 31, 2025 for a discount! *** ================================================== ICFP is a celebration of the art and science of functional programming, providing a forum for researchers and developers to engage on a variety of topics, from foundations to features, and from abstraction to application. This year, for the first time in history, ICFP will be co-located with SPLASH and its satellite events as a part of the joint ICFP/SPLASH 2025 conference. You are invited to participate in a full week of events dedicated to the art and science of programming, featuring both the ICFP and SPLASH main conferences as well as numerous related events. * ICFP Accepted Papers: https://icfp25.sigplan.org/track/icfp-2025-papers#event-overview * Registration: https://icfp25.sigplan.org/attending/registration *The early-bird deadline is August 31, 2025* (Additionally, there is a full week discount if you register for 7 days!) * Venue (Sunday Workshops only): NUS School of Computing https://icfp25.sigplan.org/venue/splash-2025-venue1 * Venue (Main Conference): Marina Bay Sands Convention Centre https://icfp25.sigplan.org/venue/splash-2025-venue Full list of events: October 12 Tutorials - https://conf.researchr.org/track/icfp-splash-2025/icfp-splash-2025-tutorials PLMW - https://conf.researchr.org/home/icfp-splash-2025/plmw-icfp-splash-2025 TyDE - https://conf.researchr.org/home/icfp-splash-2025/tyde-2025 FARM - https://2025.splashcon.org/track/splash-2025-farm HOPE - https://conf.researchr.org/home/icfp-splash-2025/hope-2025 Erlang - https://conf.researchr.org/home/icfp-splash-2025/erlang-2025 FUNARCH - https://conf.researchr.org/home/icfp-splash-2025/funarch-2025 October 13-15 ICFP (3 days) - https://icfp25.sigplan.org/ October 13-14 SAS (2 days) - https://2025.splashcon.org/home/sas-2025 October 13 SPLASH Doctoral Symposium - https://2025.splashcon.org/track/splash-2025-Doctoral-Symposium SCALA - https://conf.researchr.org/home/icfp-splash-2025/scala-2025 PROPL - https://conf.researchr.org/home/icfp-splash-2025/propl-2025 October 14-15 OlivierFest (2 days) - https://conf.researchr.org/home/icfp-splash-2025/olivierfest-2025 October 14 HATRA - https://conf.researchr.org/home/icfp-splash-2025/hatra-2025 MPLR - https://conf.researchr.org/home/icfp-splash-2025/mplr-2025 IWACO - https://conf.researchr.org/home/icfp-splash-2025/iwaco-2025 October 15 PAINT - https://conf.researchr.org/home/icfp-splash-2025/paint-2025 LMPL - https://conf.researchr.org/home/icfp-splash-2025/lmpl-2025 VMIL - https://conf.researchr.org/home/icfp-splash-2025/vmil-2025 October 16-18 OOPSLA (3 days) - https://2025.splashcon.org/track/OOPSLA ONWARD! (3 days) - https://2025.splashcon.org/track/splash-2025-Onward-papers October 16-17 HASKELL (2 days) - https://conf.researchr.org/home/icfp-splash-2025/haskellsymp-2025 October 16 ML Family - https://conf.researchr.org/home/icfp-splash-2025/mlsymposium-2025 SCHEME - https://conf.researchr.org/home/icfp-splash-2025/scheme-2025 WASM - https://conf.researchr.org/home/icfp-splash-2025/webassembly-ws-2025 October 17 OCAML - https://conf.researchr.org/home/icfp-splash-2025/ocaml-2025 MINI KANREN - https://conf.researchr.org/home/icfp-splash-2025/minikanren-2025 October 18 SPLASH-E - https://2025.splashcon.org/track/splash-2025-SPLASH-E REBASE - https://conf.researchr.org/home/icfp-splash-2025/rebase-2025 Industry Forum - https://conf.researchr.org/home/icfp-splash-2025/industry-forum-2025 ICFP 2025 will feature three keynotes: Ekaterina Komendantskaya: Proof-Carrying Neuro-Symbolic Code https://icfp25.sigplan.org/details/icfp-2025-icfp-keynotes/2/Proof-Carrying… Christos Dimoulas: The Rational Programmer, A Method for Investigating Programming Language Pragmatics https://icfp25.sigplan.org/details/icfp-2025-icfp-keynotes/3/The-Rational-P… Satnam Singh: Functional Programming for Hardware Design https://icfp25.sigplan.org/details/icfp-2025-icfp-keynotes/1/Functional-Pro… ICFP 2025 conference organizers: https://icfp25.sigplan.org/committee/icfp-2025-organizing-committee We hope to see you in Singapore in October. Don't forget to register by *August 31, 2025* for the early-bird discount! Additionally, there is a *full-week discount*: register for the whole 7 days and only pay for 6! https://icfp25.sigplan.org/attending/registration

1 0

-i in OPTIONS_GHC
by amindfv＠mailbox.org 31 Jul '25

31 Jul '25

I'd like to update the search path of a Haskell module, using the OPTIONS_GHC pragma. >From the documentation[0], OPTIONS_GHC allows you to set dynamic flags, which `-i` appears to be.[1] Here's a quick demo of what I believe _should_ work, but doesn't: A.hs: {-# OPTIONS_GHC -isrc #-} import B main = print b src/B.hs: module B where b = "!" `ghc A.hs` fails, but (of course) `ghc -isrc A.hs` succeeds. Is there a way to get this to work? Is the current behavior intended? Is what I want a misfeature? (E.g. there are security implications?) Thanks, Tom [0] https://downloads.haskell.org/ghc/latest/docs/users_guide/using.html#comman… [1] https://downloads.haskell.org/ghc/latest/docs/users_guide/flags.html#findin…

4 4

GHC Users Guide PDF?
by amindfv＠mailbox.org 31 Jul '25

31 Jul '25

I notice that as late as May 2023, PDF versions of the GHC Users Guide have been available, e.g. https://downloads.haskell.org/ghc/9.2.8/docs/ . For more recent versions, I can't find them anywhere. "Documentation" on the GHC homepage now links only to the HTML version. Has the team decided to stop pre-rendering a PDF version? That would be a shame; in some contexts a PDF is much more useful than HTML. (Btw: the GHC man page still links to https://downloads.haskell.org/ghc/latest/docs/users_guide.pdf, which is now a 404 - as is the HTML link) Thanks, Tom

2 1

GHC 9.10.3-rc1 is now available
by Zubin Duggal 29 Jul '25

29 Jul '25

The GHC developers are very pleased to announce the availability of the release candidate for GHC 9.10.3. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][] and via [GHCup](https://www.haskell.org/ghcup/). GHC 9.10.3 is a bug-fix release fixing over 50 issues of a variety of severities and scopes. A full accounting of these fixes can be found in the [release notes][]. As always, GHC's release status, including planned future releases, can be found on the GHC Wiki [status][]. This release candidate will have a two-week testing period. If all goes well the final release will be available the week of 11 August 2025. We would like to thank Well-Typed, Tweag I/O, Juspay, QBayLogic, Channable, Serokell, SimSpace, the Haskell Foundation, and other anonymous contributors whose on-going financial and in-kind support has facilitated GHC maintenance and release management over the years. Finally, this release would not have been possible without the hundreds of open-source contributors whose work comprise this release. As always, do give this release a try and open a [ticket][] if you see anything amiss. [release notes]: https://gitlab.haskell.org/ghc/ghc/-/blob/ghc-9.10/docs/users_guide/9.10.3-… [status]: https://gitlab.haskell.org/ghc/ghc/-/wikis/GHC-status [downloads.haskell.org] https://downloads.haskell.org/ghc/9.10.3-rc1 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new

1 0

IFL 2025 - Call For Draft Papers (deadline extension)
by Mart Lubbers 27 Jul '25

27 Jul '25

Please, find below the call for draft papers for IFL 2025. The submission deadline has been extended to August 31. In this CFP we also include the announcement of our keynote speakers and of tutorials to be held on September 29 and 30, prior to IFL. Please forward this to anyone you think may be interested. ===================================================================== IFL 2025 37th Symposium on Implementation and Application of Functional Languages Montevideo, Uruguay October 1-3, 2025 https://www.fing.edu.uy/inco/congresos/ifl2025 ===================================================================== [NEWS: Extended deadline for draft paper submission, Keynote speakers, Tutorials] ### 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 2025 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 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 specialisation - run-time code generation - partial evaluation - (abstract) interpretation - meta-programming - 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 ### Keynote speakers - Roberto Ierusalimschy Departamento de Informática, PUC-Rio, Río de Janeiro, Brazil - Iván Pérez NASA Ames Research Center, California, USA ### Tutorials On September 29 and 30, the two days prior to the symposium, four tutorials will be held: - Gradual typing Éric Tanter, University of Chile, Chile - Type Based Static Analysis Jurriaan Hage, Heriot-Watt University, UK - Development of dApps in the UTxO model TxPipe, Argentina - TBA ### Peer-review process Differently from previous editions of IFL, IFL 2025 solicits two kinds of submissions: * Regular papers (12 pages excluding references) * Draft papers for presentations ('weak' limit between 5 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. Regular papers can be: accepted for publication in the formal proceedings, accepted for presentation at the symposium or rejected. 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. We require that at least one of the authors present the work at IFL 2025. 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 after the symposium. 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. ### Important dates Submission of regular papers: June 23, 2025 (extended) Regular papers notification: August 4, 2025 Submission of draft papers: August 31, 2025 (extended) Draft papers notification: September 4, 2025 Deadline for early registration: September 5, 2025 Submission of pre-proceedings version: September 8, 2025 Pre-symposium tutorials September 29-30, 2025 IFL Symposium: October 1-3, 2025 Submission of papers for post-proceedings: December 15, 2025 Notification of acceptance: February 28, 2026 Camera-ready version: March 30, 2026 Deadlines are end of day Anywhere on Earth (UTC-12) (https://www.timeanddate.com/time/zones/aoe) ### 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 Submit your draft paper here: https://easychair.org/conferences/?conf=ifl2025 using the track [IFL 2025 - Draft papers]. Important note to authors about the new ACM open access publishing model ACM has introduced a new open access publishing model for the International Conference Proceedings Series (ICPS). Authors based at institutions that are not yet part of the ACM Open program and do not qualify for a waiver will be required to pay an article processing charge (APC) to publish their ICPS article in the ACM Digital Library. To determine whether or not an APC will be applicable to your article, please follow the detailed guidance here: https://www.acm.org/publications/icps/author-guidance. Further information may be found on the ACM website, as follows: - Full details of the new ICPS publishing model: https://www.acm.org/publications/icps/faq - Full details of the ACM Open program: https://www.acm.org/publications/openaccess - Please direct all questions about the new model to icps-info(a)acm.org. ### Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. ### Organisation PC Chairs: Alberto Pardo, Universidad de la República, Montevideo, Uruguay Marcos Viera, Universidad de la República, Montevideo, Uruguay Publicity Chair: Mart Lubbers, Radboud University, The Netherlands Local Chairs: Alberto Pardo, Universidad de la República, Montevideo, Uruguay Marcos Viera, Universidad de la República, Montevideo, Uruguay ### Program committee: Matteo Cimini, University of Massachusetts Lowell Facundo Domínguez, Tweag João Paulo Fernandes, Universidade do Porto Jeremy Gibbons, Oxford University Jurriaan Hage, Heriot Watt University Jason Hemann, Seton Hall University Maja Hanne Kirkeby, Roskilde University Mart Lubbers, Radboud University Bruno C. D. S. Oliveira, The University of Hong Kong Rinus Plasmeijer, Radboud University Andre Rauber Du Bois, Universidade Federal de Pelotas Rodrigo Ribeiro, Universidade Federal de Ouro Preto Alejandro Russo, Chalmers University of Technology João Saraiva, University of Minho Wenhao Tang, University of Edinburgh Zhixuan Yang, Imperial College London Brent Yorgey, Hendrix College Beta Ziliani, Manas.Tech Viktória Zsók, Eötvös Loránd University ### Venue IFL 2025 will be held physically in Montevideo, Uruguay. See the website for more information. https://www.fing.edu.uy/inco/congresos/ifl2025 ### Acknowledgments This call-for-papers is an adaptation and evolution of content from previous instances of IFL. We are grateful to prior organisers for their work, which is reused here.

1 0

how to expand ~ in a filepath
by PICCA Frederic-Emmanuel 24 Jul '25

24 Jul '25

Hello, I am trying to open and read the content of this kind of filepath. ~/debian/changelog So is there a prefered way to expand the ~ into the real $HOME. thanks for your help Frédéric Classification de confidentialité SOLEIL Ce message et ses pièces jointes peuvent contenir des informations soumises à des règles de diffusion : * P (Public) : Diffusion libre y compris à l'extérieur de SOLEIL. * I (Interne) : Diffusion libre au sein de SOLEIL, ne doit pas être communiqué à l’extérieur sauf mention spécifique. * C (Confidentiel) : Diffusion restreinte aux personnes autorisées, internes ou externes. Le partage nécessite l'accord de la hiérarchie. * S (Sensible) : Accès restreint aux seuls destinataires. Partage non autorisé. Les informations contenues dans cet e-mail sont la propriété de SOLEIL. Si vous n'êtes pas le destinataire prévu, merci de nous en notifier et de ne pas utiliser, copier ou distribuer les informations qu'il contient.

9 9

Call for Papers: Tests and Proofs (TAP) (Now a Track at FM 2026)
by Achim D. Brucker 24 Jul '25

24 Jul '25

**CALL FOR PAPERS** **Special Track on Tests and Proofs (TAP 2026)** *at the* **27th International Symposium on Formal Methods (FM 2026)** **May 18-22, 2026 --- Tokyo, Japan** **Website:** <https://conf.researchr.org/track/fm-2026/> **Abstract Submission**: Tuesday, 25 November 2025 **Full Paper Submission:** Tuesday, 2 December 2025 ### **New TAP Track at FM 2026: A Premier Venue for Tests and Proofs** Since 2007, the [Test and Proof (TAP) conference](https://tapconference.github.io/2024/) has long been a leading venue for research on the intersection of software testing and formal verification. Now, TAP is joining the 27th International Symposium on Formal Methods (FM 2026) as a new special track. This integration places the ground-breaking work of the Test and Proofs community at the heart of the world's premier conference on formal methods. This new track provides a dedicated forum for researchers, practitioners, and tool developers to present and discuss the latest advances in the synergistic combination of traditionally distinct areas of dynamic analysis, e.g., testing, and static analysis, e.g., proving. By joining FM, the TAP track offers authors a wider, more diverse audience and the prestige of publication in the main, open-access FM 2026 proceedings, published by Springer in the LNCS series. We invite you to be part of this exciting new chapter for the tests and proofs community! **Track Highlight: FM 2026 Keynote by Professor Cristian Cadar** We are thrilled to announce that TAP Track at FM 2026 will feature a keynote address by **Professor Cristian Cadar** of Imperial College London. Professor Cadar is a world-renowned authority on software reliability, security, and verification, and is particularly celebrated for his pioneering contributions to symbolic and dynamic execution (e.g., KLEE). His selection as a main symposium keynote speaker is a powerful testament to the increasing importance of the core topics of the TAP track to the broader computer science community. ### **Scope and Topics of Interest** The TAP track solicits high-quality, original research on the interplay between dynamic techniques such as testing, runtime verification etc.testing and formal verification such as proving, model checking, abstract interpretation, etc. . The track aims to foster new collaborations and advance the state of the art in creating reliable and secure software and systems. Topics of interest include, but are not limited to, the following areas: **Foundations for Combining Testing and Verification** - Formalisms and theories that unify testing and proof\ - Semantic foundations for combined static and dynamic analysis\ - Proof theory for test-case generation and specification conformance\ - Type systems with a testing and proving focus\ - Formal models of test-based and proof-based development **Synergistic Techniques and Tools** - Combination of model checking, theorem proving, and runtime verification - Synergies between symbolic execution, fuzzing, and formal analysis - Test-case generation from formal specifications (e.g., using B, Z, TLA+, VDM) - Using test execution results to guide or automate proof discovery - Static analysis for test-suite reduction, prioritization, and optimization - Verification-based and property-based testing - Formal methods for testing AI/ML-based systems - AI/ML techniques for enhancing formal verification and testing - Derivation of specifications and contracts from tests - Combination of static and dynamic analysis for security vulnerability detection **Applications and Empirical Evaluation** - Case studies and experience reports applying combined test-and-proof techniques to industrial systems (e.g., in security, cyber-physical systems, autonomous systems, blockchain, or IoT) - Empirical comparisons of different verification, testing, and combined techniques - Tool demonstration papers for new and innovative tools that support tests and proofs - Application of TAP techniques to challenge problems and benchmarks ### **Submission Categories and Guidelines** The TAP track papers can be submitted in all paper categories supported by the FM 2026 Research Track and submissions to the TAP track will be reviewed following the policies and quality criteria of the FM Research Track. The TAP track solicits papers in the following categories: - **Regular Papers (max 15 pages, excluding references and appendices):** For mature, original research contributions. - **Long Tool Papers (max 15 pages, excluding references and appendices):** For presenting mature tools, their theoretical foundations, and empirical evaluations. - **Case Study Papers (max 15 pages, excluding references and appendices):** For in-depth reports on the application of TAP techniques to significant, real-world problems. - **Short Papers (max 6 pages, excluding references and appendices):** For presenting novel but not yet fully mature ideas, or for tool demonstration papers that focus on a tool's features and usage. Papers should be original work, not published or submitted elsewhere, in Springer [LNCS format](https://www.springer.com/gp/computer-science/lncs/conference-procee…, and written in English. Submit your papers at https://easychair.org/conferences/?conf=fm2026 Reviewing is single-blind. Each paper will be evaluated by at least three members of the Program Committee. Papers will be accepted or rejected in the category in which they were submitted and will not be moved between categories Authors of accepted papers are strongly encouraged to submit their supporting artifacts to the FM 2026 Artifact Evaluation track. ### **Important Dates** All deadlines are **Anywhere on Earth (AoE, UTC-12h)**. The deadlines for the TAP track are aligned with the FM 2026 Research Track. Milestone Date --------------------------- ------------------------------- **Abstract Submission** **Tuesday, 25 November 2025** **Full Paper Submission** **Tuesday, 2 December 2025** **Author Notification** **Friday, 6 February 2026** **Camera-Ready Version** **Monday, 2 March 2026** **FM 2026 Conference** **May 18-22, 2026** ### **Publication** All accepted papers for the TAP track will be published as part of the main FM 2026 conference proceedings. The proceedings will be published by Springer in their **open-access Lecture Notes in Computer Science (LNCS)** series. At least one author of an accepted paper must register for the conference and present the work. ### **Track Organization** **Track Chairs:** - Marie-Christine Jakobs, Ludwig-Maximilan University, Munich, Germany - Achim D. Brucker, University of Exeter, UK For inquiries, please contact the track chairs. -- Prof. Achim Brucker | Chair in Cybersecurity & Head of Group | University of Exeter https://www.brucker.ch | https://logicalhacking.com/blog @adbrucker | @logicalhacking

1 0

Re: [Haskell-cafe] Correct parsers for bounded integral values
by Olaf Klinke 20 Jul '25

20 Jul '25

> Both approaches > require one comparison per digit read (the number-counting approach > needs to count the digits and test whether the limit of this counter > has been reached, the “modulo” approach needs to check whether `lim` > has been reached). And both approaches need to accumulate the digits > read so far (digit-counting collects the digits and converts them to > a > value just before reading the final digit, “modulo” accumulates the > final value on the go). Some, but not all, parser combinator libraries have a user-defined state component. Since the parser updates its internal state anyways, the overhead might be smaller than anticipated. If the parser is not a monad transformer, a workaround is to newtype the region containing a number literal, so that the parser state can accomodate the extra accumulator. https://hackage.haskell.org/package/parsec-3.1.18.0/docs/Text-Parsec.html#t… https://hackage.haskell.org/package/attoparsec-0.14.4/docs/Data-Attoparsec-… https://hackage.haskell.org/package/megaparsec-9.7.0/docs/Text-Megaparsec-S… > I don't know where to start, `base` just always > happened to be there already. I.e., could someone please help me to > get a simple setup (my usual modus operandi is the shell, cabal, and > an editor) where the base library is accessible for modification and > testing? base is just a package like others. You can download a copy from hackage, unpack and build it with your build tool of choice, can't you? (Never thried that myself, though.) If parsing speed is a concern: For those parsers that build on a parser type class (megaparsec or the parser-combinators package) one can implement a simple parser that has less book-keeping overhead and embed it into fancier parsers, calling the proper parser on the input only in case something goes wrong. https://hackage.haskell.org/package/faster-megaparsec Olaf

1 0

GHC LTS Releases
by Andreas Klebinger 16 Jul '25

16 Jul '25

I'm pleased to announce LTS plans for GHC Read all the details here: https://www.haskell.org/ghc/blog/20250702-ghc-release-schedules.html There is also a discourse thread if you have feedback: https://discourse.haskell.org/t/ghc-lts-releases-the-glasgow-haskell-compil… Best Wishes Andreas

5 4

Combining RequiredTypeArguments and type class methods?
by Anthony Clayden 14 Jul '25

14 Jul '25

On Sun, Jul 13, 2025 at 11:47:36AM +0100, Tom Ellis wrote: > >* There is, however, a known trick. This works: *> Ah yes. Same solution here https://discourse.haskell.org/t/how-to-use-requiredtypearguments-with-typec… Currently, `RequiredTypeArguments` is documented as " only partially implemented in GHC". Full specification to be found in proposal #281. That proposal doesn't give examples of how to write instances for `sizeOf`, as and when we get Dependent Haskell in full. Will it still need the type equality trick? > >* (But I prefer your [Viktor's] solution: the wrapper.)* *>* Yes. That in effect still uses a term-level proxy for the type, as argument to _sizeOf. For example I could go pattern Bool :: Bool pattern Bool = undefined ... _sizeOf Bool ...

1 0

Combining RequiredTypeArguments and type class methods?
by Viktor Dukhovni 13 Jul '25

13 Jul '25

The user guide documentation of RequiredTypeArguments highlights a hypothetical alternative to the interface of the `sizeOf` method of the Storable class: https://downloads.haskell.org/ghc/9.12.2/docs/users_guide/exts/required_typ… sizeOf :: forall a -> Storable a => Int If sizeOf had this type, we could write sizeOf Bool without passing a dummy value. This is fine in isolation, but how would this actually work in a type class method definition? The below naïve attempt does not work: {-# LANGUAGE AllowAmbiguousTypes #-} {-# LANGUAGE RequiredTypeArguments #-} class MyStorable a where sizeOf :: forall a -> MyStorable a => Int instance MyStorable Bool where sizeOf (type Bool) = 1 --- • Expected kind ‘k’, but ‘Bool’ has kind ‘*’ ‘k’ is a rigid type variable bound by the type signature for: sizeOf :: forall {k}. forall (a1 :: k) -> MyStorable a1 => Int at /tmp/foo.hs:8:5-10 • In the type ‘Bool’ In a type argument: Bool In the pattern: type Bool • Relevant bindings include sizeOf :: forall (a :: k) -> MyStorable a => Int (bound at /tmp/foo.hs:8:5) | 8 | sizeOf (type Bool) = 1 | ^^^^ Is the hypothetical `sizeOf` actually realisable as a type class method? Or can it only be a module-level wrapper? Something like the below, which does work? {-# LANGUAGE RequiredTypeArguments #-} class MyStorable a where _sizeOf :: a -> Int instance MyStorable Bool where _sizeOf _ = 1 instance MyStorable Int where _sizeOf _ = 8 sizeOf :: forall a -> MyStorable a => Int sizeOf a = _sizeOf (undefined :: a) Is it possible to avoid the (undefined :: a) term and somehow use TypeApplications here, with an "ambiguous" `_sizeOf` method? class MyStorable a where _sizeOf :: Int -- Viktor. 🇺🇦 Слава Україні!

2 3

ZuriHac 2025 Videos Online
by Farhad D. Mehta 09 Jul '25

09 Jul '25

Hi Everyone It was great to see you at [ZuriHac 2025](https://zfoh.ch/zurihac2025/). In case you couldn’t attend, or would like to relive the magic, the recordings from the event are now online at: [ZuriHac 2025 Playlist – Talks, Panels & Projects from the Haskell Community](https://www.youtube.com/playlist?list=PLOvRW_utVPVlFEXuyaIVILO1t… In this playlist, you'll find talks on: 🎓 Education, Pedagogy and Community - Zoe Kooyman on freedom-preserving software, ethics, and empowering developers through appropriate software licensing - Richard Southwell on category theory - Tom Ellis on the history of effect systems - Brent Yorgey on competitive programming - Pedro Abreu interviewing participants on their impressions on ZuriHac, and why they love (and hate) Haskell ⚙️ Tooling & Infrastructure - Cheng Shao on GHC’s WebAssembly backend and runtime architecture - Malte Ott on reproducible Haskell deployment using Nix and Flakes - Alex Vieth on managing risk - Panel discussion covering industry adoption, tooling, onboarding, and language design 💡 Programming Concepts & Philosophy - Lennart Augustsson on MicroHs, compiler simplicity, the history of Haskell and functional programming, dependent types, and writing trustworthy code - Shared focus across talks on laziness, purity, composability, and types as documentation - Emphasis on keeping Haskell both powerful and welcoming for newcomers 🛠️ Community Projects Lightning demos from the Project Presentation session: Inline Verilog support, performance benchmarks, Git conflict tooling, HLS improvements, smart contracts via linear types, education platforms, games, and more 🏛️ Opening Ceremony Highlights - OST’s and ZfoH's ongoing role as host and supporter of open functional programming - Short presentations from supporters and community partners - Project pitches covering Haskell in science, hardware, industry, and education Whether you want to learn, get inspired, or dive deep into modern Haskell development — this playlist captures the energy, ideas, and innovation that define ZuriHac. Find out how Haskell is shaping the future of programming. Just try not to watch it all in one sitting: There is still some time to bridge until the next ZuriHac. Thanks to everyone who actively participated and contributed to the event with their talks, tracks, and other help! The other organisers and I look forward to seeing you at [ZuriHac 2026](https://zfoh.ch/zurihac2026/). Best regards Farhad Mehta (on behalf of the ZfoH & OST)

1 0

Fifth International Conference on Digital Data Processing (DDP 2025)
by edprocess＠dline.info 07 Jul '25

07 Jul '25

Fifth International Conference on Digital Data Processing (DDP 2025) University of Bedfordshire. Luton. (Near London) UK. August 18-20, 2025 (www.socio.org.uk/ddp) (IEEE Publication) (Virtual Presentation/Physical) As technology advances in different sub-domains of computing, data-driven models are becoming increasingly important. The data-dependent world now faces many challenges in terms of data accuracy and data privacy. High-impact advancements include machine learning, artificial intelligence, deep learning and many more. Data is growing exponentially in terms of diversity and complexity. One organization or industry processes over a few million transactions per hour and stores hundreds of billions of data. We live in a world with a great need for more efficient data analysis and processing. Data analytics can reveal hidden patterns, complex relationships, internal information relations, and even segmentation. Data applications have opened up new possibilities in every aspect of our lives. Studying data and its structure, dynamics, and modern data technologies is an ongoing process. There is a great deal of literature and research on data management, but it does not address the data processing needs. Many studies focus on developing models and systems for analysing large datasets. Data analysis leads to application domains that have a systematic impact on decisions. The knowledge gained from the data analysis enables the generation of critical information for multiple domains. In this conference, we review and discuss the latest trends in data management, the opportunities and challenges, and how they have affected organizations' ability to develop effective business and technology strategies and stay up-to-date in data technology. We also highlight current open research directions in data analytics that need further attention. The proposed conference will discuss topics not limited to Data applications in various domains and activities Data in cloud Real-world data processing Data inaccuracy and reliability issues Data Ecosystem Business Analytics New data analytics techniques Physical and management challenges Synthetic data Data synthesis Crowdsourcing and Sensing Data modelling Deep learning techniques Data fusion Descriptive analytics, Diagnostic analytics, Predictive Analytics, and Prescriptive analytics Machine learning impact on data processing Network optimization Data in Biomedical Engineering Data in Materials science and mechanics Data handling and applications in domains Wireless Networking Data Management Data of Electronic & Embedded Systems Multi-media Systems Data Artificial Intelligence Models and Systems Data E-Computing Data Renewable Energies Data General Chair General Chair Ezendu Ariwa Warwick University, UK Program Chairs Youshan Zhang, Yeshiva University, USA Simon Fong, University of Macau, Macau Duong Van Hieu, Tien Giang University, Vietnam Program Co-chairs Martin Lopez Nores, University of Vigo, Spain Frankie Wilson, University of Oxford. UK Publicity Chair Mohsin Beniysa, Abdelmalek Essaâdi University, Morocco Publications All accepted and presented papers will be submitted to IEEE Xplore for publication and indexing. The DDP 2025 has co-located workshops. Modified versions of the papers will appear in the following journals. Journal of Digital Information Management International Journal of Computational Linguistics Open Information Science Important Dates Submission of Papers: July 15, 2025 Notification of Acceptance/Rejection: August 10, 2025 Camera-ready: August 31, 2025 Registration: August 15, 2025 Conference Dates: August 18-20, 2025 Post-Conference Proceedings Release: November 30, 2025 We'll be able to bring the post-conference proceedings only. Based on the review of the submissions, we issue a notification, and the authors can present using PPT files, for which a full-text camera-ready version is not required. With the help of feedback received during the conference and reviews, the authors can update their papers and submit the camera-ready. Paper submission Papers should follow the IEEE template. Submissions at http://socio.org.uk/ddp/paper-submission/ Contact: ddp(a)socio.org.uk

1 1

POPL 2026 Last Call for Papers
by Ningning Xie 05 Jul '25

05 Jul '25

PACMPL Issue POPL 2026 seeks contributions on all aspects of programming languages and programming systems, both theoretical and practical. Authors of papers published in PACMPL Issue POPL 2026 will be invited to present their work in the POPL conference in January 2026, which is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG. POPL 2026 Website: https://popl26.sigplan.org/ Call for Papers: https://conf.researchr.org/track/POPL-2026/POPL-2026-popl-research-papers Submission deadline: July 10 2025 AOE Double-Blind Review FAQ: https://conf.researchr.org/track/POPL-2026/POPL-2026-popl-research-papers#d… ### Organization Conference Location: Rennes, France Conference Dates: January 11-17, 2026 General Chair: Sandrine Blazy, University of Rennes Program Chair: Suresh Jagannathan, Purdue University Program Committee: https://popl26.sigplan.org/committee/POPL-2026-popl-research-papers-program… ### Scope Principles of Programming Languages (POPL) is a forum for the discussion of all aspects of programming languages and programming systems. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. We seek submissions that make principled, enduring contributions to the theory, design, understanding, implementation, or application of programming languages. ### Evaluation Criteria The Review Committee will evaluate the technical contribution of each submission as well as its accessibility to both experts and the general POPL audience. All papers will be judged on significance, originality, relevance, correctness, and clarity. Each paper must explain its scientific contribution in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Advice on writing technical papers can be found on the SIGPLAN author information page: https://www.sigplan.org/Resources/Author/. Deadlines and formatting requirements, detailed below, will be strictly enforced. ### Double-Blind Reviewing Process POPL 2026 will use a full double-blind reviewing process (similar to the one used in recent years (POPL 2023 - 2025) but different from the lightweight double-blind process used before then). This means that identities of authors will not be made visible to reviewers until after conditional-acceptance decisions have been made, and then only for the conditionally-accepted papers. The use of full double-blind reviewing has several consequences for authors. * **Submissions**: Authors must omit their names and institutions from their paper submissions. In addition, references to authors’ own prior work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”). * **Supplementary material**: Authors are permitted to provide supplementary material (e.g., detailed proofs, proof scripts, system implementations, or experimental data) along with their submission, which reviewers may (but are not required to) examine. This material may take the form of a single file, such as a PDF or a tarball. Authors must fully anonymize any supplementary material. * **Author response**: In responding to reviews, authors should not say anything that reveals their identity, since author identities will not be revealed to reviewers at that stage of the reviewing process. * **Dissemination of work under submission**: Authors are welcome to disseminate their ideas and post draft versions of their paper(s) on their personal website, institutional repository, or arXiv (reviewers will be asked to turn off arXiv notifications during the review period). But authors should not take steps that would almost certainly reveal their identities to members of the Program Committee, e.g., directly contacting PC members or publicizing the work on widely-visible social media or major mailing lists used by the community. The purpose of the above restrictions is to help the Program Committee and external reviewers come to a judgment about the paper without bias, not to make it impossible for them to discover the authors’ identities if they were to try. In particular, nothing should be done in the name of anonymity that weakens the quality of the submission. However, there are occasionally cases where adhering to the above restrictions is truly difficult or impossible for one reason or another. In such cases, the authors should contact the Program Chair to discuss the situation and how to handle it. The FAQ on Double-Blind Reviewing addresses many common scenarios and answers many common questions about this topic. But there remain many grey areas and trade-offs. If you have any doubts about how to interpret the double-blind rules or you encounter a complex case that is not clearly covered by the FAQ, please contact the Program Chair for guidance. ### Evaluation Process POPL 2026 will have five Associate Chairs who will help the PC Chair monitor reviews, solicit external expert reviews for submissions when there is not enough expertise on the committee, and facilitate reviewer discussions. As in previous years, authors will have a multi-day period to respond to reviews, as indicated in the Important Dates table. Responses are optional. A response must be concise, addressing specific points raised in the reviews; in particular, it must not introduce new technical results. Reviewers will write a short reaction to these author responses. The Review Committee (RC) will discuss papers electronically, and will use synchronous virtual meetings to discuss any papers for which there is disagreement among reviewers, in some cases soliciting additional input from other experts in the committee. There is no formal External Review Committee, though experts outside the committee may be consulted for some papers. Reviews will be accompanied by a short summary of the reasons behind the committee’s decision with the goal of clarifying the reasons behind the decision. To conform with ACM requirements for journal publication, all POPL papers will be conditionally accepted; authors will be required to submit a short description of the changes made to the final version of the paper, including how the changes address any requirements imposed by the Review Committee. That the changes are sufficient will be confirmed by the original reviewers prior to acceptance to POPL. Authors of conditionally accepted papers must submit a satisfactory revision to the Review Committee by the requested deadline or risk rejection. For additional information about the reviewing process, see: [Principles of POPL](https://www.sigplan.org/Conferences/POPL/Principles/), a presentation of the underlying organizational and reviewing policies for POPL. For POPL 2026, policies specified in this Call for Papers supersede those in the Principles of POPL document. ### Submission Site Information The submission site is https://popl26.hotcrp.com. Authors can submit multiple times prior to the deadline. Only the last submission will be reviewed. There is no abstract deadline. The submission site requires entering author names and affiliations, relevant topics, and potential conflicts. Addition or removal of authors after the submission deadline will need to be approved by the Program Chair (as this kind of change potentially undermines the goal of eliminating conflicts during paper assignment). The submission deadline is 11:59PM July 10, 2025 anywhere on earth (AOE): https://en.wikipedia.org/wiki/Anywhere_on_Earth ### Conflicts of Interest For each submission, the authors must make sure that they properly declare all potential conflicts of interest for all of the authors of that submission. This includes marking PC conflicts as well as “Other Conflicts (external)”. A conflict caught late in the reviewing process leads to a voided review which may be infeasible to replace. Conflicts should be declared between an adviser and an advisee (e.g., Ph.D., post-doc; forever), between an author and a co-author (papers and proposals; for two years), between people at the same institution (branches of large companies or different locations of research institutes are considered to be the same institution; for two years after leaving an institution), between people with financial conflicts of interest, and between friends or relatives. If a possible reviewer does not meet the above criteria, please do not identify him/her as conflicted. Doing so could be viewed as an attempt to prevent a qualified, but possibly skeptical reviewer from reviewing your paper. If you nevertheless believe that a reviewer who does not meet the above criteria is conflicted, or if you are unsure about a possible conflict, you may identify the person and send a note to the PC Chair. Declaring a spurious conflict with the aim of excluding otherwise qualified reviewers can be grounds for desk rejection. ### Submission Guidelines Prior to the paper submission deadline, authors should upload their full anonymized paper. Here are some key requirements concerning paper submissions: * Each paper should have no more than **25 pages of text, excluding bibliography**, using the PACMPL format (specifically, the `acmart` LaTeX class with `acmsmall` option). It is a single-column page layout with a 10 pt font, 12 pt line spacing, and wider margins than recent POPL page layouts. In this format, the main text block is 5.478 in (13.91 cm) wide and 7.884 in (20.03 cm) tall. Use of a different format (e.g., smaller fonts or a larger text block) is grounds for summary rejection. The PACMPL template for LaTeX can be found at the [SIGPLAN author information page](https://www.sigplan.org/Resources/Author/), and further information about PACMPL submissions can be found on the [PACMPL author guidelines page](https://dl.acm.org/journal/pacmpl/author-guidelines). PACMPL does not support submissions in Microsoft Word. * We strongly encourage use of the `review` and `screen` options in order to make submissions easier to review. * Authors may choose which citation format they wish to use, which can be either author-year (the mandate for final versions in previous years) or numeric. * Submissions should be in PDF and printable on both US Letter and A4 paper. Papers may be resubmitted to the submission site multiple times up until the deadline, but the last version submitted before the deadline will be the version reviewed. * Submitted papers must adhere to the [SIGPLAN Republication Policy](https://www.sigplan.org/Resources/Policies/Republication/) and the [ACM Policy on Plagiarism](https://www.acm.org/publications/policies/plagiarism-overview ). Concurrent paper submissions to other conferences, workshops, journals, or similar forums of publication are not allowed. * Authors are free to submit supplementary material along with their submissions, but it must be fully anonymized. * Authors must list all their conflicts of interest (both PC conflicts and external conflicts) in the HotCRP submission form. * Authors may include additional information in a field of the HotCRP submission form labeled "Confidential Comments for the Program Chair". This information need not be anonymized. It can be used to inform the Program Chair, for example, about sensitive issues concerning a conflict with a PC member or about supplementary material that cannot be anonymized. It is left to the discretion of the Program Chair what to do with this information. * If for some reason an author feels uncomfortable discussing a sensitive issue with the Program Chair (or communicating via the "Confidential Comments" field in HotCRP), they should feel free to get in touch instead with any of the Associate Chairs, with whom they can discuss the issue in confidence. * Submissions from PC members and Associate Chairs (except the Program Chair) are permitted and will not be handled any differently than other submissions. This is in accordance with a recent change in policy approved by the SIGPLAN Executive Committee: SIGPLAN conferences that use full double-blind review and whose PCs have at least 50 members need not hold PC submissions to a higher standard. ### Artifact Evaluation for Accepted Papers Authors of conditionally accepted papers will be invited to formally submit supporting materials to the Artifact Evaluation process. Artifact Evaluation is run by a separate committee whose task is to assess how the artifacts support the work described in the papers. Artifact submission is strongly encouraged but voluntary and will not influence the final decision regarding the papers. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers are encouraged to make these materials publicly available upon publication of the proceedings, by including them as “source materials” in the ACM Digital Library. ### Copyright, Publication, and Presentation As a Gold Open Access journal, PACMPL is committed to making peer-reviewed scientific research free of restrictions on both access and (re-)use. Authors are strongly encouraged to support libre open access by licensing their work with the [Creative Commons Attribution 4.0 International (CC BY) license](https://creativecommons.org/licenses/by/4.0/), which grants readers liberal (re-)use rights. Authors of accepted papers will be required to choose one of the following publication rights: * Author licenses the work with a [Creative Commons license](https://creativecommons.org/), retains copyright, and (implicitly) grants ACM non-exclusive permission to publish (suggested choice). * Author retains copyright of the work and grants ACM a non-exclusive permission to publish license. * Author retains copyright of the work and grants ACM an exclusive permission to publish license. * Author transfers copyright of the work to ACM. These choices follow from ACM Copyright Policy and ACM Author Rights, corresponding to ACM’s “author pays” option. While PACMPL may ask authors who have funding for open-access fees to voluntarily cover the article processing charge, payment is not required for publication. PACMPL and SIGPLAN continue to explore the best models for funding open access, focusing on approaches that are sustainable in the long-term while reducing short-term risk. All papers will be archived by the ACM Digital Library. Authors will have the option of including supplementary material with their paper. The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. Authors of accepted papers are encouraged to give a short talk (roughly 25 minutes long) at the conference, according to the conference schedule. Authors who wish to present but who cannot attend in person will be provided with some option for remote presentation, as well as some mechanism for remote interaction with conference participants. ### Important update on ACM’s new open access publishing model for 2026 ACM Conferences! Starting January 1, 2026, ACM will fully transition to Open Access. All ACM publications, including those from ACM-sponsored conferences, will be 100% Open Access. Authors will have two primary options for publishing Open Access articles with ACM: the ACM Open institutional model or by paying Article Processing Charges (APCs). With over 1,800 institutions already part of ACM Open, the majority of ACM-sponsored conference papers will not require APCs from authors or conferences (currently, around 70-75%). Authors from institutions not participating in ACM Open will need to pay an APC to publish their papers, unless they qualify for a financial or discretionary waiver. To find out whether an APC applies to your article, please consult the list of participating institutions in ACM Open and review the APC Waivers and Discounts Policy. Keep in mind that waivers are rare and are granted based on specific criteria set by ACM. Understanding that this change could present financial challenges, ACM has approved a temporary subsidy for 2026 to ease the transition and allow more time for institutions to join ACM Open. The subsidy will offer: $250 APC for ACM/SIG members and $350 for non-members. This represents a 65% discount, funded directly by ACM. Authors are encouraged to help advocate for their institutions to join ACM Open during this transition period. This temporary subsidized pricing will apply to all conferences scheduled for 2026. ### Distinguished Paper Awards At most 10% of the accepted papers of POPL 2026 will be designated as Distinguished Papers. This award highlights papers that the Review Committee thinks should be read by a broad audience due to their relevance, originality, significance, and clarity. The selection of the distinguished papers will be made based on the final version of the paper and through an additional review process.

1 0

ICFP/SPLASH 2025: call for volunteers
by ICFP Publicity 03 Jul '25

03 Jul '25

ICFP/SPLASH 2025 are looking for volunteers to help with the organization and smooth running of the conference. In exchange, volunteers receive: - Free conference registration (including banquet) - Free lunches and refreshments during breaks - Volunteer shirt - Admission to all social events *Note: Travel and accommodation are not covered.* *Who can apply? *Anyone can apply. Priority will be given to junior members of the community, such as students in computer science or related fields. *Availability. *Volunteers must be available for at least five (5) full days between October 12–18, 2025, and should be ready to help with various tasks during that period. Some pre-conference coordination and training may be required. We welcome both virtual and in-person volunteers from all time zones. *Apply here: *https://tinyurl.com/splashifcp25-sv-application *More details: * https://conf.researchr.org/track/icfp-splash-2025/icfp-splash-2025-voluntee…

1 0

Postdoctoral Researcher Position at the University of Tartu
by Danel Ahman 01 Jul '25

01 Jul '25

The Laboratory for Software Science at the Institute of Computer Science at the University of Tartu is seeking an aspiring talented and hard-working young scientist to fill a postdoctoral position. The successful candidate will work with Dr. Danel Ahman on topics at the intersection of dependent and refinement types, computational effects (in particular, algebraic effects and effect handlers) and type-and-effect systems, and modal types, with specifics determined based on the common interests of the candidate and the supervisor. Candidates from other related PL areas are also encouraged to apply. Our group currently consists of 4 faculty, 3 (soon 4) PhD students, and soon 1 more postdoc (in addition to this advertisement), with expertise in a wide range of PL topics, ranging from type systems and semantics of programming languages, to abstract interpretation based automated verification tools, to various topics in category theory. Consult our webpage for more information on us: https://sws.cs.ut.ee<https://sws.cs.ut.ee/>. In Estonia, we also have close ties and regularly collaborate with the Algebra Group (https://math.ut.ee/en/content/algebra) at the Institute of Mathematics and Statistics at the University of Tartu, and the Logic and Semantics Group (https://cs.ioc.ee/lsg/) at the Tallinn University of Technology. We also collaborate actively internationally. The position is for up to 18 months, with a start date on 1 Oct 2025 or soon thereafter. The monthly gross salary will start from 2700 EUR depending on the experience of the candidate. The salary includes coverage by the national health insurance system, paid annual leave etc. A salary like this ensures a high standard of living in Estonia. Knowledge of Estonian is not required for this position, and for living in Tartu in general. The working language of our group is English. For more information about life in Tartu and more broadly in Estonia, see https://visittartu.com<https://visittartu.com/> and https://visitestonia.com/en. The job advertisement and application instructions can be found at https://candidate.recrur.com/public/jobad/EN/6b969e7f-8 The application deadline is 01 Aug 2025. Interested candidates should contact Danel Ahman (danel.ahman(a)ut.ee<mailto:danel.ahman@ut.ee>) with any questions.

1 0

Intent to take over maintainership of cql and cql-io
by Kyle Butt 30 Jun '25

30 Jun '25

As per the instructions here: https://wiki.haskell.org/Taking_over_a_package , I am publicly announcing my intent to assume maintainership of the `cql` and `cql-io` packages. There is a discourse thread here as well: https://discourse.haskell.org/t/taking-over-cql-and-cql-io/12397 I have attempted to contact both maintainers via email and on gitlab, without success. I have written necessary improvements to bring the library closer to production quality, and would like to be able to release them to the rest of the haskell ecosystem. Kyle

1 0

Edited page on HaskellWiki cannot be stored
by X Y 24 Jun '25

24 Jun '25

I am trying to add an event to the events template on HaskellWiki; when pressing the "Save changes"-button, I get the message: Database error A database query error has occurred. This may indicate a bug in the software. [e0eb045a214da98ee73cb349] 2025-06-24 14:08:03: Fatal exception of type "Wikimedia\Rdbms\DBQueryError" Can anyone have a look at this? Henk-Jan van Tuyl

1 0

Fwd: gitlab.haskell.org sign-in from new location
by write2mark1＠gmail.com 24 Jun '25

24 Jun '25

This is valid login bitcoin username pls allow me to login ---------- Forwarded message --------- From: GitLab <gitlab(a)gitlab.haskell.org> Date: Tue, Jun 24, 2025 at 5:56 AM Subject: gitlab.haskell.org sign-in from new location To: <write2mark1(a)gmail.com> [image: GitLab] Someone signed in to your gitlab.haskell.org account from a new location Hostname gitlab.haskell.org User mark mm (bitcoin) IP Address 173.8.138.218 Time 2025-06-24 12:56:30 UTC If you recently signed in and recognize the IP address, you may disregard this email. If you did not recently sign in, you should immediately change your password <https://gitlab.haskell.org/help/user/profile/user_passwords.md#change-your-…>. Passwords should be unique and not used for any other sites or services. To further protect your account, consider configuring a two-factor authentication <https://gitlab.haskell.org/help/user/profile/account/two_factor_authenticat…> method. [image: GitLab] You're receiving this email because of your account on gitlab.haskell.org. Manage all notifications <https://gitlab.haskell.org/-/profile/notifications> · Help <https://gitlab.haskell.org/help>

1 0

POPL 2026 Call for Papers
by Ningning Xie 24 Jun '25

24 Jun '25

PACMPL Issue POPL 2026 seeks contributions on all aspects of programming languages and programming systems, both theoretical and practical. Authors of papers published in PACMPL Issue POPL 2026 will be invited to present their work in the POPL conference in January 2026, which is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG. POPL 2026 Website: https://popl26.sigplan.org/ Call for Papers: https://conf.researchr.org/track/POPL-2026/POPL-2026-popl-research-papers Submission deadline: July 10 2025 AOE Double-Blind Review FAQ: https://conf.researchr.org/track/POPL-2026/POPL-2026-popl-research-papers#d… ### Organization Conference Location: Rennes, France Conference Dates: January 11-17, 2026 General Chair: Sandrine Blazy, University of Rennes Program Chair: Suresh Jagannathan, Purdue University Program Committee: https://popl26.sigplan.org/committee/POPL-2026-popl-research-papers-program… ### Scope Principles of Programming Languages (POPL) is a forum for the discussion of all aspects of programming languages and programming systems. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. We seek submissions that make principled, enduring contributions to the theory, design, understanding, implementation, or application of programming languages. ### Evaluation Criteria The Review Committee will evaluate the technical contribution of each submission as well as its accessibility to both experts and the general POPL audience. All papers will be judged on significance, originality, relevance, correctness, and clarity. Each paper must explain its scientific contribution in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Advice on writing technical papers can be found on the SIGPLAN author information page: https://www.sigplan.org/Resources/Author/. Deadlines and formatting requirements, detailed below, will be strictly enforced. ### Double-Blind Reviewing Process POPL 2026 will use a full double-blind reviewing process (similar to the one used in recent years (POPL 2023 - 2025) but different from the lightweight double-blind process used before then). This means that identities of authors will not be made visible to reviewers until after conditional-acceptance decisions have been made, and then only for the conditionally-accepted papers. The use of full double-blind reviewing has several consequences for authors. * **Submissions**: Authors must omit their names and institutions from their paper submissions. In addition, references to authors’ own prior work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”). * **Supplementary material**: Authors are permitted to provide supplementary material (e.g., detailed proofs, proof scripts, system implementations, or experimental data) along with their submission, which reviewers may (but are not required to) examine. This material may take the form of a single file, such as a PDF or a tarball. Authors must fully anonymize any supplementary material. * **Author response**: In responding to reviews, authors should not say anything that reveals their identity, since author identities will not be revealed to reviewers at that stage of the reviewing process. * **Dissemination of work under submission**: Authors are welcome to disseminate their ideas and post draft versions of their paper(s) on their personal website, institutional repository, or arXiv (reviewers will be asked to turn off arXiv notifications during the review period). But authors should not take steps that would almost certainly reveal their identities to members of the Program Committee, e.g., directly contacting PC members or publicizing the work on widely-visible social media or major mailing lists used by the community. The purpose of the above restrictions is to help the Program Committee and external reviewers come to a judgment about the paper without bias, not to make it impossible for them to discover the authors’ identities if they were to try. In particular, nothing should be done in the name of anonymity that weakens the quality of the submission. However, there are occasionally cases where adhering to the above restrictions is truly difficult or impossible for one reason or another. In such cases, the authors should contact the Program Chair to discuss the situation and how to handle it. The FAQ on Double-Blind Reviewing addresses many common scenarios and answers many common questions about this topic. But there remain many grey areas and trade-offs. If you have any doubts about how to interpret the double-blind rules or you encounter a complex case that is not clearly covered by the FAQ, please contact the Program Chair for guidance. ### Evaluation Process POPL 2026 will have five Associate Chairs who will help the PC Chair monitor reviews, solicit external expert reviews for submissions when there is not enough expertise on the committee, and facilitate reviewer discussions. As in previous years, authors will have a multi-day period to respond to reviews, as indicated in the Important Dates table. Responses are optional. A response must be concise, addressing specific points raised in the reviews; in particular, it must not introduce new technical results. Reviewers will write a short reaction to these author responses. The Review Committee (RC) will discuss papers electronically, and will use synchronous virtual meetings to discuss any papers for which there is disagreement among reviewers, in some cases soliciting additional input from other experts in the committee. There is no formal External Review Committee, though experts outside the committee may be consulted for some papers. Reviews will be accompanied by a short summary of the reasons behind the committee’s decision with the goal of clarifying the reasons behind the decision. To conform with ACM requirements for journal publication, all POPL papers will be conditionally accepted; authors will be required to submit a short description of the changes made to the final version of the paper, including how the changes address any requirements imposed by the Review Committee. That the changes are sufficient will be confirmed by the original reviewers prior to acceptance to POPL. Authors of conditionally accepted papers must submit a satisfactory revision to the Review Committee by the requested deadline or risk rejection. For additional information about the reviewing process, see: [Principles of POPL](https://www.sigplan.org/Conferences/POPL/Principles/), a presentation of the underlying organizational and reviewing policies for POPL. For POPL 2026, policies specified in this Call for Papers supersede those in the Principles of POPL document. ### Submission Site Information The submission site is https://popl26.hotcrp.com. Authors can submit multiple times prior to the deadline. Only the last submission will be reviewed. There is no abstract deadline. The submission site requires entering author names and affiliations, relevant topics, and potential conflicts. Addition or removal of authors after the submission deadline will need to be approved by the Program Chair (as this kind of change potentially undermines the goal of eliminating conflicts during paper assignment). The submission deadline is 11:59PM July 10, 2025 anywhere on earth (AOE): https://en.wikipedia.org/wiki/Anywhere_on_Earth ### Conflicts of Interest For each submission, the authors must make sure that they properly declare all potential conflicts of interest for all of the authors of that submission. This includes marking PC conflicts as well as “Other Conflicts (external)”. A conflict caught late in the reviewing process leads to a voided review which may be infeasible to replace. Conflicts should be declared between an adviser and an advisee (e.g., Ph.D., post-doc; forever), between an author and a co-author (papers and proposals; for two years), between people at the same institution (branches of large companies or different locations of research institutes are considered to be the same institution; for two years after leaving an institution), between people with financial conflicts of interest, and between friends or relatives. If a possible reviewer does not meet the above criteria, please do not identify him/her as conflicted. Doing so could be viewed as an attempt to prevent a qualified, but possibly skeptical reviewer from reviewing your paper. If you nevertheless believe that a reviewer who does not meet the above criteria is conflicted, or if you are unsure about a possible conflict, you may identify the person and send a note to the PC Chair. Declaring a spurious conflict with the aim of excluding otherwise qualified reviewers can be grounds for desk rejection. ### Submission Guidelines Prior to the paper submission deadline, authors should upload their full anonymized paper. Here are some key requirements concerning paper submissions: * Each paper should have no more than **25 pages of text, excluding bibliography**, using the PACMPL format (specifically, the `acmart` LaTeX class with `acmsmall` option). It is a single-column page layout with a 10 pt font, 12 pt line spacing, and wider margins than recent POPL page layouts. In this format, the main text block is 5.478 in (13.91 cm) wide and 7.884 in (20.03 cm) tall. Use of a different format (e.g., smaller fonts or a larger text block) is grounds for summary rejection. The PACMPL template for LaTeX can be found at the [SIGPLAN author information page](https://www.sigplan.org/Resources/Author/), and further information about PACMPL submissions can be found on the [PACMPL author guidelines page](https://dl.acm.org/journal/pacmpl/author-guidelines). PACMPL does not support submissions in Microsoft Word. * We strongly encourage use of the `review` and `screen` options in order to make submissions easier to review. * Authors may choose which citation format they wish to use, which can be either author-year (the mandate for final versions in previous years) or numeric. * Submissions should be in PDF and printable on both US Letter and A4 paper. Papers may be resubmitted to the submission site multiple times up until the deadline, but the last version submitted before the deadline will be the version reviewed. * Submitted papers must adhere to the [SIGPLAN Republication Policy](https://www.sigplan.org/Resources/Policies/Republication/) and the [ACM Policy on Plagiarism](https://www.acm.org/publications/policies/plagiarism-overview ). Concurrent paper submissions to other conferences, workshops, journals, or similar forums of publication are not allowed. * Authors are free to submit supplementary material along with their submissions, but it must be fully anonymized. * Authors must list all their conflicts of interest (both PC conflicts and external conflicts) in the HotCRP submission form. * Authors may include additional information in a field of the HotCRP submission form labeled "Confidential Comments for the Program Chair". This information need not be anonymized. It can be used to inform the Program Chair, for example, about sensitive issues concerning a conflict with a PC member or about supplementary material that cannot be anonymized. It is left to the discretion of the Program Chair what to do with this information. * If for some reason an author feels uncomfortable discussing a sensitive issue with the Program Chair (or communicating via the "Confidential Comments" field in HotCRP), they should feel free to get in touch instead with any of the Associate Chairs, with whom they can discuss the issue in confidence. * Submissions from PC members and Associate Chairs (except the Program Chair) are permitted and will not be handled any differently than other submissions. This is in accordance with a recent change in policy approved by the SIGPLAN Executive Committee: SIGPLAN conferences that use full double-blind review and whose PCs have at least 50 members need not hold PC submissions to a higher standard. ### Artifact Evaluation for Accepted Papers Authors of conditionally accepted papers will be invited to formally submit supporting materials to the Artifact Evaluation process. Artifact Evaluation is run by a separate committee whose task is to assess how the artifacts support the work described in the papers. Artifact submission is strongly encouraged but voluntary and will not influence the final decision regarding the papers. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers are encouraged to make these materials publicly available upon publication of the proceedings, by including them as “source materials” in the ACM Digital Library. ### Copyright, Publication, and Presentation As a Gold Open Access journal, PACMPL is committed to making peer-reviewed scientific research free of restrictions on both access and (re-)use. Authors are strongly encouraged to support libre open access by licensing their work with the [Creative Commons Attribution 4.0 International (CC BY) license](https://creativecommons.org/licenses/by/4.0/), which grants readers liberal (re-)use rights. Authors of accepted papers will be required to choose one of the following publication rights: * Author licenses the work with a [Creative Commons license](https://creativecommons.org/), retains copyright, and (implicitly) grants ACM non-exclusive permission to publish (suggested choice). * Author retains copyright of the work and grants ACM a non-exclusive permission to publish license. * Author retains copyright of the work and grants ACM an exclusive permission to publish license. * Author transfers copyright of the work to ACM. These choices follow from ACM Copyright Policy and ACM Author Rights, corresponding to ACM’s “author pays” option. While PACMPL may ask authors who have funding for open-access fees to voluntarily cover the article processing charge, payment is not required for publication. PACMPL and SIGPLAN continue to explore the best models for funding open access, focusing on approaches that are sustainable in the long-term while reducing short-term risk. All papers will be archived by the ACM Digital Library. Authors will have the option of including supplementary material with their paper. The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. Authors of accepted papers are encouraged to give a short talk (roughly 25 minutes long) at the conference, according to the conference schedule. Authors who wish to present but who cannot attend in person will be provided with some option for remote presentation, as well as some mechanism for remote interaction with conference participants. ### Important update on ACM’s new open access publishing model for 2026 ACM Conferences! Starting January 1, 2026, ACM will fully transition to Open Access. All ACM publications, including those from ACM-sponsored conferences, will be 100% Open Access. Authors will have two primary options for publishing Open Access articles with ACM: the ACM Open institutional model or by paying Article Processing Charges (APCs). With over 1,800 institutions already part of ACM Open, the majority of ACM-sponsored conference papers will not require APCs from authors or conferences (currently, around 70-75%). Authors from institutions not participating in ACM Open will need to pay an APC to publish their papers, unless they qualify for a financial or discretionary waiver. To find out whether an APC applies to your article, please consult the list of participating institutions in ACM Open and review the APC Waivers and Discounts Policy. Keep in mind that waivers are rare and are granted based on specific criteria set by ACM. Understanding that this change could present financial challenges, ACM has approved a temporary subsidy for 2026 to ease the transition and allow more time for institutions to join ACM Open. The subsidy will offer: $250 APC for ACM/SIG members and $350 for non-members. This represents a 65% discount, funded directly by ACM. Authors are encouraged to help advocate for their institutions to join ACM Open during this transition period. This temporary subsidized pricing will apply to all conferences scheduled for 2026. ### Distinguished Paper Awards At most 10% of the accepted papers of POPL 2026 will be designated as Distinguished Papers. This award highlights papers that the Review Committee thinks should be read by a broad audience due to their relevance, originality, significance, and clarity. The selection of the distinguished papers will be made based on the final version of the paper and through an additional review process.

1 0

POPL 2026 Call for Workshops
by Ningning Xie 24 Jun '25

24 Jun '25

The 53rd ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2026) will be held in Rennes, France. POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Events focusing on experimental and theoretical topics are welcome. We invite proposals for workshops and other events to be co-located with POPL 2026. All co-located events are sponsored by SIGPLAN (http://acm.org/sigplan/) Workshops should be more informal and focused than POPL itself, and include sessions that enable interaction among the workshop attendees. The preference is for one-day workshops, but other schedules can also be considered. --------------------------------------------------------------------- Submission details Deadline for submission: 25 July 2025 Notification of acceptance: 1 August 2025 A workshop proposal should provide the following information: * Name of the workshop. * A short description (150-200 words) of the workshop. * Call for submissions. * Duration of the workshop. * Whether the workshop will be Conference-approved or SIGPLAN-approved (see below). * Organizers: names, affiliation, contact information, brief (100 words) biography. * Event format: workshop; type of submissions if any; review process; results dissemination. * Expected attendance and target audience. * Potential PC members - please do not contact them before the workshop is approved. * History of the workshop. * Plans for remote participation Please submit your proposals at https://popl26.sigplan.org/track/POPL-2026-workshops-and-co-located-events --------------------------------------------------------------------- SIGPLAN Sponsorship POPL co-located events are sponsored by SIGPLAN (http://sigplan.org/) There are two kinds of co-located events: Conference-approved (no proceedings) and SIGPLAN-approved (proceedings in the ACM Digital Library). See http://www.sigplan.org/Resources/Guidelines/Workshops/ for more information, including a full listing of prescriptions for Conference-approved and SIGPLAN-approved workshops. SIGPLAN-approved workshops must respect the SIGPLAN Diversity Policy. Proposals for SIGPLAN-approved workshops must additionally include the gender, country of affiliation, and professional status of potential PC members. See https://www.sigplan.org/Resources/Policies/Diversity/ for more details. --------------------------------------------------------------------- Selection committee All submissions will be evaluated by a committee comprising the workshops co-chairs, the general chair, and the program chair. --------------------------------------------------------------------- Further information Any questions regarding POPL 2026 co-located event proposals should be addressed to the workshops chairs, Robert Rand (rand(a)uchicago.edu) and Alan Schmitt (alan.schmitt(a)inria.fr)

1 0

IFL 2025, deadline extension
by Mart Lubbers 13 Jun '25

13 Jun '25

===================================================================== IFL 2025 37th Symposium on Implementation and Application of Functional Languages Montevideo, Uruguay October 1-3, 2025 https://www.fing.edu.uy/inco/congresos/ifl2025 ===================================================================== ### 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 2025 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 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 specialisation - run-time code generation - partial evaluation - (abstract) interpretation - meta-programming - 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 ### Peer-review process Differently from previous editions of IFL, IFL 2025 solicits two kinds of submissions: * Regular papers (12 pages excluding 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. Regular papers can be: accepted for publication in the formal proceedings, accepted for presentation at the symposium or rejected. 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. We require that at least one of the authors present the work at IFL 2025. 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 after the symposium. 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. ### Important dates Submission of regular papers: June 23, 2025 (extended) Regular papers notification: August 4, 2025 Submission of draft papers: August 4, 2025 Draft papers notification: August 11, 2025 Deadline for early registration: September 5, 2025 Submission of pre-proceedings version: September 8, 2025 IFL Symposium: October 1-3, 2025 Submission of papers for post-proceedings: December 15, 2025 Notification of acceptance: February 28, 2026 Camera-ready version: March 30, 2026 Deadlines are end of day Anywhere on Earth (UTC-12) (https://www.timeanddate.com/time/zones/aoe) ### 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 Submit your paper here: https://easychair.org/conferences/?conf=ifl2025 Important note to authors about the new ACM open access publishing model ACM has introduced a new open access publishing model for the International Conference Proceedings Series (ICPS). Authors based at institutions that are not yet part of the ACM Open program and do not qualify for a waiver will be required to pay an article processing charge (APC) to publish their ICPS article in the ACM Digital Library. To determine whether or not an APC will be applicable to your article, please follow the detailed guidance here: https://www.acm.org/publications/icps/author-guidance. Further information may be found on the ACM website, as follows: - Full details of the new ICPS publishing model: https://www.acm.org/publications/icps/faq - Full details of the ACM Open program: https://www.acm.org/publications/openaccess - Please direct all questions about the new model to icps-info(a)acm.org. ### Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. ### Organisation PC Chairs: Alberto Pardo, Universidad de la República, Montevideo, Uruguay Marcos Viera, Universidad de la República, Montevideo, Uruguay Publicity Chair: Mart Lubbers, Radboud University, The Netherlands Local Chairs: Alberto Pardo, Universidad de la República, Montevideo, Uruguay Marcos Viera, Universidad de la República, Montevideo, Uruguay ### Program committee: Matteo Cimini, University of Massachusetts Lowell Facundo Domínguez, Tweag João Paulo Fernandes, Universidade do Porto Jeremy Gibbons, Oxford University Jurriaan Hage, Heriot Watt University Jason Hemann, Seton Hall University Maja Hanne Kirkeby, Roskilde University Mart Lubbers, Radboud University Bruno C. D. S. Oliveira, The University of Hong Kong Rinus Plasmeijer, Radboud University Andre Rauber Du Bois, Universidade Federal de Pelotas Rodrigo Ribeiro, Universidade Federal de Ouro Preto Alejandro Russo, Chalmers University of Technology João Saraiva, University of Minho Wenhao Tang, University of Edinburgh Zhixuan Yang, Imperial College London Brent Yorgey, Hendrix College Beta Ziliani, Manas.Tech Viktória Zsók, Eötvös Loránd University ### Venue IFL 2025 will be held physically in Montevideo, Uruguay. See the website for more information. https://www.fing.edu.uy/inco/congresos/ifl2025 ### Acknowledgments This call-for-papers is an adaptation and evolution of content from previous instances of IFL. We are grateful to prior organisers for their work, which is reused here.

1 0

TyDe 2025 - deadline extension, remote presentations possible
by Andras Kovacs 10 Jun '25

10 Jun '25

========================================================================= The Tenth International Workshop on TYPE-DRIVEN DEVELOPMENT Call for papers and extended abstracts Singapore, 12 October 2025 https://icfp25.sigplan.org/home/tyde-2025 ========================================================================= The Workshop on Type-Driven Development (TyDe) aims to show how static type information may be used effectively in the development of computer programs. Co-located with ICFP and SPLASH, this workshop brings together leading researchers and practitioners who are using or exploring types as a means of program development. We welcome all contributions, both theoretical and practical, on a range of topics including: * dependently typed programming; * generic programming; * design and implementation of programming languages, exploiting types in novel ways; * exploiting typed data, data dependent data, or type providers; * static and dynamic analyses of typed programs; * tools, IDEs, or testing tools exploiting type information; * pearls, being elegant, instructive examples of types used in the derivation, calculation, or construction of programs. ### Important dates ### * Sun 22 Jun 2025 (AoE): Submission deadline for papers and extended abstracts * Wed 23 Jul 2025: Notification of acceptance * Wed 6 Aug 2025: Submission of camera-ready papers to ACM * Sun 12 Oct 2025: Workshop ### Proceedings and Copyright ### We will have formal proceedings for full-length papers, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance, but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. The official publication date is the date the papers are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. ### Submission Details ### Submissions should fall into one of two categories: * regular research papers (12 pages); * extended abstracts (3 pages). The bibliography will not be counted against the page limits for either category. Regular research papers are expected to present novel and interesting research results, and will be included in the formal proceedings. Extended abstracts should report work in progress that the authors would like to present at the workshop. Extended abstracts will be distributed to workshop attendees but will not be published in the formal proceedings. We welcome submissions from PC members (with the exception of the two co-chairs), but these submissions will be held to a higher standard. Submission is handled through HotCRP: > https://tyde25.hotcrp.com All submissions should be in portable document format (PDF) and formatted using the ACM SIGPLAN style guidelines: > https://www.sigplan.org/Resources/Author/ Note that submissions should use the new ‘acmart’ format and the two-column ‘sigplan’ subformat (not to be confused with the one-column ‘acmsmall’ subformat). Extended abstracts must be submitted with the label ‘Extended Abstract’ clearly in the title. ### Presentations ### We expect that each accepted submission is presented at the workshop. Presentations are around 20 minutes plus questions. Remote presentation is possible. ### Participant Support ### Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover participation-related expenses. PAC also offers other support, such as for child-care expenses during the meeting or for accommodations for members with physical disabilities. For details on the PAC program, see its web page: > https://www.sigplan.org/PAC/ ### Workshop Organization ### Organizing Committee: - András Kovács (University of Gothenburg and Chalmers University of Technology) - Yuting Wang (Shanghai Jiao Tong University, China) Program Committee: - Nathan Corbyn (University of Oxford, United Kingdom) - Stephen Dolan (Jane Street, United Kingdom) - Paul Downen (University of Massachusetts at Lowell, United States) - Brandon Hewer (University of Nottingham, United Kingdom) - Hongwei Xi (Boston University, United States) - Wen Kokke (University of Edinburgh, United Kingdom) - Yao Li (Portland State University, United States) - Hidehiko Masuhara (Institute of Science Tokyo, Japan) - Stefan Monnier (Université de Montréal, Canada) - Steven Ramsay (University of Bristol, United Kingdom) - Di Wang (Peking University, China) - Zhixuan Yang (Imperial College London, United Kingdom)

1 0

IFl 2025, Second call for papers
by Mart Lubbers 03 Jun '25

03 Jun '25

===================================================================== IFL 2025 37th Symposium on Implementation and Application of Functional Languages Montevideo, Uruguay October 1-3, 2025 https://www.fing.edu.uy/inco/congresos/ifl2025 ===================================================================== ### 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 2025 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 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 specialisation - run-time code generation - partial evaluation - (abstract) interpretation - meta-programming - 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 ### Peer-review process Differently from previous editions of IFL, IFL 2025 solicits two kinds of submissions: * Regular papers (12 pages excluding 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. Regular papers can be: accepted for publication in the formal proceedings, accepted for presentation at the symposium or rejected. 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. We require that at least one of the authors present the work at IFL 2025. 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 after the symposium. 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. ### Important dates Submission of regular papers: June 16, 2025 Regular papers notification: August 4, 2025 Submission of draft papers: August 4, 2025 Draft papers notification: August 11, 2025 Deadline for early registration: September 5, 2025 Submission of pre-proceedings version: September 8, 2025 IFL Symposium: October 1-3, 2025 Submission of papers for post-proceedings: December 15, 2025 Notification of acceptance: February 28, 2026 Camera-ready version: March 30, 2026 Deadlines are end of day Anywhere on Earth (UTC-12) (https://www.timeanddate.com/time/zones/aoe) ### 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 Submit your paper here: https://easychair.org/conferences/?conf=ifl2025 Important note to authors about the new ACM open access publishing model ACM has introduced a new open access publishing model for the International Conference Proceedings Series (ICPS). Authors based at institutions that are not yet part of the ACM Open program and do not qualify for a waiver will be required to pay an article processing charge (APC) to publish their ICPS article in the ACM Digital Library. To determine whether or not an APC will be applicable to your article, please follow the detailed guidance here: https://www.acm.org/publications/icps/author-guidance. Further information may be found on the ACM website, as follows: - Full details of the new ICPS publishing model: https://www.acm.org/publications/icps/faq - Full details of the ACM Open program: https://www.acm.org/publications/openaccess - Please direct all questions about the new model to icps-info(a)acm.org. ### Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. ### Organisation PC Chairs: Alberto Pardo, Universidad de la República, Montevideo, Uruguay Marcos Viera, Universidad de la República, Montevideo, Uruguay Publicity Chair: Mart Lubbers, Radboud University, The Netherlands Local Chairs: Alberto Pardo, Universidad de la República, Montevideo, Uruguay Marcos Viera, Universidad de la República, Montevideo, Uruguay ### Program committee: Matteo Cimini, University of Massachusetts Lowell Facundo Domínguez, Tweag João Paulo Fernandes, Universidade do Porto Jeremy Gibbons, Oxford University Jurriaan Hage, Heriot Watt University Jason Hemann, Seton Hall University Maja Hanne Kirkeby, Roskilde University Mart Lubbers, Radboud University Bruno C. D. S. Oliveira, The University of Hong Kong Rinus Plasmeijer, Radboud University Andre Rauber Du Bois, Universidade Federal de Pelotas Rodrigo Ribeiro, Universidade Federal de Ouro Preto Alejandro Russo, Chalmers University of Technology João Saraiva, University of Minho Wenhao Tang, University of Edinburgh Zhixuan Yang, Imperial College London Brent Yorgey, Hendrix College Beta Ziliani, Manas.Tech Viktória Zsók, Eötvös Loránd University ### Venue IFL 2025 will be held physically in Montevideo, Uruguay. See the website for more information. https://www.fing.edu.uy/inco/congresos/ifl2025 ### Acknowledgments This call-for-papers is an adaptation and evolution of content from previous instances of IFL. We are grateful to prior organisers for their work, which is reused here.

1 0