- Haskell-Cafe - Haskell.org

CLC Elections January 2025
by Andrew Lelechenko 26 Jan '25

26 Jan '25

Core Libraries Committee seeks nominations for three expiring seats (including my own). <https://discourse.haskell.org/t/clc-elections-january-2025/11126#what-is-cl…>What is CLC? CLC is a volunteer body, primarily tasked with management of 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-file>. <https://discourse.haskell.org/t/clc-elections-january-2025/11126#who-should…>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. <https://discourse.haskell.org/t/clc-elections-january-2025/11126#how-can-i-…>How can I apply? To apply for one of these positions, send an email to clc.nominations.2025(a)gmail.com <mailto:clc.nominations.2025@gmail.com> that consists of the following data: The subject “CLC Election September 2025 - {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. Best regards, Andrew

1 1

Course-of-value recursion by defining a sequence as a self-referential infinite list
by Vanessa McHale 19 Jan '25

19 Jan '25

Laziness turns out to allow course-of-value recursion where one might use memoization in other languages. But I hadn’t seen this articulated! Famously, one can use this to define the Fibonacci numbers, viz. fibs :: [Integer] fibs = 1 : 1: zipWith (+) fibs (tail fibs) Or the Catalan numbers: catalan :: [Integer] catalan = 1 : 1 : [ sum [ (-1)^(k+1) * (pc (n - ((k*(3*k-1)) /. 2)) + pc (n - ((k*(3*k+1))/.2))) | k <- [1..n] ] | n <- [2..] ] where pc m | m >= 0 = part !! m | otherwise = 0 infixl 6 /. (/.) = quot I wrote up the example: http://vmchale.com/static/serve/Comb.pdf Reinhard Zumkeller has a lot of examples on OEIS: https://oeis.org/A000081 Cheers, Vanessa McHale

3 3

Call for Nominations: Haskell.org Committee (2025-2028)
by Rebecca Skinner 18 Jan '25

18 Jan '25

Dear Haskellers, We are pleased to announce that nominations are now open for the Haskell.org <http://haskell.org/> committee. You can nominate yourself or a friend for a three-year term (2025-2028) by sending an email to [committee at haskell.org <http://haskell.org/>] by January 31, 2025. 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 <http://haskell.org/> infrastructure, planning for the long term, and being fiscally responsible with Haskell.org <http://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 <http://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 https://www.haskell.org/haskell-org-committee/. If you have any questions about the nomination process, please feel free to email us at [committee at haskell.org <http://haskell.org/>], or contact one of us individually.

1 0

2nd Call for Participation: BOB 2025 (Berlin, Mar 14)
by Stefan Wehr 17 Jan '25

17 Jan '25

The early-bird deadline is Jan 17 (TODAY)! ========================================================================= BOB 2025 Conference “What happens if we simply use what’s best?” March 14, 2025, Berlin https://bobkonf.de/2025/ Program: https://bobkonf.de/2025/program.html Registration: https://bobkonf.de/2025/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/2025/program.html Talk subjects includes functional programming, property-based testing, language server implementation, domain-specific languages, domain-driven design, local-first software, formal methods, and microservices. BOB tutorial include sessions on frontend development, local-first programming, data science, Elixir, and software documentation, combining mob programming, TDD, and AI. Annette Bieniusa will give the keynote talk. Registration is open - many discount options are available, as are grants for members of groups underrepresented in tech. Early-bird discounts apply until Jan 17. https://bobkonf.de/2025/registration.html

1 0

PhD Scholarships in Quantum Computing
by Venanzio Capretta 13 Jan '25

13 Jan '25

PhD Scholarships School of Computer Science University of Nottingham The School of Computer Science at the University of Nottingham is advertising 10 fully-founded PhD studentships starting on 1 October 2025: https://jobs.nottingham.ac.uk/vacancy.aspx?ref=SCI298 We are calling for good candidates to apply for a PhD project in Quantum Computing. The range of potential topics for the PhD project will be: * Quantum Data Types and Algorithms; * Applications of Quantum Computing to Artificial Immune System; * Quantum Functional Programming Languages; * Compilation of Higher-Order Quantum Code; * Quantum computing in AI. Expertise in any of this topics is welcome but not necessary. Applicants should have a good background in programming, data structures, discrete mathematics. The application deadline is 6 April 2025. Before applying you must agree with a potential supervisor and write a research project. So, if you intend to apply, please contact one of us as soon as possible: Ulrik Buchholtz (ulrik.buchholtz(a)nottingham.ac.uk) Venanzio Capretta (venanzio.capretta(a)nottingham.ac.uk) Julie Greensmith (pszjg1(a)exmail.nottingham.ac.uk) ------------------------------------- Venanzio Capretta School of Computer Science University of Nottingham, UK -------------------------------------

1 0

ICFP/SPLASH 2025 Workshop Proposal Deadline: Thu, Jan 16
by ICFP Publicity 10 Jan '25

10 Jan '25

ACM SIGPLAN ICFP 2025 and SPLASH 2025 invite proposals for workshops and co-located events to be held in Singapore from Sunday, October 12 to Saturday, October 18, 2025. This joint event will create a forum for researchers, developers, and practitioners to present the latest work in software development, programming languages, functional programming, and emerging new ideas in computing. All co-located events must submit a proposal — workshops, tutorials, symposiums, or side meetings: https://icfpsplash25events.hotcrp.com/ Important Deadlines <https://conf.researchr.org/track/icfp-splash-2025/icfp-splash-2025-workshop…> - Deadline for Proposal Submission for Workshops: January 16, 2025 - Notification of Acceptance: January 31, 2025 - Deadline for Proposal Submission for Tutorials: May 8, 2025 For more information, please see: https://conf.researchr.org/track/icfp-splash-2025/icfp-splash-2025-workshops We look forward to your proposals and hope to see you in Singapore!

1 0

Formal Verification & Modern AI Safety
by Mostafa Touny 10 Jan '25

10 Jan '25

Hello Haskellers, I hope you are doing well. Amazon started to adopt automated theorem provers, to mitigate modern Generative AI hallucination. See "Prevent factual errors from LLM hallucinations with mathematically sound Automated Reasoning checks": https://aws.amazon.com/blogs/aws/prevent-factual-errors-from-llm-hallucinat… This community has ties to formal proofs, type-driven programming, and Logic programming. Do you see any special potential of Haskell for recent AI safety? Sincerely, Mostafa Touny

3 2

[ANN] Darcs 2.18.4 release
by Ben Franksen 09 Jan '25

09 Jan '25

Hello Everyone On behalf of the Darcs [1] team, I would like to announce the release of Darcs 2.18.4 [2]. See [3] for the full release notes. The main reason for this release was to make it build with stack against stackage lts-22.34 on Linux. This in turn should hopefully make it re-appear in the Debian and Ubuntu GNU/Linux distros. Cheers Ben [1] https://darcs.net [2] https://hackage.haskell.org/package/darcs-2.18.4 [3] https://hackage.haskell.org/package/darcs-2.18.4/changelog

1 1

Final call for participation: LMS/BCS-FACS Online Seminar, Annabelle McIver, 15 January 2025
by Andrei Popescu 09 Jan '25

09 Jan '25

LMS/BCS-FACS Seminar 2025 Wednesday 15 January 2025, from 19:00 (GMT) Online via Zoom https://www.lms.ac.uk/events/lms-bcs-facs-seminar-2025 In association with the British Computer Society Formal Aspects of Computing Science (BCS-FACS), the LMS hosts an annual online seminar on aspects of the computer science–mathematics interface. These events are free to anyone who wishes to attend and have attracted high-quality speakers. We are happy to have this verification talk from a wonderful speaker just one day after World Logic Day. Speaker: Annabelle McIver (Macquarie University) Probabilistic Datatypes: automating verification for abstract probabilistic reasoning Abstract: Datatypes - in which data is encapsulated together with methods that access it - play an important role in the organisation of large software projects. Correctness of datatypes has traditionally been carried out using simulation relations to simplify the verification by separating concerns: the datatype can be verified independently from the programs that use it, whilst those programs themselves can be verified using the specifications of the datatype's methods. Use of these principles enables complex programs to be brought within reach of automated proof. When probabilistic choice is included, however, it turns out that obtaining similar simplifications of the verification problem will require distinguishing between "hidden" and "observable" probabilistic behaviour - if demonic choice is allowed in the surrounding program. And that is not required in the non-probabilistic setting: the crucial issue is the potential interaction of probabilistic- and demonic choice. In the main part of this talk I will use examples to explain why the interaction is problematic, and I will suggest how extension of existing pGCL-based automated reasoning-tools, will by taking that interaction into account, enable automated probabilistic abstract reasoning about "hard to crack" probabilistic programs. Registration: To attend remotely via Zoom, please complete the registration form here: https://www.lms.ac.uk/civicrm/event/info?reset=1&id=139 You will receive the link to the meeting upon registration, as well as an automated reminder email sent 24 hours before the event is scheduled to start. For all queries regarding the seminar, please contact lmscomputerscience(a)lms.ac.uk.

1 0

Rebuilding package on hackage to generate documentation
by Ivan Perez 08 Jan '25

08 Jan '25

Hi, I'm trying to trigger a re-build of Yampa on hackage so that the documentation will be generated. I'm being met with the following message: Report not found Build report does not exist Am I doing something wrong? Thanks Ivan

1 0