- Haskell-Cafe - Haskell.org

CLC Elections January 2026
by Teo Camarasu 07 Feb '26

07 Feb '26

Happy new year! The Core Libraries Committee seeks nominations for three seats. ## What is CLC? CLC is a volunteer body, primarily tasked with management of the API of [`base`](https://hackage.haskell.org/package/base) package, but also owning so-called Core Libraries and responsible for [PVP](https://pvp.haskell.org/). You can find more at [our home page](https://github.com/haskell/core-libraries-committee/?tab=readme-ov-fi…. ## Who should apply? Anyone who meets the following criteria should apply: * Candidates should have enough bandwidth to review merge requests to `base` on a semi-frequent basis (~3-4 per month), and sustain this for their 3 years term in a healthy manner. * Candidates should be able to contribute opinions and analysis to issues raised by the community as a part of the CLC proposal process on a semi-frequent basis (~7 per month). * Candidates should be good communicators, and at least be able to articulate to the CLC team when they will be available vs. unavailable. * Candidates should be productive, and be able to follow through on merge requests and conversations to their completion in a diligent and timely manner. We encourage any and all who satisfy these requirements to apply. Please note that we are not looking for the biggest galaxy brain in the room – quite the opposite. We are looking for productive, motivated individuals who want to help support the ecosystem that we love. As such, we hope to build a broad sample of the community. ## How can I apply? To apply for one of these positions, send an email to [clc.nominations.2026@fastmail.com](mailto:clc.nominations.2026@fastmail.com) with: * The subject “CLC Election January 2026 - {your name}”. * Why you think you’re a good fit given the above criteria. * If applicable, please point us to some code you’ve written. Please apply before Feb 2. Cheers, Teo

1 1

NEU: Festschrift and Workshop in Honor of David Basin (Deadline: 21st May 2026)
by Achim D. Brucker 26 Jan '26

26 Jan '26

Dear Fellow Researchers! Our dear colleague and friend David Basin is turning 65 in December 2026 and this has to be celebrated! We therefore organize a Festschrift and a Fest to celebrate his birthday and his extensive research contributions! The Fest/celebration itself will be held as a one-day event on the 15th of January 2027 at ETH Zürich. We have already checked that David is available. You do not have to keep it a secret - on the contrary, it is great if you share this message with anybody who might like to contribute! We hereby cordially invite you to contribute an article to the Festschrift and present it at the Fest. We welcome contributions in all areas close to David's research and interests, including but not limited to security, privacy, formal methods, logic, automated reasoning, model checking, theorem proving, software engineering, bridge, juggling, biking and more. The articles will be lightly reviewed by the Festschrift committee, and the proceedings will be published by Springer Heidelberg in the LNCS series. David will of course love to receive a research article from you, but also short personal articles that celebrate the history and friendship with David will be very much appreciated. We would like to set a deadline for submissions at the 21st of May 2026 via our submission site <https://easychair.org/conferences/?conf=feschi2027>. Articles should be formatted in Springer’s LNCS style and not exceed 5 pages for personal articles and 16 pages for scientific articles. If you have a work that you would like to contribute that does not fit into this page limit, it might be possible, but please reach out to us first. There will be no participation fee for the Fest and coffee breaks, lunch, and dinner will be included. Travel and accommodation costs are at the expense of the participants. We are happy to provide hotel suggestions for Zürich. Submission Information: * Format: 16 pages in LNCS format, templates available at: <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…> * Submission: <https://easychair.org/conferences/?conf=feschi2027> * Website (under construction) with updates and further information: <https://feschi2027.github.io/> * Timeline: * Submission: 21 May 2026 * Notification: end of June 2026 (to be confirmed) * Camera Ready Copy: early September 2026 (to be confirmed) Please let us know if you have any questions! Best wishes Achim D. Brucker (University of Exeter) Sebastian Mödersheim (Danmarks Tekniske Universitet) Christoph Sprenger (ETH Zürich) Luca Viganò (King’s College London)

1 0

Can I coerce type constructors to Any?
by Tom Ellis 23 Jan '26

23 Jan '26

The documentation for Any says: > The type constructor Any is type to which you can unsafely coerce > any lifted type, and back. More concretely, for a lifted type t and > value x :: t, unsafeCoerce (unsafeCoerce x :: Any) :: t is > equivalent to x. https://www.stackage.org/haddock/lts-24.28/base-4.20.2.0/GHC-Base.html#t:Any Is this also true of type constructors? For example, could I coerce `f x` to `Any x`? (assuming f maps lifted types to lifted types) In particular I'm interested in things like data C f where MkC :: (forall a. Monad (f a)) => C newtype CD f = MkCD (C Any) putCD :: C f -> CD f putCD c = MkCD (unsafeCoerce c) getCD :: CD f -> C f getCD (MkCD cd) = unsafeCoerce cd Is that sound? Thanks, Tom

2 3

GSoC 2026 Call for Ideas
by Aaron Allen 12 Jan '26

12 Jan '26

Dear Haskellers, Google Summer of Code is a long-running program by Google that supports Open Source projects. Haskell has been involved in the Google Summer of Code program almost since its inception and we are hoping to participate again in 2026! In order to do this we need a collection of ideas for participants to select from. In the past this has included significant improvements to Haskell projects such as GHC, Cabal, and HLS - and it can include your project as well! This is a great opportunity to find new contributors for your project and many past participants have become involved long-term. You can find more info and instructions on how to participate here: https://summer.haskell.org/ideas.html.

1 0

2nd Call for Participation: BOB 2026 (Berlin, Mar 13)
by Michael Sperber 12 Jan '26

12 Jan '26

Note the early-bird discount runs out on Friday! ========================================================================= BOB 2026 Conference “What happens if we simply use what’s best?” March 13, 2026, Berlin https://bobkonf.de/2026/ Program: https://bobkonf.de/2026/program.html Registration: https://bobkonf.de/2026/registration.html ========================================================================= BOB conference is a place for developers, architects, and decision-makers to explore technologies beyond the mainstream in software development and to find the best tools available to software developers today. Our goal is for all participants of BOB to return home with new insights that enable them to improve their own software development experience. The program features 16 talks and 8 tutorials on current topics: https://bobkonf.de/2026/program.html Talk subjects includes functional programming, software architecture, formal methods, accessibility, UI programming, reactive systems, and domain-driven design. BOB tutorial include sessions on TypeScript, OCaml, Haskell, Agda, accessibility, and reactive systems. Stefan Kaufmann will give the keynote talk on digital sovereignty. Registration is open - many discount options - including limited early-bird discounts - are available, as are grants for members of groups underrepresented in tech. https://bobkonf.de/2026/registration.html

1 0

Critical code generation bug with GHC 9.12.3
by Zubin Duggal 08 Jan '26

08 Jan '26

Hello all, Unfortunately we discovered a major code generation regression in GHC 9.12.3 that results in incorrect runtime results for certain operations involving sub-word divisions. We recommend avoiding upgrading to this minor release at this time. See https://gitlab.haskell.org/ghc/ghc/-/issues/26711 for more details. This is the same bug that affected GHC 9.12.1. A patch re-introducing this bug was accidently backported onto the 9.12.3 branch and went unnoticed throughout the testing period. We are taking steps to ensure similar situations are less likely to occur again, including looking at ways to improve our testing procedure for minor GHC release, potentially using the Stackage infrastructure to run the testsuites of a broad range of packages to detect such issues. We are also starting to prepare GHC 9.12.4 with a fix, which we hope to release soon. However, a significant amount of time has passed since the initial set of backports to GHC 9.12.3 were completed, which means that a number of merge requests addressing issues of various severities has been marked for backporting to the GHC 9.12 branch. We are in the process of triaging this list and preparing a robust and reliable GHC 9.12.4 release. Thanks, Zubin.

1 0

GHC 9.14.1 is now available
by Zubin Duggal 27 Dec '25

27 Dec '25

The GHC developers are very pleased to announce the release of GHC 9.14.1. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][]. GHC 9.14 brings a number of new features and improvements, including: * Significant improvements in specialisation: * The `SPECIALISE` pragma now allows use of type application syntax * The `SPECIALISE` pragma can be used to specialise for expression arguments as well as type arguments. * Specialisation is now considerably more reliable in the presence of `newtype`s * Significant GHCi improvements including: * Correctness and performance improvements in the bytecode interpreter * Features in the GHCi debugger * Support for multiple home units in GHCi * Implementation of the [Explicit Level Imports proposal][levels] * `RequiredTypeArguments` can now be used in more contexts * Greatly improved [SSE/AVX2 support][sse] in the x86 native code generator backend * Initial native code generator support for LoongArch * The WebAssembly backend now supports [evaluation via the interpreter][wasm-ghci], allowing GHCi and TemplateHaskell evaluation, including `foreign import javascript` usage from within the browser * A new primop [`annotateStack#`][annotate-stack] for pushing arbitrary data onto the call stack for later extraction when decoding stack traces * [`-Wincomplete-record-selectors`][incomplete-selectors] is now part of `-Wall`. Libraries compiled with `-Werror` may need adjustment. * A major update of the Windows toolchain * Improved compatibility with [macOS Tahoe][macos] * ... and many more A full accounting of changes can be found in the [release notes][]. See the [migration guide][] for guidance on migrating programs to this release. Note that while this release makes many improvements in the specialisation optimisation, polymorphic specialisation remains disabled by default in the release due to concern over regressions of the sort identified in [#26329][T26329]. Users needing more aggressive specialisation can explicitly enable this feature with the `-fpolymorphic-specialisation` flag. Depending upon our experience with 9.14.1, we may enable this feature by default in a later minor release. GHC development is sponsored by: * [Juspay](https://juspay.com/) * [QBayLogic](https://qbaylogic.com/) * [Channable](https://www.channable.com/) * [Haskell Foundation](https://haskell.foundation/) * [Serokell](https://serokell.io/) * [Well-Typed](https://well-typed.com/) * [Tweag](https://www.tweag.io/) * [Dotcom-Monitor](https://www.dotcom-monitor.com/) * [LoadView](https://www.loadview-testing.com/) * [Web Hosting Buddy](https://webhostingbuddy.com/) * [Find My Electric](https://www.findmyelectric.com/) * [Standard Chartered](https://www.sc.com) * [UpCloud](https://upcloud.com) We would like to thank these sponsors 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 comprises this release. As always, do give this release a try and open a [ticket][] if you see anything amiss. [downloads.haskell.org] https://downloads.haskell.org/ghc/9.14.1 [release notes]: https://downloads.haskell.org/ghc/9.14.1/docs/users_guide/9.14.1-notes.html [ticket]: https://gitlab.haskell.org/ghc/homepage/-/issues/new [macos]: https://gitlab.haskell.org/ghc/ghc/-/issues/26166 [T26329]: https://gitlab.haskell.org/ghc/ghc/-/issues/26329 [levels]: https://github.com/ghc-proposals/ghc-proposals/blob/master/proposals/0682-e… [wasm-ghci]: https://www.tweag.io/blog/2025-04-17-wasm-ghci-browser/ [incomplete-selectors]: https://github.com/ghc-proposals/ghc-proposals/blob/master/proposals/0516-i… [annotate-stack]: https://gitlab.haskell.org/ghc/ghc/-/issues/26218 [migration guide]: https://gitlab.haskell.org/ghc/ghc/-/wikis/migration/9.14 [sse]: https://gitlab.haskell.org/ghc/ghc/-/issues/25030

2 1

GHC 9.12.3 is now available
by Zubin Duggal 27 Dec '25

27 Dec '25

The GHC developers are very pleased to announce the release of GHC 9.12.3. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][]. GHC 9.12.3 is a bug-fix release fixing many issues of a variety of severities and scopes, including: * Fix a number of crashes and miscompilations in the compiler frontend (#25004, #25960, #26256) * Improvements to efficiency of the runtime linker (#26009) * Fixes for several bugs in bytecode generation and the bytecode interpreter (#23210, #25975, #25750) * Fixes for bugs in the handling of WHITEHOLEs in the RTS (#26204, #26205) * Fix incorrect code generation for SSE vector operations (#25859) * Fix a use-after-free in the Windows runtime linker (#26613) * Support for synchronous JSFFI exports for the wasm backend * 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][]. GHC development is sponsored by: * [Juspay](https://juspay.com/) * [QBayLogic](https://qbaylogic.com/) * [Channable](https://www.channable.com/) * [Haskell Foundation](https://haskell.foundation/) * [Serokell](https://serokell.io/) * [Well-Typed](https://well-typed.com/) * [Tweag](https://www.tweag.io/) * [Dotcom-Monitor](https://www.dotcom-monitor.com/) * [LoadView](https://www.loadview-testing.com/) * [Web Hosting Buddy](https://webhostingbuddy.com/) * [Find My Electric](https://www.findmyelectric.com/) * [Standard Chartered](https://www.sc.com) * [UpCloud](https://upcloud.com) * [Mercury](https://mercury.com) We would like to thank these sponsors 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.12.3/docs/users_guide/9.12.3-notes.html [status]: https://gitlab.haskell.org/ghc/ghc/-/wikis/GHC-status [downloads.haskell.org] https://downloads.haskell.org/ghc/9.12.3 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new

2 1

[TFP 2026] 1st Call for Participation for the 27th International Symposium on Trends in Functional Programming, Odense, Denmark, January 27-29 2026 - TFPiE Jan 26
by Peter Achten 24 Dec '25

24 Dec '25

TFP 2026 -- Call For Participation (trendsfp.github.io [1]) Venue TFPiE and TFP will take place in-person in Odense, Denmark, at the University of Southern Denmark. Dates Early registration: 31 December, 2025 Late registration: 20 January , 2026 TFPiE Workshop: Monday 26 January, 2026 TFP Symposium: Tuesday 27 - Thursday 29 January, 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. Keynote speakers We are happy to have the following keynotes in the programme: Alex Gerdes (TFPiE), Gothenburg University and Chalmers: "Generating Feedback from Rewrite Strategies for Interactive Exercises" Joachim Breitner, Lean Focused Research Organization: "Lean Highlights" Ohad Kammar, University of Edinburgh: "Synthetic Convolution" András Kovács, Gothenburg University and Chalmers: TBA Programme We have 13 paper presentations, as well as invited talks. A preliminary programme schedule can be found here: trendsfp.github.io/schedule.html [2] Excursion and banquet In the afternoon and evening of Wednesday January 28th we have an excursion to H.C. Andersen Museum, followed by a break before heading to Madklubben for the conference banquet. Travel Scholarship Thanks to the generous support from the Carlsberg Foundation, we are able to offer travel scholarships (DKK 3000 ~ USD 470 ~ EUR 400) to young researchers traveling to attend TFP 2026 in Odense, Denmark. Information on how to apply can be found here: https://trendsfp.github.io/scholarship.html Links: ------ [1] https://eur01.safelinks.protection.outlook.com/?url=http%3A%2F%2Ftrendsfp.g… [2] https://eur01.safelinks.protection.outlook.com/?url=http%3A%2F%2Ftrendsfp.g…

1 0

Call for Participation: BOB 2026 (Berlin, Mar 13)
by Stefan Wehr 19 Dec '25

19 Dec '25

there's quite a bit of Haskell material at BOB 2026. Come along! ========================================================================= BOB 2026 Conference “What happens if we simply use what’s best?” March 13, 2026, Berlin https://bobkonf.de/2026/ Program: https://bobkonf.de/2026/program.html Registration: https://bobkonf.de/2026/registration.html ========================================================================= BOB conference is a place for developers, architects, and decision-makers to explore technologies beyond the mainstream in software development and to find the best tools available to software developers today. Our goal is for all participants of BOB to return home with new insights that enable them to improve their own software development experience. The program features 16 talks and 8 tutorials on current topics: https://bobkonf.de/2026/program.html Talk subjects includes functional programming, software architecture, formal methods, accessibility, UI programming, reactive systems, and domain-driven design. BOB tutorial include sessions on TypeScript, OCaml, Haskell, Agda, accessibility, and reactive systems. Stefan Kaufmann will give the keynote talk on digital sovereignty. Registration is open - many discount options - including limited early-bird discounts - are available, as are grants for members of groups underrepresented in tech. https://bobkonf.de/2026/registration.html

1 0

Call for Participation: BOB 2026 (Berlin, Mar 13)
by Michael Sperber 15 Dec '25

15 Dec '25

BOB 2026 has lots of exciting content on functional programming, type systems and formal methods! ========================================================================= BOB 2026 Conference “What happens if we simply use what’s best?” March 13, 2026, Berlin https://bobkonf.de/2026/ Program: https://bobkonf.de/2026/program.html Registration: https://bobkonf.de/2026/registration.html ========================================================================= BOB conference is a place for developers, architects, and decision-makers to explore technologies beyond the mainstream in software development and to find the best tools available to software developers today. Our goal is for all participants of BOB to return home with new insights that enable them to improve their own software development experience. The program features 16 talks and 8 tutorials on current topics: https://bobkonf.de/2026/program.html Talk subjects includes functional programming, software architecture, formal methods, accessibility, UI programming, reactive systems, and domain-driven design. BOB tutorial include sessions on TypeScript, OCaml, Haskell, Agda, accessibility, and reactive systems. Stefan Kaufmann will give the keynote talk on digital sovereignty. Registration is open - many discount options - including limited early-bird discounts - are available, as are grants for members of groups underrepresented in tech. https://bobkonf.de/2026/registration.html

1 0

TFPiE 2026, Call for Submissions
by Mart Lubbers 15 Dec '25

15 Dec '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 Universiteit, 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, Gothenburg, Sweden ## Registration information See https://wiki.tfpie.science.ru.nl/TFPIE2026 for updated information and see https://trendsfp.github.io/ for info on registration 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

Soundness of forall mixed with Coercible
by Tom Ellis 13 Dec '25

13 Dec '25

Is it sound to define forallCoercible :: forall f g. (forall a. Coercible (f a) (g a)) => Coercion (Forall f) (Forall g) forallCoercible = unsafeCoerce (Coercion @(f Any) @(g Any)) I'm having trouble coming up with a reason why it is not, but my intuition for these things is not very good. Thanks, Tom

4 11

Re: State of Haskell 2025
by Olaf Klinke 12 Dec '25

12 Dec '25

> Because I haven't tried to upgrade: the risk of breaking something > exceeds any 'benefit' from new 'features', none of which do I want to > use. If you did not try to upgrade, how did you find out that upgrading would break your code? Indeed, only offering "yes" and "no" as options is not enough for this question. "Bottom" would be the appropriate answer in your case, and I'd have chosen that, too. Olaf

3 2

GHC 9.12.3-rc3 is now available
by Zubin Duggal 11 Dec '25

11 Dec '25

The GHC developers are very pleased to announce the availability of the third 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 22 December 2025. The changes from the first release candidate are - Fix use after free on windows due to a linker optimisation introduced in an earlier RC (#26613) - A fix for a bug in the configure script which result in the LLVM toolchain not being detected in certain situations (#26564) - Fixes for the WASM backend GHC development is sponsored by: * [Juspay](https://juspay.com/) * [QBayLogic](https://qbaylogic.com/) * [Channable](https://www.channable.com/) * [Haskell Foundation](https://haskell.foundation/) * [Serokell](https://serokell.io/) * [Well-Typed](https://well-typed.com/) * [Tweag](https://www.tweag.io/) * [Dotcom-Monitor](https://www.dotcom-monitor.com/) * [LoadView](https://www.loadview-testing.com/) * [Web Hosting Buddy](https://webhostingbuddy.com/) * [Find My Electric](https://www.findmyelectric.com/) * [Standard Chartered](https://www.sc.com) * [UpCloud](https://upcloud.com) We would like to that these sponsors 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-rc3 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new

1 0

State of Haskell 2025
by Jose Calderon 11 Dec '25

11 Dec '25

Hello everyone! The Haskell Foundation is reviving Taylor Fausak's State of Haskell Survey. It's been a few years and so we're doing it a bit differently, but the plan is to start doing this yearly again so that we can collect longitudinal data on the Haskell community and ecosystem. Please take the ~10 minutes to fill this out and share it with friends/colleagues/coworkers, whether or not they are users of Haskell. https://www.surveymonkey.com/r/6M3Z6NV Thanks! -Jose

4 4

ICFP 2026: Call for Workshops, Tutorials, and Co-Located Events
by ICFP Publicity 09 Dec '25

09 Dec '25

ICFP 2026: Call for Workshops, Tutorials, and Co-located Events The 31st ACM SIGPLAN International Conference on Functional Programming (ICFP) invites proposals for workshops, tutorials, and co-located events. ICFP will be held in Indianapolis, IN, United States from *Monday, August 24 to Saturday, August 29, 2026*. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementation, principles, and uses of functional programming. Proposals are invited for: - *Workshops* (and other co-located events, such as symposiums and side meetings) to be affiliated with ICFP 2026 and sponsored by SIGPLAN. We welcome proposals for events that facilitate discussions, presentations, hands-on activities, and other engaging formats to foster the exchange of new ideas and community building. These events should be less formal and more focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules may be possible. - *Tutorials* (or panels, discussions, etc.), lasting approximately 3 hours each, to be presented during ICFP and its co-located workshops and other events. Tutorials may focus either on a concrete technology or on a theoretical or mathematical tool. Tutorials may be intended primarily for researchers or for practitioners. Ideally, tutorials will have a concrete result, such as “Learn to do X with Y” rather than “Learn language Y”. The workshops, tutorials, etc. may occur on August 24th (the day before ICFP) and August 28-29th (the two days after ICFP). *Submission Portal*: https://icfp26events.hotcrp.com/ *All co-located events* must submit a proposal — workshops, tutorials, symposiums, or side meetings. Submission Details <https://icfp26.sigplan.org/track/icfp-2026-icfp-tutorials#submission-details> - Deadline for Workshop Proposal Submission: January 15, 2026 - Notification of Acceptance: January 29, 2026 - Deadline for Tutorial Proposal Submission: June 21, 2026 - Notification of Acceptance: June 28, 2026 Prospective organizers of workshops, symposia, or co-located events with PCs should submit proposals before the Workshop deadline. Proposals should outline the objectives, intended audience, and planned activities. Workshops that plan to have proceedings in the ACM DL will need SIGPLAN approval of their proposed PC list. The workshop chairs will solicit approval and send any feedback to workshop organizers. Workshops without proceedings still need conference approval from ICFP. See the Submission Portal for details. The selection committee will review proposals. Successful workshops may be asked to prepare a summary report suitable for publication in SIGPLAN Notices. Prospective organizers of tutorials, panels, or discussions should submit proposals by the Tutorial deadline. Proposals should outline the objectives, intended audience, and planned activities. See the Submission Portal for details. Selection Committee <https://icfp26.sigplan.org/track/icfp-2026-icfp-tutorials#selection-committ…> Event proposals will be evaluated by a committee comprising members from the ICFP 2026 organizing committee, in collaboration with the SIGPLAN executive committee. Sponsorship and Reimbursement <https://icfp26.sigplan.org/track/icfp-2026-icfp-tutorials#sponsorship-and-r…> ACM-sponsored workshops are permitted to have additional sponsors (i.e., getting donations specifically for the workshop, not for the main conference). Funds go to the ACM. Workshop organizers can request reimbursement using this form: https://app.hubspot.com/documents/5374542/view/900008676?accessId=a07c28 Further information about SIGPLAN sponsorship is available at: http://www.sigplan.org/Resources/Proposals/Sponsored/ Contact Information <https://icfp26.sigplan.org/track/icfp-2026-icfp-tutorials#contact-informati…> For inquiries, please contact the workshop co-chairs: Ben Greenman: blg(a)cs.utah.edu Jiasi Shen: sjs(a)cse.ust.hk We look forward to your proposals and to creating a vibrant and engaging workshop program at ICFP 2026!

1 0

CGO 2026 - Call for Participation
by Luisa Cicolini 09 Dec '25

09 Dec '25

CGO 2026<https://2026.cgo.org/> registration is now open! The IEEE/ACM 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 will be co-located as part of HPCA/CGO/PPoPP/CC 2026. The early-bird registration deadline<https://2026.cgo.org/attending/registration> is December 31st. For more information, please visit the CGO conference website at https://2026.cgo.org/. We hope to see you there! Luisa Cicolini

1 0

POPL 2026 Second Call for Participation - Early registration: 12 December
by Ningning Xie 08 Dec '25

08 Dec '25

======================================= Call for Participation ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2026) January 11-17, 2026, Rennes, France. https://popl26.sigplan.org/ ======================================= - Early registration deadline: ** 12 December 2025 ** - Register here: https://popl26.sigplan.org/attending/registration - The POPL program: https://popl26.sigplan.org/track/POPL-2026-popl-research-papers ======================================= The 53rd ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2026) is a forum for the discussion of all aspects of programming languages and programming systems. Location: le Couvent des Jacobins, 20 place Saint-Anne, 35000 Rennes, France Dates: - Main conference: Wed 14 - Fri 16 January - Workshops, tutorials, co-located events: Sun 11, Mon 12, Tue 13 and Sat 17 January Keynote Speakers: - Damien Pous, CNRS, Medium-scale automation for proof assistants - Caroline Trippel, Stanford University, Hardware-Software Contracts for High Assurance with Applications to Side-Channel Security Organizers: - General Chair: Sandrine Blazy, University of Rennes - PC Chair: Suresh Jagannathan, Purdue University Full details of the conference and co-located events: https://popl26.sigplan.org/

1 0

PhD studentships in Nottingham
by Graham Hutton (staff) 05 Dec '25

05 Dec '25

Dear all, The School of Computer Science at the University of Nottingham in the UK is seeking applications for a number of fully-funded PhD studentships: https://tinyurl.com/uon-phds-2026 Applicants in the area of the Functional Programming Lab (tinyurl.com/fp-notts) are strongly encouraged! If you are interested in applying, please contact a potential supervisor as soon as possible; the application deadline is 7th January 2026: Thorsten Altenkirch - constructive logic, proof assistants, homotopy type theory, category theory, lambda calculus. Ulrik Buchholtz - homotopy type theory, synthetic homotopy theory, proof assistants, constructive mathematics, and related topics. Graham Hutton - functional programming, haskell, category theory, program verification, program calculation. Nicolai Kraus - not seeking a student through this scheme, but has separate funding available for a home/international student. Dan Marsden - category theory, logic, finite model theory, diagrammatic reasoning, foundations of computer science. Best wishes, The FP Lab University of Nottingham +-----------------------------------------------------------+ Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK https://tinyurl.com/uon-phds-2026 Applications are invited for fully-funded PhD studentships in the School of Computer Science, starting on 1st October 2026. The topics for the studentships are open, but your research proposal should relate to the interests of one of the School's research groups: Cyber-Physical Health and Assistive Robotics; Computational Optimisation and Learning; Computer Vision; Cyber Security; Functional Programming; Intelligent Modelling and Analysis; Mixed Reality; Uncertainty in Data and Decision Making; Visualisation and Computer Graphics; Responsible Digital Futures. The studentships available are fully funded for 3.5 years and include a stipend of £20,780 per year and tuition fees for home students. They are open to students of any nationality, but non-home students must be able to cover the additional cost of international tuition fees. Applicants are expected to have a first-class Bachelor or Masters degree or international equivalent, in a related discipline. If you are interested in applying, please contact a potential supervisor as soon as possible, and at least two weeks prior to the closing date. If the supervisor wishes to support your application, they will direct you to make an official application through the MyNottingham system. Closing date for applications: Wednesday 7th January 2026 +-----------------------------------------------------------+ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.

2 1

How to use locally compiled GHC?
by Stefan Klinger 02 Dec '25

02 Dec '25

Hello, what do I have to do to use a locally compiled GHC on my own projects? Background: I'm working on this [1]. I've managed to compile GHC following the instructions given on https://ghc.dev, also here [2]. I can run $ ./_build/stage1/bin/ghc --interactive GHCi, version 9.15.20251202: https://www.haskell.org/ghc/ :? for help with the expected result. However, the locally built compiler (master branch, without any modifications) fails with all but the most primitive of my own projects. I try to do this by adding a line with-compiler: /home/sk/prg/ghc/master/_build/stage1/bin/ghc to the `cabal.project` file of a project. Then, success depends on the dependencies of a project. Here is one using `criterion`: $ cabal build Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.12.1.0 supports 'ghc' version < 9.12): /home/sk/prg/ghc/third/_build/stage1/bin/ghc is version 9.15.20251202 Resolving dependencies... Error: [Cabal-7107] Could not resolve dependencies: [__0] next goal: foo (user goal) [__0] rejecting: foo-1.0 (constraint from user target requires ==0.0.1) [__0] trying: foo-0.0.1 [__1] trying: criterion-1.6.4.1 (dependency of foo) [__2] trying: vector-algorithms-0.9.1.0 (dependency of criterion) [__3] trying: primitive-0.9.1.0 (dependency of vector-algorithms) [__4] next goal: base (dependency of foo) [__4] rejecting: base-4.22.0.0/installed-inplace (conflict: primitive => base>=4.10 && <4.22) [__4] rejecting: base; 4.21.0.0, 4.20.2.0, 4.20.1.0, 4.20.0.1, 4.20.0.0, 4.19.2.0, 4.19.1.0, 4.19.0.0, 4.18.3.0, 4.18.2.1, 4.18.2.0, 4.18.1.0, 4.18.0.0, 4.17.2.1, 4.17.2.0, 4.17.1.0, 4.17.0.0, 4.16.4.0, 4.16.3.0, 4.16.2.0, 4.16.1.0, 4.16.0.0, 4.15.1.0, 4.15.0.0, 4.14.3.0, 4.14.2.0, 4.14.1.0, 4.14.0.0, 4.13.0.0, 4.12.0.0, 4.11.1.0, 4.11.0.0, 4.10.1.0, 4.10.0.0, 4.9.1.0, 4.9.0.0, 4.8.2.0, 4.8.1.0, 4.8.0.0, 4.7.0.2, 4.7.0.1, 4.7.0.0, 4.6.0.1, 4.6.0.0, 4.5.1.0, 4.5.0.0, 4.4.1.0, 4.4.0.0, 4.3.1.0, 4.3.0.0, 4.2.0.2, 4.2.0.1, 4.2.0.0, 4.1.0.0, 4.0.0.0, 3.0.3.2, 3.0.3.1 (constraint from non-reinstallable package requires installed instance) [__4] fail (backjumping, conflict set: base, foo, primitive) After searching the rest of the dependency tree exhaustively, these were the goals I've had most trouble fulfilling: base, primitive, vector-algorithms, criterion, uvector, foo Try running with --minimize-conflict-set to improve the error message. And similar problems occur when depending on `unliftio` or `attoparsec`. How should I approach this? And I expect to run into similar questions in the near future, i.e., related to bulding, testing, using, but not necessarily related to [1]. Where should I ask? Kind regards Stefan [1]: https://github.com/haskell/core-libraries-committee/issues/367 [2]: https://gitlab.haskell.org/ghc/ghc/-/wikis/contributing -- 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.

2 2

GHC 9.14.1-rc3 is now available
by Zubin Duggal 02 Dec '25

02 Dec '25

The previous email had an incorrect subject line, GHC 9.14.1-rc3 is what it was intended to say. The contents following this are the same. The GHC developers are very pleased to announce the availability of the third release candidate of GHC 9.14.1. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][]. The changes from the second release candidate are: - Fix RTS segfaults in certain situations (#26495) - Fix use after free on windows due to a linker optimisation introduced in an earlier RC (#26613) GHC 9.14 will bring a number of new features and improvements, including: * Significant improvements in specialisation: * The `SPECIALISE` pragma now allows use of type application syntax * The `SPECIALISE` pragma can be used to specialise for expression arguments as well as type arguments. * Specialisation is now considerably more reliable in the presence of `newtype`s * Significant GHCi improvements including: * Correctness and performance improvements in the bytecode interpreter * Features in the GHCi debugger * Support for multiple home units in GHCi * Implementation of the [Explicit Level Imports proposal][levels] * `RequiredTypeArguments` can now be used in more contexts * SSE/AVX2 support in the x86 native code generator backend * A major update of the Windows toolchain and improved compatibility with macOS Tahoe * ... and many more A full accounting of changes can be found in the [release notes][]. Given the many specialisation improvements and their potential for regression, we would very much appreciate testing and performance characterisation on downstream workloads. Note that while this release makes many improvements in the specialisation optimisation, polymorphic specialisation will remain disabled by default in the final release due to concern over regressions of the sort identified in [#26329][T26329]. Users needing more aggressive specialisation can explicitly enable this feature with the `-fpolymorphic-specialisation` flag. Depending upon our experience with 9.14.1, we may enable this feature by default in a later minor release. GHC development is sponsored by: * [Juspay](https://juspay.com/) * [QBayLogic](https://qbaylogic.com/) * [Channable](https://www.channable.com/) * [Haskell Foundation](https://haskell.foundation/) * [Serokell](https://serokell.io/) * [Well-Typed](https://well-typed.com/) * [Tweag](https://www.tweag.io/) * [Dotcom-Monitor](https://www.dotcom-monitor.com/) * [LoadView](https://www.loadview-testing.com/) * [Web Hosting Buddy](https://webhostingbuddy.com/) * [Find My Electric](https://www.findmyelectric.com/) * [Standard Chartered](https://www.sc.com) * [UpCloud](https://upcloud.com) We would like to that these sponsors 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. [downloads.haskell.org] https://downloads.haskell.org/ghc/9.14.1-rc3 [release notes]: https://downloads.haskell.org/ghc/9.14.1-rc3/docs/users_guide/9.14.1-notes.… [ticket]: https://gitlab.haskell.org/ghc/homepage/-/issues/new [macos]: https://gitlab.haskell.org/ghc/ghc/-/issues/26166 [T26329]: https://gitlab.haskell.org/ghc/ghc/-/issues/26329 [levels]: https://github.com/ghc-proposals/ghc-proposals/blob/master/proposals/0682-e…

1 0

GHC 9.12.3-rc3 is now available
by Zubin Duggal 02 Dec '25

02 Dec '25

The GHC developers are very pleased to announce the availability of the third release candidate of GHC 9.14.1. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][]. The changes from the second release candidate are: - Fix RTS segfaults in certain situations (#26495) - Fix use after free on windows due to a linker optimisation introduced in an earlier RC (#26613) GHC 9.14 will bring a number of new features and improvements, including: * Significant improvements in specialisation: * The `SPECIALISE` pragma now allows use of type application syntax * The `SPECIALISE` pragma can be used to specialise for expression arguments as well as type arguments. * Specialisation is now considerably more reliable in the presence of `newtype`s * Significant GHCi improvements including: * Correctness and performance improvements in the bytecode interpreter * Features in the GHCi debugger * Support for multiple home units in GHCi * Implementation of the [Explicit Level Imports proposal][levels] * `RequiredTypeArguments` can now be used in more contexts * SSE/AVX2 support in the x86 native code generator backend * A major update of the Windows toolchain and improved compatibility with macOS Tahoe * ... and many more A full accounting of changes can be found in the [release notes][]. Given the many specialisation improvements and their potential for regression, we would very much appreciate testing and performance characterisation on downstream workloads. Note that while this release makes many improvements in the specialisation optimisation, polymorphic specialisation will remain disabled by default in the final release due to concern over regressions of the sort identified in [#26329][T26329]. Users needing more aggressive specialisation can explicitly enable this feature with the `-fpolymorphic-specialisation` flag. Depending upon our experience with 9.14.1, we may enable this feature by default in a later minor release. GHC development is sponsored by: * [Juspay](https://juspay.com/) * [QBayLogic](https://qbaylogic.com/) * [Channable](https://www.channable.com/) * [Haskell Foundation](https://haskell.foundation/) * [Serokell](https://serokell.io/) * [Well-Typed](https://well-typed.com/) * [Tweag](https://www.tweag.io/) * [Dotcom-Monitor](https://www.dotcom-monitor.com/) * [LoadView](https://www.loadview-testing.com/) * [Web Hosting Buddy](https://webhostingbuddy.com/) * [Find My Electric](https://www.findmyelectric.com/) * [Standard Chartered](https://www.sc.com) * [UpCloud](https://upcloud.com) We would like to that these sponsors 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. [downloads.haskell.org] https://downloads.haskell.org/ghc/9.14.1-rc3 [release notes]: https://downloads.haskell.org/ghc/9.14.1-rc3/docs/users_guide/9.14.1-notes.… [ticket]: https://gitlab.haskell.org/ghc/homepage/-/issues/new [macos]: https://gitlab.haskell.org/ghc/ghc/-/issues/26166 [T26329]: https://gitlab.haskell.org/ghc/ghc/-/issues/26329 [levels]: https://github.com/ghc-proposals/ghc-proposals/blob/master/proposals/0682-e…

1 0

Midlands Graduate School, Nottingham, UK, 13-17 April 2026
by Graham Hutton (staff) 01 Dec '25

01 Dec '25

Dear all, I'm delighted to announce that the next Midlands Graduate School (MGS) in the Foundations of Computing Science will be held in Nottingham, UK, from 13-17 April 2026. Please share in your communities! Best wishes, Graham Hutton ========================================================== MIDLANDS GRADUATE SCHOOL 2026 13-17 April 2026, Nottingham, UK https://tinyurl.com/MGS-2026 ========================================================== BACKGROUND The Midlands Graduate School (MGS) in the Foundations of Computing Science provides a yearly programme of courses on the mathematical foundations of computing, and recently celebrated its 25th year. The MGS is primarily aimed at PhD students in their first or second year, but is open to everyone, and has increasingly seen participation from industry. We welcome participants from all over the world! COURSES Eight courses will be given. Participants usually take around four courses, depending on their interests. Invited course: - To be announced Introductory courses: - Category Theory for the Lazy Functional Programmer Thorsten Altenkirch (Nottingham) - Introduction to HoTT/UF with Agda Martin Escardó (Birmingham) - Lambda Calculus and Combinatory Algebra Sam Speight (Birmingham) Advanced courses: - Effects and Call-By-Push-Value Paul Blain Levy (Birmingham) - Synthetic Homotopy Theory Axel Ljungström (Nottingham) - Categorical Algebra and Logic Sean Moss (Birmingham) - Inductive and Coinductive Reasoning with Isabelle/HOL Andrei Popescu (Sheffield) LOCAL ORGANISERS For any queries, please contact the local organisers: Ulrik Buchholtz <ulrik.buchholtz(a)nottingham.ac.uk> Dan Marsden <dan.marsden(a)nottingham.ac.uk> ========================================================== This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.

1 0

Jonathan Bowen to give the Peter Landin Semantics Seminar: 4 December 2025, BCS London office and on Zoom
by Andrei Popescu 26 Nov '25

26 Nov '25

Dear Colleagues, Please see below details about the event, which will be preceded by the BCS-FACS Annual General Meeting. The event can be attended either online or in person. Best wishes, Andrei https://www.bcs.org/events-calendar/2025/december/hybrid-facs-agm-and-peter… (free registration online) Hybrid event: *BCS-FACS AGM & Peter Landin Semantics Seminar* *Formal Methods: Whence and Whither* BCS London office (near Moorgate underground station) and on Zoom, 4 December 2025 Speaker: *J <https://sites.google.com/site/jpbowen/>**onathan Bowen <https://sites.google.com/site/jpbowen/>* (Chair of FACS)Agenda 3:30pm - Networking for attendees (refreshments and biscuits) *4:00pm* - 5:00pm *FACS AGM* (optional!) 5:15pm - Networking for physical/online attendees. Includes refreshments and biscuits for those in person. *6:00pm* - *Peter **Landin Semantics Seminar Talk* 7:00pm - Questions and answers 7:15pm - Networking for physical attendees (light refreshments) 8:00pm - Event ends for online attendees *8:30pm* - Event ends for in-person attendees Synopsis Alan Turing arguably wrote the first paper on formal methods over 75 years ago. Since then, there have been claims and counterclaims about formal methods. Tool development has been slow but aided by Moore’s Law, with the increasing power of computers. Although formal methods are not widespread in practical usage at a heavyweight level, their influence has crept into software engineering practice to the extent that they are no longer necessarily called formal methods in their use. In addition, in areas where safety and security are important, with the increasing use of computers in such applications, formal methods are a viable way to improve the reliability of such software-based systems. Their use in hardware, where a mistake can be very costly, is also important. This talk explores the journey of formal methods to the present day and speculates on future directions, including the use of Artificial Intelligence. About the speaker *Jonathan Bowen*, FBCS FRSA, is Chairman of Museophile Limited (founded in 2002), an Emeritus Professor at London South Bank University, where he was Professor of Computing, establishing and heading the Centre for Applied Formal Methods from 2000. From 2017, he has been an Adjunct Professor at Southwest University, Chongqing, China. Between 2013–15, he was Professor of Computer Science at Birmingham City University. During 2006–07, he was a visiting academic at University College London. Between 2007–09, he was a Visiting Professor at King's College, London, and during 2008–09, he was an Associate at Praxis High Integrity Systems (now Altran). From 2010, he was a Visiting Professor at the University of Westminster. During 2010, he was a Visiting Professor at Waikato University in New Zealand, and in 2012, he was a Visiting Professor at the Pratt Institute in New York. He is the current Chair of the BCS-FACS Specialist Group. ------------------------ Our events are for adults aged 16 years and over. BCS is a membership organisation. If you enjoy this event, please consider joining BCS. You’ll be very welcome. You’ll receive access to many exclusive career development tools, an introduction to a thriving professional community and also help us Make IT Good For Society. Join BCS today <https://www.bcs.org/membership/events> Please note: if you have any accessibility needs, please let us know via groups(a)bcs.uk and we’ll work with you to make suitable arrangements. If you are attending in person, please familiarise yourself with the Visitor Instructions <https://www.bcs.org/media/ww4jlkud/visitor-instructions.docx> for the BCS London Office. For overseas delegates who wish to attend the event, please note that BCS does not issue invitation letters. Photo by Markus Spiske This event is brought to you by: FACS (Formal Aspects of Computing Science) group <https://www.bcs.org/membership-and-registrations/member-communities/facs-fo…>

1 0

CfP: SLE 2026 - 19th ACM SIGPLAN International Conference on Software Language Engineering
by Andrei Chis 20 Nov '25

20 Nov '25

19th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2026) 2 - 3 July 2026 Rennes, France https://conf.researchr.org/home/sle-2026 https://www.sleconf.org/2026/ ------------------------------------------------------------------------ We are pleased to invite you to submit papers to the 19th ACM SIGPLAN International Conference on Software Language Engineering (SLE) which is devoted to the principles of software languages: their design, their implementation, and their evolution. The SLE 2026 conference will be co-located with STAF 2026 and hosted in Rennes, France, on 2 - 3 July 2026. --------------------------- Important Dates --------------------------- * Abstract submission (all tracks): Friday 27 February 2026 * Paper submission (all tracks): Friday 6 March 2026 * Paper notification (all tracks): Monday 20 April 2026 * Conference: Thursday 2 - Friday 3 July 2026 (co-located with STAF) All dates are Anywhere on Earth. --------------------------- Topics of Interest --------------------------- SLE covers software language engineering in general, rather than engineering a specific software language. Topics of interest include, but are not limited to: *Software Language Design and Implementation - Approaches to and methods for language design - Static semantics (e.g., design rules, well-formedness constraints) - Techniques for specifying behavioral/executable semantics - Generative approaches (incl. code synthesis, compilation) - Meta-languages, meta-tools, language workbenches - AI-assisted language design and optimisation * Software Language Quality - Verification and formal methods for languages - Testing techniques for languages - Simulation techniques for languages - Model-based testing - AI-assisted validation * Software Language Integration and Composition - Coordination of heterogeneous languages and tools - Mappings between languages (incl. transformation languages) - Traceability between languages - Deployment of languages to different platforms - (AI-assisted) Language refactorings * Software Language Maintenance - Software language reuse - Language evolution - Language families and variability, language and software product lines * Domain-specific approaches for any aspects of SLE (design, implementation, validation, maintenance) * Empirical evaluation and experience reports of language engineering tools - User studies evaluating usability - Performance benchmarks - Industrial applications * Synergies between Language Engineering and emerging/promising research areas - Generative AI in language engineering (e.g., AI-based language modelling, AI-driven code generation tools) - Language engineering for AI. AI and ML language engineering (e.g., ML compiler testing, code classification, DSLs for AI processes and tasks…) - Quantum language engineering (e.g., language design for quantum machines) - Language engineering for physical systems (e.g., CPS, IoT, digital twins) - Socio-technical systems and language engineering (e.g., language evolution to adapt to social requirements) --------------------------- Types of Submissions --------------------------- SLE accepts the following types of papers: * Research papers: These are “traditional” papers detailing research contributions to SLE. Papers may range from 6 to 12 pages in length and may optionally include 2 further pages of bibliography/appendices. Papers will be reviewed with an understanding that some results do not need 12 full pages and may be fully described in fewer pages. * New ideas/vision papers: These papers may describe new, unconventional software language engineering research positions or approaches that depart from standard practice. They can describe well-defined research ideas that are at an early stage of investigation. They could also provide new evidence to challenge common wisdom, present new unifying theories about existing SLE research that provides novel insight or that can lead to the development of new technologies or approaches, or apply SLE technology to radically new application areas. New ideas/vision papers must not exceed 5 pages and may optionally include 1 further page of bibliography/appendices. * SLE Body of Knowledge: The SLE Body of Knowledge (SLEBoK) is a community-wide effort to provide a unique and comprehensive description of the concepts, best practices, tools, and methods developed by the SLE community. In this respect, the SLE conference will accept surveys, essays, open challenges, empirical observations, and case study papers on the SLE topics. These can focus on, but are not limited to, methods, techniques, best practices, and teaching approaches. Papers in this category can have up to 20 pages, including bibliography/appendices. * Tool papers: These papers focus on the tooling aspects often forgotten or neglected in research papers. A good tool paper focuses on practical insights that will likely be useful to other implementers or users in the future. Any of the SLE topics of interest are appropriate areas for tool papers. Submissions must not exceed 5 pages and may optionally include 1 further page of bibliography/appendices. They may optionally include an appendix with a demo outline/screenshots and/or a short video/screencast illustrating the tool. **Workshops**: Workshops will be organised by STAF. Please inform us and contact STAF 2026 organisers if you would like to organise a workshop of interest to the SLE audience. Information on how to submit workshops can be found on the STAF 2026 Website. --------------------------- Submission --------------------------- SLE 2026 has a single submission round for papers, including a mandatory abstract registration. Authors of accepted research papers will be invited to submit artefacts. --------------------------- Format --------------------------- Submissions have to use the ACM SIGPLAN Conference Format “acmart” ( https://sigplan.org/Resources/Author/#acmart-format) please make sure that you always use the latest ACM SIGPLAN acmart LaTeX template, and that the document class definition is \documentclass[sigplan,anonymous,review]{acmart}. Do not make any changes to this format! Ensure that your submission is legible when printed on a black and white printer. In particular, please check that colours remain distinct and font sizes in figures and tables are legible. To increase fairness in reviewing, a double-blind review process has become standard across SIGPLAN conferences. Accordingly, SLE will follow the double-blind process. Author names and institutions must be omitted from submitted papers, and references to the authors’ own related work should be in the third person. No other changes are necessary, and authors will not be penalized if reviewers are able to infer their identities in implicit ways. All submissions must be in PDF format. You can access the submission site from the conference website: https://conf.researchr.org/home/sle-2026 --------------------------- Concurrent Submissions --------------------------- Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by SIGPLAN’s Republication Policy ( https://www.sigplan.org/Resources/Policies/Republication/) Submitters should also be aware of ACM’s Policy and Procedures on Plagiarism ( https://www.acm.org/publications/policies/plagiarism-overview) Submissions that violate these policies will be desk-rejected. --------------------------- Policy on Human Participant and Subject Research --------------------------- Authors conducting research involving human participants and subjects must ensure that their research complies with their local governing laws and regulations and the ACM’s general principles, as stated in the ACM’s Publications Policy on Research Involving Human Participants and Subjects ( https://www.acm.org/publications/policies/research-involving-human-particip…) If submissions are found to be violating this policy, they will be rejected. --------------------------- Reviewing Process --------------------------- All submitted papers will be reviewed by at least three members of the program committee. Research papers and tool papers will be evaluated concerning soundness, relevance, novelty, presentation, validation, and replicability. New ideas/vision papers will be evaluated primarily concerning soundness, relevance, novelty, and presentation. Tool papers will be evaluated concerning relevance, presentation, and replicability. For fairness reasons, all submitted papers must conform to the above instructions. Submissions that violate these instructions may be rejected without review at the discretion of the PC chairs. --------------------------- Artefact Evaluation --------------------------- SLE will use an evaluation process to assess the quality of artefacts on which papers are based to foster the culture of experimental reproducibility. Authors of accepted research papers are invited to submit artefacts. --------------------------- Awards --------------------------- * Distinguished paper: Award for the most notable paper, as determined by the PC chairs based on the recommendations of the program committee. * Distinguished artefact: Award for the artefact most significantly exceeding expectations, as determined by the AEC chairs based on the recommendations of the artefact evaluation committee. * Distinguished reviewer: Award for the programme committee member that produced the most useful reviews as assessed by paper authors. * Most Influential Paper: Award for the SLE 2016 paper with the greatest impact, as judged by the SLE Steering Committee. --------------------------- Publication --------------------------- All accepted papers will be published in the ACM Digital Library. **AUTHORS TAKE NOTE**: 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. --------------------------- Organisation --------------------------- * General chair: Arnaud Blouin, Univ Rennes, INSA Rennes, Inria, CNRS, IRISA * PC co-chair: Jordi Cabot, Luxembourg Institute of Science and Technology * PC co-chair: Shigeru Chiba, University of Tokyo, Japan --------------------------- Contact --------------------------- For additional information, clarification, or answers to any questions, please get in touch with the program co-chairs (jordi.cabot(a)list.lu and chiba(a)g.ecc.u-tokyo.ac.jp)

1 0

Haskell.org Committee: Call for Nominations
by Rebecca Skinner 20 Nov '25

20 Nov '25

Dear Haskellers, We are pleased to announce that nominations are now open for the Haskell.org committee. You can nominate yourself or a friend for a three-year term (2026-2028) by sending an email to [committee at haskell.org] by December 05, 2025. There are three seats open for election this year. The committee will elect members in December 2025 for the term beginning in January 2026. Self-nominations and re-nominations are also welcome. Please include any relevant information about yourself or your nominee that you think will help us make our decision. Committee members do not have to be technical experts in Haskell. We are looking for people who are enthusiastic about improving the Haskell community and come from a variety of backgrounds, such as academia, industry, open-source development, and community building. Our goal is to represent the various facets of the Haskell world, including gender, race, location, and industry or research. The committee’s responsibilities include setting policies, providing guidance for Haskell.org infrastructure, planning for the long term, and being fiscally responsible with Haskell.org funds and donations. Being a committee member does not require a significant amount of time, but members should be responsive during discussions and should be able to attend monthly calls and participate in the Haskell.org Slack and mailing lists. Candidates for the committee should possess strong leadership, communication, and judgment skills. They must be able to set aside personal or business-related biases and make decisions with the good of the open-source Haskell community in mind. For more information about the committee’s roles and responsibilities, please visit Haskell.org Committee If you have any questions about the nomination process, please feel free to email us at [committee at haskell.org] or contact one of us individually.

1 0

Final Call for Papers: Tests and Proofs (TAP) -- Now a Track at FM 2026
by Achim D. Brucker 18 Nov '25

18 Nov '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: lost polymorphism in Typed Tagless Final Interpreters
by Olaf Klinke 12 Nov '25

12 Nov '25

> So change lit <$> safeRead n to (\x -> > lit x) <$> safeRead n, for example. Does anyone else find this highly non-obvious? SPJ gives an example https://github.com/ghc-proposals/ghc-proposals/pull/287#issuecomment-543683… of a context that can indeed distinguish, semantically, a function and its eta expansion. But the fact that, for the benefit of soundness, there must exist contexts where one can be a well-typed program while the other is not, is still mysterious to me. Can a type system with polymorphism really not do better than this? The discussion thread has some more interesting posts, e.g. https://github.com/ghc-proposals/ghc-proposals/pull/287#issuecomment-544377… https://github.com/ghc-proposals/ghc-proposals/pull/287#issuecomment-112046… At least, thanks to Jaro, the error index now explains when you should eta-expand. https://errors.haskell.org/messages/GHC-83865/ Olaf

2 1

lost polymorphism in Typed Tagless Final Interpreters
by Anthony Carrico 12 Nov '25

12 Nov '25

In his tutorial lecture "Typed Tagless Final Interpreters" https://www.okmij.org/ftp/tagless-final/course/lecture.pdf Oleg Kiselyov deals with the issue of losing polymorphism, tf1'_both :: IO() tf1'_both = case tf1' of Left e -> putStrLn ("Error: " ++ e) Right (x) -> do print (eval x) print (view x) "We have lost polymorphism. The problem is subtle: the function fromTree is indeed polymorphic over repr, as its inferred type shows. However, to extract the de-serialized term, we have to do pattern-matching; the variable x is bound in the case pattern and hence, like a lambda-pattern–bound variable, gets a monomorphic, non-generalizable type. Therefore, we cannot interpret x with several arbitrary interpreters; the extensibility is lost." He shows how to use a newtype wrapper to work around the issue, but also says in a foot note: "With the impredicative polymorphism GHC extension, we do not have to fake first-class polymorphism and do not need Wrapped." Two questions: 1. Is this true? I still get the error. 2. Can anyone summarize the current state of this issue today? It can be hard follow the issue through the history of Haskell/GHC. Thanks to Oleg for publishing this lecture, it is possible to learn quite a bit from it, and thanks to whoever would like to give an update! I've smashed together my source code from the F module and the Serialization module together below. You can see the "defered type error" at the very bottom. $ ghc --version The Glorious Glasgow Haskell Compilation System, version 9.8.4 {-# LANGUAGE NoMonomorphismRestriction #-} {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE ImpredicativeTypes #-} module F where class ExpSYM repr where lit :: Int -> repr neg :: repr -> repr add :: repr -> repr -> repr instance ExpSYM Int where lit n = n neg e = -e add e0 e1 = e0 + e1 eval :: Int -> Int eval = id instance ExpSYM String where lit n = show n neg e = "(-" ++ e ++ ")" add e0 e1 = "(" ++ e0 ++ " + " ++ e1 ++ ")" view :: String -> String view = id data Tree = Leaf String | Node String [Tree] deriving (Eq, Read, Show) instance ExpSYM Tree where lit n = Node "Lit" [Leaf (show n)] neg e = Node "Neg" [e] add e0 e1 = Node "Add" [e0, e1] toTree :: Tree -> Tree toTree = id type ErrMsg = String safeRead :: Read a => String -> Either ErrMsg a safeRead s = case reads s of [(x, "")] -> Right x _ -> Left $ "Read error: " ++ s fromTree :: (ExpSYM repr) => Tree -> Either ErrMsg repr fromTree (Node "Lit" [Leaf n]) = lit <$> (safeRead n) fromTree (Node "Neg" [e]) = neg <$> (fromTree e) fromTree (Node "Add" [e0, e1]) = add <$> (fromTree e0) <*> (fromTree e1) fromTree e = Left ("Invalid tree: " ++ show e) tf1 :: ExpSYM repr => repr tf1 = add (lit 8) (neg (add (lit 1) (lit 2))) tf1_tree :: Tree tf1_tree = toTree F.tf1 tf1' :: ExpSYM repr => Either ErrMsg repr tf1' = fromTree tf1_tree tf1'_eval :: IO() tf1'_eval = case tf1' of Left e -> putStrLn ("Error: " ++ e) Right x -> print (eval x) -- >>> tf1'_eval -- 5 tf1'_view :: IO() tf1'_view = case tf1' of Left e -> putStrLn ("Error: " ++ e) Right x -> print (view x) -- >>> tf1'_view -- "(8 + (-(1 + 2)))" tf1'_both :: IO() tf1'_both = case tf1' of Left e -> putStrLn ("Error: " ++ e) Right (x) -> do print (eval x) print (view x) -- >>> tf1'_both -- *** Exception: /tmp/danteIpH3fg.hs:90:19: error: [GHC-83865] -- • Couldn't match type ‘Int’ with ‘[Char]’ -- Expected: String -- Actual: Int -- • In the first argument of ‘view’, namely ‘x’ -- In the first argument of ‘print’, namely ‘(view x)’ -- In a stmt of a 'do' block: print (view x) -- (deferred type error) -- Anthony Carrico

2 2

GHC 9.12.3-rc2 is now available
by Zubin Duggal 12 Nov '25

12 Nov '25

The GHC developers are very pleased to announce the availability of the second 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 24 November 2025. The changes from the first release candidate are * Fix a regression resulting in a panic with empty cases (#26442, #25960). * Fix for a potential segfault in the bytecode interpreter (#23210). * Fix for a regression with tabs not being allowed in string gaps (#26415). * Fix for a crash with the non-moving GC (#26204). * A rework of how internal symbols used by the code-generator are handled to adapt to changes in the Apple toolchain, enabling this release to bootstrap on macOS 26 Tahoe (#26166). GHC development is sponsored by: * [Juspay](https://juspay.com/) * [QBayLogic](https://qbaylogic.com/) * [Channable](https://www.channable.com/) * [Haskell Foundation](https://haskell.foundation/) * [Serokell](https://serokell.io/) * [Well-Typed](https://well-typed.com/) * [Tweag](https://www.tweag.io/) * [Dotcom-Monitor](https://www.dotcom-monitor.com/) * [LoadView](https://www.loadview-testing.com/) * [Web Hosting Buddy](https://webhostingbuddy.com/) * [Find My Electric](https://www.findmyelectric.com/) * [Standard Chartered](https://www.sc.com) * [UpCloud](https://upcloud.com) We would like to that these sponsors 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-rc2 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new

2 4

[ANN] Copilot 4.6
by Ivan Perez 11 Nov '25

11 Nov '25

Hi café! We are really excited to announce Copilot 4.6 [1, 2]. Copilot is a stream-based EDSL in Haskell for writing and monitoring embedded systems, 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 (ROS 2), 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. This major release improves the Bluespec backend, producing more suitable Verilog code. Prior implementations required modifying the resulting Verilog to help connect it to external systems (e.g., sensors, actuators), while the new Bluespec backend produces code that can be used without modification. The new implementation is compatible with versions of GHC from 8.6 to 9.12. This release has been made possible thanks to Sukhman Kahlon (NASA), who carried out a thorough evaluation of our FPGA backend, and to Ryan Scott (Galois), who implemented the updated solution. This work has also greatly benefited from discussions with the Bluespec team on the code generated by Copilot and possible improvements. We are grateful to all of 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 Jan 7th, 2026. 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.6 [2] https://hackage.haskell.org/package/copilot [3] https://github.com/nasa/ogma [4] https://github.com/Copilot-Language/copilot

1 0

ICFP 2026: Call for Papers
by ICFP Publicity 11 Nov '25

11 Nov '25

ICFP 2026 Call for Papers Accepted papers to be invited for presentation at: *The 31st ACM SIGPLAN International Conference on Functional Programming*August 23-29, 2026 Indianapolis, Indiana, USA https://icfp26.sigplan.org ------------------------------ Submission Information - *Submission web site*: https://icfp26.hotcrp.com - *Submission Deadline*: 19 Feb 2026 (AoE) Double-blind review - Reviews: 20 Apr 2026 (AoE) - Author Response: 20 Apr 2026 - 23 Apr 2026 (AoE) - Notification of Conditional Acceptance: 14 May 2026 (AoE) - Revision: 3 Jun 2026 (AoE) - Final Notification: 10 Jun 2026 (AoE) - Camera Ready: 1 Jul 2026 (AoE) ------------------------------ PACMPL issue ICFP 2026 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): - Language Design: concurrency, parallelism, and distribution; modularity; components and composition; meta-programming; macros; pattern matching; type systems; type inference; dependent types; effect types; gradual types; refinement types; session types; interoperability; domain-specific languages; imperative programming; object-oriented programming; logic programming; probabilistic programming; reactive programming; generic programming; bidirectional programming; secure programming. - Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimisation; garbage collection and memory management; runtime systems; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources. - Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling; build systems; program synthesis. - Analysis and Transformation: control flow; data flow; abstract interpretation; partial evaluation; program calculation. - Foundations: formal semantics; lambda calculus; program equivalence; rewriting; type theory; logic; category theory; computational effects; continuations; control; state; names and binding; program verification. - Applications: symbolic computing; formal-methods tools; systems programming; distributed systems and web programming; hardware design; databases; scientific and numerical computing; graphical user interfaces; graphics and multimedia; GPU programming; scripting; system administration; security. - Education: teaching introductory programming; mathematical proof; algebra. Submissions will be evaluated according to their relevance, correctness, significance, originality, and clarity. Each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. PACMPL issue ICFP 2026 also welcomes submissions in two separate categories — Functional Pearls and Experience Reports — that must be marked as such when submitted and that *need not* report original research results. Detailed guidelines on both categories are given at the end of this call. In an effort to achieve a balanced, diverse program, each author may be listed as a (co)author on a maximum of four submissions. Authors who require financial support to attend the conference can apply for PAC funding (http://www.sigplan.org/PAC/) The General Chair and PC Chair may not submit papers. PC members (other than the PC Chair) may submit papers. Please contact the Program Chair if you have questions or are concerned about the appropriateness of a topic. Double-blind Submissions <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#double-bind-submissi…> ICFP 2026 will use a full double-blind reviewing process. 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 must fully anonymize any supplementary material (see below). Links to supplementary material on external websites are not permitted. - 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 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 ( https://popl24.sigplan.org/track/POPL-2024-popl-research-papers#FAQ-on-Doub…) 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. Preparation of submissions <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#preparation-of-submi…> The deadline for submissions is: *** Thursay, 19 Feb 2026 AoE *** ( https://www.timeanddate.com/time/zones/aoe) This deadline will be strictly enforced. - Formatting: Submissions must be in PDF format, printable in black and white on US Letter sized paper and interpretable by common PDF tools. All submissions must adhere to the “ACM Small” template that is available (in both LaTeX and Word formats) from https://www.acm.org/publications/authors/submissions. Please download the latest version of the ACM style from https://www.acm.org/publications/authors/submissions, since the citation format has recently been changed. See also PACMPL’s Information and Guidelines for Authors at https://pacmpl.acm.org/authors.cfm. There is a limit of *25 pages* for a full paper or Functional Pearl and *12 pages* for an Experience Report; in either case, the bibliography and an optional clearly marked appendix will not be counted against these limits. Submissions that exceed the page limits or, for other reasons, do not meet the requirements for formatting, will be desk rejected. - Submission: Submissions will be accepted at https://icfp26.hotcrp.com Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. - Author Response Period: Authors will have a 96-hour period, starting at 00:00 (midnight) AoE on Monday, 20 April, 2026, to read reviews and respond to them. - Appendix and Supplementary Material: Authors have the option to include a clearly marked appendix and/or to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at such an appendix or supplementary material. Supplementary material may be uploaded as a separate PDF document or tarball. Any supplementary material must be uploaded at submission time, not by providing a URL in the paper that points to an external repository. All supplementary material must be anonymised. - Authorship Policies: All submissions are expected to comply with the ACM Policies for Authorship that are detailed at https://www.acm.org/publications/authors/information-for-authors. - Republication Policies: Each submission must adhere to SIGPLAN’s republication policy, as explained on the web at http://www.sigplan.org/Resources/Policies/Republication. Review Process <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#review-process> This section outlines the two-stage process with double-blind reviewing that will be used to select papers for PACMPL issue ICFP 2026. Like last year, ICFP 2026 will adapt a full double-blind reviewing process. More information see below. ICFP 2026 will have two 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. ICFP 2026 will employ a two-stage review process. The first stage in the review process will assess submitted papers using the criteria stated above and will allow for feedback and input on initial reviews through the author response period mentioned previously. As a result of the review process, a set of papers will be conditionally accepted and all other papers will be rejected. Authors will be notified of these decisions on 14 May, 2026. Authors of conditionally accepted papers will be provided with committee reviews along with a set of optional or mandatory revisions. By 3 June, 2026, the authors should provide a revised submission. The second and final reviewing phase assesses whether the mandatory revisions have been adequately addressed by the authors and thereby determines the final accept/reject status of the paper. The intent and expectation is that the mandatory revisions can feasibly be addressed within a couple of weeks. The second submission should clearly identify how the mandatory revisions were addressed. To that end, the second submission *must be accompanied by a cover letter* mapping each mandatory revision request to specific parts of the paper. The cover letter will facilitate a quick second review, allowing for confirmation of final acceptance within two weeks. Conversely, the absence of a cover letter will be grounds for the paper’s rejection. Information for Authors of Accepted Papers <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#information-for-auth…> As a condition of acceptance, final versions of all papers must adhere to the ACM Small format. The page limit for the final versions of papers will be *increased by two pages* to help authors respond to reviewer comments and mandatory revisions: 27 pages plus bibliography for a regular paper or Functional Pearl, 14 pages plus bibliography for an Experience Report. Authors of accepted submissions will be required to agree to one of the three ACM licensing options, one of which is Creative Commons CC-BY publication; this is the option recommended by the PACMPL editorial board. A reasoned argument in favour of this option can be found in the article Why CC-BY? published by OASPA, the Open Access Scholarly Publishers Association. The other options are copyright transfer to ACM or retaining copyright but granting ACM exclusive publication rights. PACMPL is a Gold Open Access journal, and authors are encouraged to publish their work under a CC-BY license. Gold Open Access guarantees permanent free online access to the definitive version in the ACM Digital Library, and the recommended CC-BY option also allows anyone to copy and distribute the work with attribution. Gold Open Access has been made possible by generous funding through ACM SIGPLAN, which will cover all open access costs in the event authors cannot. Authors who can cover the costs may do so by paying an Article Processing Charge (APC). PACMPL, SIGPLAN, and ACM Headquarters are committed to exploring routes to making Gold Open Access publication both affordable and sustainable. ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of an ACM article should reduce user confusion over article versioning. After an article has been published and assigned to the appropriate ACM Author Profile pages, authors should visit http://www.acm.org/publications/acm-author-izer-service to learn how to create links for free downloads from the ACM DL. The official publication date is the date the journal is made available in the ACM Digital Library. The journal issue and associated papers will be published no earlier than 1 August, 2026. The official publication date affects the deadline for any patent filings related to published work. Authors of each accepted submission are invited to attend and be available for the presentation of that paper at the conference. The schedule for presentations will be determined and shared with authors after the full program has been selected. ORCID: ORCID provides a persistent digital identifier (an ORCID iD) that you own and control, and that distinguishes you from every other researcher: https://orcid.org/. ACM now require an ORCID iD for every author of a paper, not just the corresponding author. So, the author who is filling out the permission form should make sure they have the ORCID iDs for all of their coauthors before filling out the form. Any authors who do not yet have an ORCID iD can go to https://orcid.org/register to have one assigned. By submitting your article to an ACM Publication, you are hereby acknowledging that you and your co-authors are subject to all ACM Publications Policies, including ACM’s new Publications Policy on Research Involving Human Participants and Subjects. Alleged violations of this policy or any ACM Publications Policy will be investigated by ACM and may result in a full retraction of your paper, in addition to other potential penalties, as per ACM Publications Policy. Artifact Evaluation <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#artifact-evaluation> Authors of papers that are conditionally accepted in the first phase of the review process will be encouraged (but not required) to submit supporting materials for Artifact Evaluation. These items will then be reviewed by an Artifact Evaluation Committee, separate from the paper Review Committee, whose task is to assess how the artifacts support the work described in the associated paper. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers will be encouraged to make the supporting materials publicly available upon publication of the papers, for example, by including them as “source materials” in the ACM Digital Library. An additional seal will mark papers whose artifacts are made available, as outlined in the ACM guidelines for artifact badging. Participation in Artifact Evaluation is voluntary and *will not influence* the final decision regarding paper acceptance. Special categories of papers <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#special-categories-o…> In addition to research papers, PACMPL issue ICFP solicits two kinds of papers that do not require original research contributions: Functional Pearls, which are full papers, and Experience Reports, which are limited to half the length of a full paper. Authors submitting such papers should consider the following guidelines. Functional Pearls <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#functional-pearls> A Functional Pearl is an elegant essay about something related to functional programming. Examples include, but are not limited to: - a new and thought-provoking way of looking at an old idea; - an instructive example of program calculation or proof; - a nifty presentation of an old or new data structure; - an interesting application of functional programming techniques; - a novel use or exposition of functional programming in the classroom. While pearls often demonstrate an idea through the development of a short program, there is no requirement or expectation that they do so. Thus, they encompass the notions of theoretical and educational pearls. Functional Pearls are valued as highly and judged as rigorously as ordinary papers, but using somewhat different criteria. In particular, a pearl is not required to report original research, but, it should be concise, instructive, and entertaining. A pearl is likely to be rejected if its readers get bored, if the material gets too complicated, if too much-specialised knowledge is needed, or if the writing is inelegant. The key to writing a good pearl is polishing. A submission that is intended to be treated as a pearl must be marked as such on the submission web page and should contain the words “Functional Pearl” somewhere in its title or subtitle. These steps will alert reviewers to use the appropriate evaluation criteria. Pearls will be combined with ordinary papers for the purpose of computing the conference’s acceptance rate. Experience Reports <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#experience-reports> The purpose of an Experience Report is to describe the experience of using functional programming in practice, whether in industrial application, tool development, programming education, or any other area. Possible topics for an Experience Report include, but are not limited to: - insights gained from real-world projects using functional programming; - comparison of functional programming with conventional programming in the context of an industrial project or a university curriculum project-management, business, or legal issues encountered when using functional programming in a real-world project; - curricular issues encountered when using functional programming in education; - real-world constraints that created special challenges for an implementation of a functional language or for functional programming in general. An Experience Report is distinguished from a normal PACMPL issue ICFP paper by its title, by its length, and by the criteria used to evaluate it. Both in the papers and in any citations, the title of each accepted Experience Report must end with the words “(Experience Report)” in parentheses. The acceptance rate for Experience Reports will be computed and reported separately from the rate for ordinary papers. Experience Report submissions can be at most 12 pages long, excluding bibliography. Each accepted Experience Report will be presented at the conference, but depending on the number of Experience Reports and regular papers accepted, authors of Experience Reports may be asked to give shorter talks. Because the purpose of Experience Reports is to enable our community to understand the application of functional programming, an acceptable Experience Report need not add to the body of knowledge of the functional-programming community by presenting novel results or conclusions. It is sufficient if the report describes an illuminating experience with functional programming, or provides evidence for a clear thesis about the use of functional programming. The experience or thesis must be relevant to ICFP, but it need not be novel. The review committee will accept or reject Experience Reports based on whether they judge the paper to illuminate some aspect of the use of functional programming. Anecdotal evidence will be acceptable provided it is well-argued and the author explains what efforts were made to gather as much evidence as possible. Typically, papers that show how functional programming was used are more convincing than papers that say only that functional programming was used. It can be especially effective to present comparisons of the situations before and after the experience described in the paper, but other kinds of evidence would also make sense, depending on context. Experience drawn from a single person’s experience may be sufficient, but more weight will be given to evidence drawn from the experience of groups of people. An Experience Report should be short and to the point. For an industrial project, it should make a claim about how well functional programming worked and why; for a pedagogy paper, it might make a claim about the suitability of a particular teaching style or educational exercise. Either way, it should produce evidence to substantiate the claim. If functional programming worked in this case in the same ways it has worked for others, the paper need only summarise the results — the main part of the paper should discuss how well it worked and in what context. Most readers will not want to know all the details of the experience and its implementation, but the paper should characterise it and its context well enough so that readers can judge to what degree this experience is relevant to their own circumstances. The paper should take care to highlight any unusual aspects; specifics about the experience are more valuable than generalities about functional programming. If the paper not only describes experience but also presents new technical results, or if the experience refutes cherished beliefs of the functional-programming community, it may be better to submit it as a full paper, which will be judged by the usual criteria of novelty, originality, and relevance. The Program Chair will be happy to advise on any concerns about which category to submit to. About PACMPL <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#about-pacmpl> Proceedings of the ACM on Programming Languages (PACMPL https://pacmpl.acm.org/) is a Gold Open Access journal publishing research on all aspects of programming languages, from design to implementation and from mathematical formalisms to empirical studies. Each issue of the journal is devoted to a particular subject area within programming languages and will be announced through publicised Calls for Papers, like this one. Important update on ACM’s new open access publishing model for 2026 ACM Conferences: <https://icfp26.sigplan.org/track/icfp-2026-icfp-papers#important-update-on-…> 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 geographic or discretionary waiver. To find out whether an APC applies to your article, please consult the list of participating institutions <https://libraries.acm.org/acmopen/open-participants> in ACM Open and review the APC Waivers and Discounts Policy <https://www.acm.org/publications/policies/policy-on-open-access-apc-waivers…> . To support a smooth transition and encourage broader ACM Open participation, ACM has introduced a temporary subsidy on APC pricing for 2026, funded directly by ACM. This pricing applies to all articles published in ACM and SIG sponsored conferences taking place in 2026. The subsidized conference pricing for 2026 is as follows: Authors No ACM or SIG members At least 1 ACM or SIG member ACM and SIG Sponsored Conference Article $350 $250 From a lower-middle-income country <https://www.acm.org/publications/policies/lower-middle-income-countries> $175 $125 This represents a 65% discount <https://www.acm.org/publications/openaccess>, funded directly by ACM. Authors are encouraged to help advocate for their institutions to join ACM Open during this transition period.

1 0

JFP Special Issue on Program Calculation
by Graham Hutton (staff) 11 Nov '25

11 Nov '25

Dear all, We're delighted to announce that the JFP Special Issue on Program Calculation is now complete, and contains eleven papers that are freely available to read online from the link below. Best wishes, Graham Hutton and Nicolas Wu Special-Issue Editors ==================================================================== JFP Special Issue on Program Calculation https://tinyurl.com/JFP-prog-calc The idea of program calculation, in which programs are derived from specifications using equational reasoning, has been a central theme in functional programming since its inception. In particular, the approach allows us to systematically discover how programs can be defined, while at the same time obtaining proofs that they are correct. This special issue showcases recent advances in the field of program calculation. We are pleased to present eleven papers covering a diverse range of topics, including algorithm design, computational effects, graphical methods, relational reasoning, compiler calculation, and co-induction. These contributions reflect the depth and breadth of contemporary research in the field. We dedicate the special issue to the memory of Richard Bird, the ultimate program calculator. His commitment to clarity, simplicity and elegance set a standard that continues to inspire all who had the pleasure of reading his papers and hearing his talks. ==================================================================== This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.

1 0

On Streamlining Compliance of Haskell projects with NASA requirements
by Ivan Perez 10 Nov '25

10 Nov '25

Hi, In case it's of interest to anyone here, I'm writing to share "Towards Streamlining Auditing for Compliance with Requirements in Open-source Software at NASA", a paper we presented at the AIAA/IEEE Conference on Digital Avionics Systems (DASC) last September. The paper can be accessed here: https://ntrs.nasa.gov/citations/20250006564 The paper talks about how we are leveraging automated tools to comply with NASA Software Engineering requirements in the Copilot project. The process we follow with Copilot is the same for the Ogma project, so the tools are usable there too. Some of the details discussed (e.g., traceability from issues to code, steps towards issue assignment, review and closure) are public on our Github pages (https://github.com/Copilot-Language/copilot, https://github.com/nasa/ogma) Both Copilot and Ogma are written in Haskell, and I've been posting progress updates on both regularly The gist of the paper is that we can put together git + github data to check if we are doing things minimally right. We can't check for all software engineering requirements, but we can perform many useful checks automatically. While this is a bit tangential, I hope this gives you an idea of how rigorous we have to be when developing Copilot and Ogma and the process we need to make sure these Haskell projects can be used in flight. If you have any comments, feel free to write to me directly at contact(a)ivanperez.io or via the discussions in the Copilot repo: https://github.com/Copilot-Language/copilot/discussions . Happy Haskelling! Ivan

1 0

Cognitive dissonance in the Haskell Report
by Douglas McIlroy 08 Nov '25

08 Nov '25

Section 2.4 of the Haskell report defines "identifier" as a lexeme that begins with a letter. A few paragraphs on it says An operator symbol starting with any other character [than :] is an ordinary identifier. In everyday usage, ordinary people are necessarily people, yet this kind of ordinary identifier falls outside the definition of identifier. Section 3.2 says An operator is either an operator symbol, such as + or $$, or is an ordinary identifier enclosed in grave accents. If "either" is taken in the exclusive sense, this implies that operator symbols are *not* ordinary identifiers, in contradiction to Section 2.4. But if either is taken inclusively, then the lexeme +, an ordinary identifier per Section 2.4, can optionally be enclosed in grave accents. The terminology needs some cleaning. Doug McIlroy

7 7

GHC Steering Committee Call for Nominations
by Simon Marlow 07 Nov '25

07 Nov '25

Dear Haskellers, The GHC Steering Committee is seeking nominations for new members. *To nominate yourself *please send an email to Simon Marlow <marlowsd(a)gmail.com> <marlowsd(a)gmail.com>, briefly summarising your background and relevant experience. See below for details on what committee membership involves, and what kind of experience would be useful. DEADLINE: 6 November 2025 *What's the GHC steering committee?* The committee scrutinizes, debates and eventually decides to accept or reject proposals to change the language or major features supported by GHC. Our processes are described in the GitHub repository <https://github.com/ghc-proposals/ghc-proposals> where proposals are submitted. In particular, please have a look at the Committee bylaws <https://github.com/ghc-proposals/ghc-proposals/blob/master/committee.rst>. *Who are we looking for?* We are looking for members who have the ability to: - understand GHC proposals (e.g. for new language extensions), - find holes and missing corner cases in the specifications, - foresee the interaction with other language or compiler features, - comment constructively and improve proposals through engagement with others, - judge the cost/benefit ratio of changes, and - come to a justifiable conclusion. Ideally, committee members should: - have substantial experience of writing or teaching Haskell; - have a track record of active contributions to the Haskell community; or - have expertise in language design and implementation, in either Haskell or related languages. It is our aim that this committee be diverse; by representing different viewpoints, we will make decisions that benefit larger segments of our community. Even if you are uncertain whether your background qualifies you for the role, you are warmly encouraged to apply. The committee's work requires a small, but non-trivial amount of time, especially when you are assigned a proposal for shepherding. We estimate the workload to be around 2 hours per week, and our process works best if members usually respond to technical emails within 1-2 weeks (within days is even better). Please keep that in mind if your email inbox is already overflowing. Committee members serve for 3 years, but are free to re-nominate themselves when their 3-year term expires. Self-nominations are the norm. You can nominate someone else, but please obtain their explicit consent to do so. (We don't want to choose someone who turns out to be unable to serve.) *What happens after nominations?* In accordance with our Committee bylaws <https://github.com/ghc-proposals/ghc-proposals/blob/master/committee.rst>, the committee deliberates nominations *in private* before communicating the decision. The committee doesn't have a fixed size, although we like to have a minimum of 9 members. There are currently two members rotating off, but as the committee currently has 10 members, we will be looking to appoint at least one but possibly (hopefully!) more. On behalf of the committee, Simon Marlow

1 1

GHC 9.14.1-rc2 is now available
by Zubin Duggal 07 Nov '25

07 Nov '25

The GHC developers are very pleased to announce the availability of the second release candidate of GHC 9.14.1. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][]. The changes from the first release candidate are: * Bump the exceptions submodule to 0.10.11 * Bump the os-string submodule to 2.0.8 * Fix a driver regression causing an infinite loop with cyclic imports GHC 9.14 will bring a number of new features and improvements, including: * Significant improvements in specialisation: * The `SPECIALISE` pragma now allows use of type application syntax * The `SPECIALISE` pragma can be used to specialise for expression arguments as well as type arguments. * Specialisation is now considerably more reliable in the presence of `newtype`s * Significant GHCi improvements including: * Correctness and performance improvements in the bytecode interpreter * Features in the GHCi debugger * Support for multiple home units in GHCi * Implementation of the [Explicit Level Imports proposal][levels] * `RequiredTypeArguments` can now be used in more contexts * SSE/AVX2 support in the x86 native code generator backend * A major update of the Windows toolchain and improved compatibility with macOS Tahoe * ... and many more A full accounting of changes can be found in the [release notes][]. Given the many specialisation improvements and their potential for regression, we would very much appreciate testing and performance characterisation on downstream workloads. Note that while this release makes many improvements in the specialisation optimisation, polymorphic specialisation will remain disabled by default in the final release due to concern over regressions of the sort identified in [#26329][T26329]. Users needing more aggressive specialisation can explicitly enable this feature with the `-fpolymorphic-specialisation` flag. Depending upon our experience with 9.14.1, we may enable this feature by default in a later minor release. We would like to thank the Zw3rk stake pool, Well-Typed, Mercury, Channable, Tweag I/O, 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 have made the Haskell ecosystem what it is today. As always, do give this release a try and open a [ticket][] if you see anything amiss. [downloads.haskell.org] https://downloads.haskell.org/ghc/9.14.1-rc2 [release notes]: https://downloads.haskell.org/ghc/9.14.1-rc2/docs/users_guide/9.14.1-notes.… [ticket]: https://gitlab.haskell.org/ghc/homepage/-/issues/new [macos]: https://gitlab.haskell.org/ghc/ghc/-/issues/26166 [T26329]: https://gitlab.haskell.org/ghc/ghc/-/issues/26329 [levels]: https://github.com/ghc-proposals/ghc-proposals/blob/master/proposals/0682-e…

4 6

Journal of Functional Programming - Call for PhD Abstracts
by Graham Hutton (staff) 06 Nov '25

06 Nov '25

Dear all, If you or one of your students recently completed a PhD (or Habilitation) in the area of functional programming, please submit the dissertation abstract for publication in JFP: simple process, no refereeing, open access, 200+ published to date, deadline 30th November 2025. Please share! Best wishes, Graham Hutton ============================================================ CALL FOR PHD ABSTRACTS Journal of Functional Programming Deadline: 30th November 2025 http://tinyurl.com/jfp-phd-abstracts ============================================================ PREAMBLE: Many students complete PhDs in functional programming each year. As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. The abstracts are made freely available on the JFP website, i.e. not behind any paywall. They do not require any transfer of copyright, merely a license from the author. A dissertation is eligible for inclusion if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. The abstracts are not reviewed. Please submit dissertation abstracts according to the instructions below. We welcome submissions from both the student and the advisor/supervisor although we encourage them to coordinate. Habilitation dissertations are also eligible for inclusion. ============================================================ SUBMISSION: Please submit the following information to Graham Hutton <graham.hutton(a)nottingham.ac.uk> by 30th November 2025 o Dissertation title: (including any subtitle) o Student: (full name) o Awarding institution: (full name and country) o Date of award: (month and year; depending on the institution, this may be the date of the viva, corrections being approved, graduation ceremony, or otherwise) o Advisor/supervisor: (full names) o Dissertation URL: (please provide a permanently accessible link to the dissertation if you have one, such as to an institutional repository or other public archive; links to personal web pages should be considered a last resort) o Dissertation abstract: (plain text, maximum 350 words; you may use \emph{...} for emphasis, but we prefer no other markup or formatting; if your original abstract exceeds the word limit, please submit an abridged version within the limit) Please do not submit a copy of the dissertation itself, as this is not required. JFP reserves the right to decline to publish abstracts that are not deemed appropriate. ============================================================ PHD ABSTRACT EDITOR: Graham Hutton School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom ============================================================ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.

1 0

Saving Haskellwiki page fails
by X Y 06 Nov '25

06 Nov '25

L.S., When I try to save an edited Haskellwiki page, I get the message: Database error A database query error has occurred. This may indicate a bug in the software. [332be860fb9a0d590251f128] 2025-11-04 03:35:42: Fatal exception of type "Wikimedia\Rdbms\DBQueryError" Can someone solve this? Regards, Henk-Jan van Tuyl

2 1

Full Professor position in Programming Languages at the University of Tartu
by Danel Ahman 05 Nov '25

05 Nov '25

Dear all, The Institute of Computer Science at the University of Tartu in Estonia is currently advertising a Full Professor position in Programming Languages: https://ut.ee/en/job-offer/professor-programming-languages-0 Areas of particular interest include semantics and types, compilers and runtimes, static/dynamic analysis, verification, synthesis, and language-based security. The application deadline is 15.12.2025. Best wishes, Danel Ahman

1 0

[ANN] Ogma 1.10.0
by Ivan Perez 04 Nov '25

04 Nov '25

Hi everyone! I'm thrilled to announce the release of Ogma 1.10.0! NASA's Ogma is a mission assurance tool that generates robotics and flight applications. Use cases supported by Ogma include producing Robot Operating System (ROS 2) packages [3], NASA Core Flight System (cFS) applications [4], and components for FPrime [1] (the software framework used for the Mars Helicopter). Ogma is also one of the solutions recommended for monitoring in Space ROS applications [2]. Ogma is fully written in Haskell, and leverages existing Haskell work, like the Copilot language [5] (also funded by NASA) and BNFC [6]. For more details, including videos of monitors being generated and flown in simulators, see: https://github.com/nasa/ogma * What's changed This major release includes the following improvements: - Ogma is now released under Apache license. - Fix several small errors in cFS template. - Fix bug in ROS 2 template generation when handlers have no arguments. - Install ROS 2 package locally in generated Dockerfile. - Add examples demonstrating ROS 2, cFS. - Add CI action for cFS test. - Fix several other smaller maintenance issues. For details about the release, see: https://github.com/nasa/ogma/releases/tag/v1.10.0 * Releases Ogma is released as a collection of packages in Hackage. The entry point is https://hackage.haskell.org/package/ogma-cli. It is also available in new releases of Ubuntu and Debian (testing), from the official package repositories of those distros; thanks to Scott Talbert and the rest of the Debian Haskell Group. * Code The github repo is located at: https://github.com/nasa/ogma. * What's coming The next release is planned for Nov 21st, 2025. We are currently working on a GUI for Ogma that facilitates collecting all mission data relative to the design, diagrams, requirements and deployments, and help users refine designs and requirements, verify them for correctness, generate monitors and full applications, follow live missions, and produce reports. We also want to remind users that both Ogma and Copilot can now accept contributions from external users, and we are also keen to see students use them for their school projects, their final projects and theses, and other research. If you are interested in collaborating, please reach out to ivan.perezdominguez(a)nasa.gov. We hope that you are as excited as we are and that our work demonstrates that, with the right support, Haskell can reach farther than we ever thought possible. Happy Haskelling! Ivan [1] https://github.com/nasa/fprime [2] https://space.ros.org/ [3] https://www.ros.org/ [4] https://github.com/nasa/cFS [5] https://github.com/Copilot-Language/copilot [6] https://github.com/BNFC/bnfc

1 0

Jeremy Avigad to give this year's LMS/BCS-FACS Evening Seminar -- 6 November 2025, online via Zoom
by Andrei Popescu 03 Nov '25

03 Nov '25

Dear Colleagues, I am delighted to announce that this year’s London Mathematical Society (LMS) / British Computer Society -- Formal Aspects of Computing Science (BCS-FACS) Evening Seminar will feature Jeremy Avigad as the distinguished speaker. Registration is free but required in advance. Date: 6 November 2025 Time: 19:00 (UK time) Format: Online via Zoom Talk title: Mathematics in the Age of AI Jeremy’s website: https://lnkd.in/ep3w-fiB Registration (for access to the Zoom link) is available here: https://lnkd.in/eRE-Bb2A Further details about the talk are included below Best wishes, Andrei Speaker: Jeremy Avigad (Carnegie Mellon University) Title: Mathematics in the Age of AI Abstract: New technologies for reasoning and discovery are bound to have a profound effect on mathematical practice. Proof assistants are already changing the nature of collaboration, communication, and curation of mathematical knowledge. Automated reasoning tools are used to find mathematical objects with specified properties or rule out their existence, and to decide or verify mathematical claims. Machine learning and neural methods can discover patterns in mathematical data, explore complex mathematical spaces, and generate mathematical objects of interest. Neurosymbolic theorem provers, now capable of solving the most challenging competition problems, combine aspects of all of these technologies. It is helpful to keep in mind that the phrase "AI for mathematics" encompasses several distinct technologies that overlap and interact in interesting ways. In this talk, I will survey the landscape, describe a few landmark applications to mathematics, and encourage you to join me in thinking about how mathematicians and computer scientists can collaborate to guide mathematics through this era of technological change. Bio: Jeremy Avigad is a professor in the Department of Philosophy and the Department of Mathematical Sciences at Carnegie Mellon University. He is the director of the Institute for Computer-Aided Reasoning in Mathematics, a new NSF Mathematical Sciences Research Institute, and the director of the Hoskinson Center for Formal Mathematics, a research center at Carnegie Mellon. He has contributed to mathematical logic and the history and philosophy of mathematics, and he is currently working on applications of formal methods and AI to mathematics. He serves on the Lean Community Admin Team and the board of the Lean Focused Research Organization.

1 3

POPL 2026 Call for Participation - Early registration: 12 December
by Ningning Xie 31 Oct '25

31 Oct '25

======================================= Call for Participation ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2026) January 11-17, 2026, Rennes, France. https://popl26.sigplan.org/ ======================================= - Early registration deadline: ** 12 December 2025 ** - Register here: https://popl26.sigplan.org/attending/registration ======================================= The 53rd ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2026) is a forum for the discussion of all aspects of programming languages and programming systems. Location: le Couvent des Jacobins, 20 place Saint-Anne, 35000 Rennes, France Dates: - Main conference: Wed 14 - Fri 16 January - Workshops, tutorials, co-located events: Sun 11, Mon 12, Tue 13 and Sat 17 January Full details of the conference and co-located events: https: // popl26.sigplan.org/

1 0

2nd Call for Contributions: BOB 2026 (Berlin, March 13 - Deadline Nov 17)
by Michael Sperber 31 Oct '25

31 Oct '25

Haskell is always big at BOB - send us your best! ================================================================================ BOB Conference 2026 "What happens when we use what's best for a change?" https://bobkonf.de/2026/cfc.html Berlin, Mar 13 Call for Contributions Deadline: November 17, 2025 ================================================================================ You are actively engaged in advanced software engineering methods, solve ambitious problem with software and are open to cutting-edge innovation? Attend this conference, meet people that share your goals, and get to know the best software tools and technologies available today. We strive to offer a day full of new experiences and impressions that you can use to immediately improve your daily life as a software developer. If you share our vision and want to contribute, submit a proposal for a talk or tutorial! NOTE: The conference fee will be waived for presenters. Travel expenses will not be covered (for exceptions see "Speaker Grants"). Shepherding ----------- The program committee offers shepherding to all speakers. Shepherding provides speakers assistance with preparing their sessions. Specifically: - advice on structure and presentation - review of talk slides Speaker Grants -------------- BOB has Speaker Grants available to support speakers from groups under-represented in technology. We specifically seek women speakers, speakers of color, and speakers who are not able to attend the conference for financial reasons. Topics ------ We are looking for talks about best-of-breed software technology, e.g.: - functional programming - persistent data structures and databases - event-based modelling and architecture - "fancy types" (dependent types, gradual typing, linear types, ...) - formal methods for correctness and robustness - abstractions for concurrency and parallelism - metaprogramming - probabilistic programming - math and programming - controlled side effects - program synthesis - Ai beyond vibecoding and chatbots - linked data - symbolic AI - next-generation IDEs - effective abstractions for data analytics - ... everything really that isn’t mainstream, but you think should be - ... including rough ideas that are worth discussing. Presenters should provide the audience with information that is practically useful for software developers. Challenges ---------- Furthermore, we seek contributions on successful approaches for solving hard problems, for example: - bias in machine-learning systems - digital transformation in difficult settings - accessibiltity - systems with critical reliability requirements - ecologically sustainable software development We're especially interested in experience reports. Other topics are also relevant, e.g.: - introductory talks on technical background - overviews of a given field - demos and how-tos Requirements ------------ We accept proposals for presentations of 45 minutes (40 minutes talk + 5 minutes questions), as well as 90 minute tutorials for beginners. The language of presentation should be either English or German. Your proposal should include (in your presentation language of choice): - An abstract of max. 1500 characters. - A short bio/cv - Contact information (including at least email address) - A list of 3-5 concrete ideas of how your work can be applied in a developer's daily life - additional material (websites, blogs, slides, videos of past presentations, …) Organisation ------------ - Direct questions to konferenz at bobkonf dot de - Proposal deadline: November 17, 2025 - Notification: December 5, 2025 - Program: December 12, 2025 Submit here: https://pretalx.com/bob-2026/submit/ Program Committee ----------------- (more information here: https://bobkonf.de/2026/programmkomitee.html) - Matthias Fischmann, Wire - Matthias Neubauer, SICK AG - Nicole Rauch, Softwareentwicklung und Entwicklungscoaching - Michael Sperber, Active Group - Stefan Wehr, Hochschule Offenburg Scientific Advisory Board - Annette Bieniusa, TU Kaiserslautern - Torsten Grust, Uni Tübingen - Peter Thiemann, Uni Freiburg

1 0

[TFP 2026] 2nd Call for Papers for the 27th International Symposium on Trends in Functional Programming, Odense, Denmark, January 27-30 2026
by Peter Achten 30 Oct '25

30 Oct '25

# TFP 2026 - Second 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 Symposium: Tue 27th Jan - Thu 30th Jan 2026 (TFPiE 26th Jan 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, 5th March. ## 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. ## Student and Early Career Scholarships Our sponsors have generously offered to fund seven scholarships of DKK 3000 (approximately USD 460) to cover expenses in connection with traveling to and staying in Denmark in connection with the conference. Information on how to apply for these scholarships will be available soon on https://trendsfp.github.io/ ## 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). ## 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. ## Format Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS Guidelines web site (https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…) ## Organizing Committee Casper Bach University of Southern Denmark, DK Programme Chair Jeremy Gibbons University of Oxford, UK General Chair Jason Hemann Seton Hall University, US Conference 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 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 Eric Van Wyk University of Minnesota, US Jeremy Yallop University of Cambridge, UK Jules Jacobs Cornell University, US Mart Lubbers Radboud University, NL Max S. New University of Michigan, US Nicolas Wu Imperial College London, UK Patrick Bahr IT University of Copenhagen, DK Matthew Lutze Aarhus University, DK Dylan McDermott University of Oxford, UK Andrew Tolmach Portland State University, US Di Wang Peking University, CN Jesper Cockx Delft University of Technology, NL Jan de Muijnck-Hughes Strathclyde, UK

1 0

Fwd: [TYPES/announce] PLMW@POPL 26 Call for scholarship applications
by Haniel Barbosa 29 Oct '25

29 Oct '25

Fcc: /home/hbarbosa/Mail/ufmg/Sent/cur/1761756249.051868f6e32d5522.eru:2,S Date: Wed, 29 Oct 2025 12:40:49 -0400 References: <4b4fe1d8-dccf-4ddc-9aca-a3c136732286(a)di.ku.dk> <87cy7pmbfp.fsf(a)dcc.ufmg.br> <GVYP280MB1497071010E4C6D0A56BED70DA11A(a)GVYP280MB1497.SWEP280.PROD.OUTLOOK.COM> <GVYP280MB14974DB42BBA384BCE1B9E9FDA11A(a)GVYP280MB1497.SWEP280.PROD.OUTLOOK.COM> <87wm4g4av6.fsf(a)dcc.ufmg.br> <87frb2iqrh.fsf(a)dcc.ufmg.br> <CAFUr5pEvrMNGOn3YoohG0=8bXdqZCqnKOtmrMF1SJ5CCVh762w(a)mail.gmail.com> User-Agent: mu4e 1.12.1; emacs 30.2 https://urldefense.com/v3/__https://popl26.sigplan.org/home/PLMW-POPL-2026_… https://urldefense.com/v3/__https://docs.google.com/forms/d/e/1FAIpQLSfv8Hu… Organisers: https://hanielbarbosa.com/ FYI Além de uma ótima oportunidade, casaria bem com facilitar financiamento pra CPP/VMCAI de acordo com as submissões de pessoas. Abraço, ------------------- Start of forwarded message -------------------- [ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] CALL FOR SCHOLARSHIP APPLICATIONS PLMW @ POPL 26 (Deadline: November 10) ACM SIGPLAN Programming Languages Mentoring Workshop, Rennes, France Tuesday, January 13, 2016, Co-located with POPL 2026 Following the success of the first thirteen Programming Languages Mentoring Workshops at POPL 2012-2025, we are pleased to announce the 14th SIGPLAN Programming Languages Mentoring Workshop (PLMW), co-located with POPL 2026. The workshop will take place in person in Rennes, France. PLMW aims to encourage graduate students and senior undergraduate students to pursue careers in programming language (PL) research. This workshop will bring together world leaders in PL research and teaching from both academia and industry to provide (a) technical sessions on cutting-edge PL research and (b) mentoring sessions on how to prepare for a research career. The workshop will help students imagine how they might contribute to our vibrant and thriving research community. We especially encourage women, members of underrepresented minorities, and people with disabilities to attend PLMW. This workshop is part of the activities surrounding POPL, the Symposium on Principles of Programming Languages, and takes place the day before the main conference. One goal of the workshop is to make the POPL conference more accessible to newcomers. We hope that participants will stay for the whole conference. Our sponsors have generously donated scholarship funds for qualified students who do not have the funds to attend PLMW. These scholarships can cover expenses (airfare, hotel, and registration fees) for attendance at both the workshop and the POPL conference itself. Note that you do not need to apply here if you just want to attend PLMW: Attendance is open to everybody who is registered to workshops for the day. We strongly recommend to also apply for student volunteering at POPL if possible. Application deadline: November 10 2025 AoE Scholarship Application Form: Yannick Forster <yannick.forster(a)inria.fr> Andrew Hirsch <akhirsch(a)buffalo.edu> Jenna DiVincenzo <jennad(a)purdue.edu> -------------------- End of forwarded message -------------------- -- Haniel Barbosa

1 0

PLMW@POPL 26 Call for scholarship applications
by Ningning Xie 29 Oct '25

29 Oct '25

CALL FOR SCHOLARSHIP APPLICATIONS PLMW @ POPL 26 (Deadline: November 10) ACM SIGPLAN Programming Languages Mentoring Workshop, Rennes, France Tuesday, January 13, 2016, Co-located with POPL 2026 https://popl26.sigplan.org/home/PLMW-POPL-2026 Following the success of the first thirteen Programming Languages Mentoring Workshops at POPL 2012-2025, we are pleased to announce the 14th SIGPLAN Programming Languages Mentoring Workshop (PLMW), co-located with POPL 2026. The workshop will take place in person in Rennes, France. PLMW aims to encourage graduate students and senior undergraduate students to pursue careers in programming language (PL) research. This workshop will bring together world leaders in PL research and teaching from both academia and industry to provide (a) technical sessions on cutting-edge PL research and (b) mentoring sessions on how to prepare for a research career. The workshop will help students imagine how they might contribute to our vibrant and thriving research community. We especially encourage women, members of underrepresented minorities, and people with disabilities to attend PLMW. This workshop is part of the activities surrounding POPL, the Symposium on Principles of Programming Languages, and takes place the day before the main conference. One goal of the workshop is to make the POPL conference more accessible to newcomers. We hope that participants will stay for the whole conference. Our sponsors have generously donated scholarship funds for qualified students who do not have the funds to attend PLMW. These scholarships can cover expenses (airfare, hotel, and registration fees) for attendance at both the workshop and the POPL conference itself. Note that you do not need to apply here if you just want to attend PLMW: Attendance is open to everybody who is registered to workshops for the day. We strongly recommend to also apply for student volunteering at POPL if possible. Application deadline: November 10 2025 AoE Scholarship Application Form: https://docs.google.com/forms/d/e/1FAIpQLSfv8HuJpgsjso6_D_CZtp5AD17HPu2JTLW… Organisers: Yannick Forster <yannick.forster(a)inria.fr> Andrew Hirsch <akhirsch(a)buffalo.edu> Jenna DiVincenzo <jennad(a)purdue.edu>

1 0

[ANNOUNCE] Ajla 0.3.0 with formal verification using Z3
by Mikulas Patocka 28 Oct '25

28 Oct '25

Hi I announce a new release of a purely functional programming language Ajla 0.3.0 - https://www.ajla-lang.cz/ It has a new feature - the capability to formally verify programs using the Z3 library - see https://www.ajla-lang.cz/tutorial.html#verifying_ajla_programs_with_z3 Mikulas

1 0

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