- Haskell-Cafe - Haskell.org

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

06 Aug '25

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

1 0

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

06 Aug '25

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

1 0

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

03 Aug '25

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

1 0

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

31 Jul '25

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

4 4

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

30 Jul '25

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

2 1

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

29 Jul '25

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

1 0

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

27 Jul '25

Please, find below the call for draft papers for IFL 2025. The submission deadline has been extended to August 31. In this CFP we also include the announcement of our keynote speakers and of tutorials to be held on September 29 and 30, prior to IFL. Please forward this to anyone you think may be interested. ===================================================================== IFL 2025 37th Symposium on Implementation and Application of Functional Languages Montevideo, Uruguay October 1-3, 2025 https://www.fing.edu.uy/inco/congresos/ifl2025 ===================================================================== [NEWS: Extended deadline for draft paper submission, Keynote speakers, Tutorials] ### Scope The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2025 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. ### Topics of interest Topics of interest to IFL include, but are not limited to: - language concepts - type systems, type checking, type inferencing - compilation techniques - staged compilation - run-time function specialisation - run-time code generation - partial evaluation - (abstract) interpretation - meta-programming - generic programming - automatic program generation - array processing - concurrent/parallel programming - concurrent/parallel program execution - embedded systems - web applications - (embedded) domain specific languages - security - novel memory management techniques - run-time profiling performance measurements - debugging and tracing - virtual/abstract machine architectures - validation, verification of functional programs - tools and programming techniques ### Keynote speakers - Roberto Ierusalimschy Departamento de Informática, PUC-Rio, Río de Janeiro, Brazil - Iván Pérez NASA Ames Research Center, California, USA ### Tutorials On September 29 and 30, the two days prior to the symposium, four tutorials will be held: - Gradual typing Éric Tanter, University of Chile, Chile - Type Based Static Analysis Jurriaan Hage, Heriot-Watt University, UK - Development of dApps in the UTxO model TxPipe, Argentina - TBA ### Peer-review process Differently from previous editions of IFL, IFL 2025 solicits two kinds of submissions: * Regular papers (12 pages excluding references) * Draft papers for presentations ('weak' limit between 5 and 15 pages) Regular papers will undergo a rigorous review by the program committee, and will be evaluated according to their correctness, novelty, originality, relevance, significance, and clarity. Regular papers can be: accepted for publication in the formal proceedings, accepted for presentation at the symposium or rejected. Draft papers will be screened to make sure that they are within the scope of IFL, and will be accepted for presentation or rejected accordingly. We require that at least one of the authors present the work at IFL 2025. Authors of accepted presentations will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal post-proceedings after the symposium. The program committee will evaluate these submissions according to their correctness, novelty, originality, relevance, significance, and clarity, and will thereby determine whether the paper is accepted or rejected. ### Important dates Submission of regular papers: June 23, 2025 (extended) Regular papers notification: August 4, 2025 Submission of draft papers: August 31, 2025 (extended) Draft papers notification: September 4, 2025 Deadline for early registration: September 5, 2025 Submission of pre-proceedings version: September 8, 2025 Pre-symposium tutorials September 29-30, 2025 IFL Symposium: October 1-3, 2025 Submission of papers for post-proceedings: December 15, 2025 Notification of acceptance: February 28, 2026 Camera-ready version: March 30, 2026 Deadlines are end of day Anywhere on Earth (UTC-12) (https://www.timeanddate.com/time/zones/aoe) ### Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template Submit your draft paper here: https://easychair.org/conferences/?conf=ifl2025 using the track [IFL 2025 - Draft papers]. Important note to authors about the new ACM open access publishing model ACM has introduced a new open access publishing model for the International Conference Proceedings Series (ICPS). Authors based at institutions that are not yet part of the ACM Open program and do not qualify for a waiver will be required to pay an article processing charge (APC) to publish their ICPS article in the ACM Digital Library. To determine whether or not an APC will be applicable to your article, please follow the detailed guidance here: https://www.acm.org/publications/icps/author-guidance. Further information may be found on the ACM website, as follows: - Full details of the new ICPS publishing model: https://www.acm.org/publications/icps/faq - Full details of the ACM Open program: https://www.acm.org/publications/openaccess - Please direct all questions about the new model to icps-info(a)acm.org. ### Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. ### Organisation PC Chairs: Alberto Pardo, Universidad de la República, Montevideo, Uruguay Marcos Viera, Universidad de la República, Montevideo, Uruguay Publicity Chair: Mart Lubbers, Radboud University, The Netherlands Local Chairs: Alberto Pardo, Universidad de la República, Montevideo, Uruguay Marcos Viera, Universidad de la República, Montevideo, Uruguay ### Program committee: Matteo Cimini, University of Massachusetts Lowell Facundo Domínguez, Tweag João Paulo Fernandes, Universidade do Porto Jeremy Gibbons, Oxford University Jurriaan Hage, Heriot Watt University Jason Hemann, Seton Hall University Maja Hanne Kirkeby, Roskilde University Mart Lubbers, Radboud University Bruno C. D. S. Oliveira, The University of Hong Kong Rinus Plasmeijer, Radboud University Andre Rauber Du Bois, Universidade Federal de Pelotas Rodrigo Ribeiro, Universidade Federal de Ouro Preto Alejandro Russo, Chalmers University of Technology João Saraiva, University of Minho Wenhao Tang, University of Edinburgh Zhixuan Yang, Imperial College London Brent Yorgey, Hendrix College Beta Ziliani, Manas.Tech Viktória Zsók, Eötvös Loránd University ### Venue IFL 2025 will be held physically in Montevideo, Uruguay. See the website for more information. https://www.fing.edu.uy/inco/congresos/ifl2025 ### Acknowledgments This call-for-papers is an adaptation and evolution of content from previous instances of IFL. We are grateful to prior organisers for their work, which is reused here.

1 0

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

24 Jul '25

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

9 9

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

24 Jul '25

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

1 0

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

20 Jul '25

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

1 0