- Haskell-Cafe - Haskell.org

Configuring cabal to tell HPC to ignore certain functions
by Ivan Perez 23 Oct '24

23 Oct '24

Hi Café I want to configure a cabal package (specifically, copilot-core) so that, when HPC is executed during testing with coverage enabled, it ignores certain definitions, for example: - Anything that is auto-generated (e.g., Show). - Data constructors and field accessors, for which GHC also defines functions automatically, are all assumed to work. - Proxy doesn't need to be WHNFed. I think there's a way to extract the tix file and modify it, but I'm trying to make this automated, and configure the cabal package so that the right options are passed by cabal to HPC. That way, even hackage will pick it up when it reports the coverage of our library. Any pointers? Thanks! Ivan

1 0

[ANNOUNCE] GHC 9.8.3 is now available
by Ben Gamari 20 Oct '24

20 Oct '24

The GHC developers are happy to announce the availability of GHC 9.8.3. Binary distributions, source distributions, and documentation are available on the [release] page. This release is primarily a bugfix release the 9.8 series. These include: * Significantly improve performance of code loading via dynamic linking (#23415) * Fix a variety of miscompilations involving sub-word-size FFI arguments (#25018, #24314) * Fix a rare miscompilation by the x86 native code generator (#24507) * Improve runtime performance of some applications of `runRW#` (#25055) * Reduce fragmentation when using the non-moving garbage collector (#23340) * Fix source links in Haddock's hyperlinked sources output (#24086) A full accounting of changes can be found in the [release notes]. As some of the fixed issues do affect correctness users are encouraged to upgrade promptly. We would like to thank Microsoft Azure, GitHub, IOG, the Zw3rk stake pool, Well-Typed, Tweag I/O, Serokell, Equinix, SimSpace, 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. Happy compiling! - Ben [release]: https://www.haskell.org/ghc/download_ghc_9_8_3.html [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new [release notes]: https://downloads.haskell.org/~ghc/9.8.3/docs/users_guide/9.8.3-notes.html

1 0

attpoarsec and recursive parsing
by PICCA Frederic-Emmanuel 18 Oct '24

18 Oct '24

Hello I have this type data MaskLocation = MaskLocation Text | MaskLocation'Tmpl Text | MaskLocation'Or MaskLocation MaskLocation deriving (Eq, Generic, Show) deriving anyclass (FromJSON, ToJSON) instance FieldEmitter MaskLocation where fieldEmitter (MaskLocation t) = t fieldEmitter (MaskLocation'Tmpl t) = t fieldEmitter (MaskLocation'Or l r) = fieldEmitter l <> " | " <> fieldEmitter r I just added the MaskLocation'Or constructor in order to allow writing "mymask.npy | mymask2.npy | ..." So my question how should I write the new parser here the parser for the MaskLocation without the MaskLocation'Or instance FieldParsable MaskLocation where fieldParser = do t ← takeText pure $ if "{scannumber:" `Data.Text.isInfixOf` t then MaskLocation'Tmpl t else MaskLocation t It seems to me that I need to consume all text until I find a '|', call the parser on the collected text and start again the process. But I do not have a clear idea of how to collect all the values once the process is over. If someone could help me design this parser, It would be great. thanks a lot Frederic

1 0

Call for Proposals Now Open for Functional Conf 2025 (online)
by John Sinclair 18 Oct '24

18 Oct '24

Attention all functional programming enthusiasts and experts! The Functional Conf 2025 Call for Proposals is now open, and it's a golden opportunity to share your insights and innovative applications of functional programming with a vibrant community of like-minded individuals. Whether you have tackled a tricky problem using functional programming, developed a unique application, or have experiences that could enlighten your peers, we want to hear from you! We're open to all topics related to functional programming. We are seeking deep technical topics that push the boundaries of what's possible with functional programming. Our commitment to diversity and transparency means all proposals will be public for community review. Is your proposal unique? Is it well-developed and ready-to-go? Then you've got what it takes! Submit your ideas and help us make Functional Conf 2025 an unforgettable experience. Submit your proposal today and help shape the future of functional programming! https://confengine.com/conferences/functional-conf-2025/proposals<https://confengine.com/conferences/functional-conf-2025/proposals?utm_mediu…> Submission deadline: 17 November 2024 Functional Conf is an online event running 24-25 January 2025. Learn more about the conference: https://functionalconf.com

1 0

POPL 2025 Call for Tutorials (deadline extended: Oct 25th, 2024)
by Ningning Xie 17 Oct '24

17 Oct '24

POPL 2025 CALL FOR TUTORIALS https://popl25.sigplan.org/track/POPL-2025-tutorials#Call-For-Tutorials The 52nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2025) will be held in Denver, United States. 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 2025 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 19–21, 2025. The expected length of a tutorial is 3 hours, including questions and discussion (Q&A). *Submission details* Deadline for submission:* October 25th, 2024* Notification of acceptance: November 1st, 2024 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 Christoph Matheja (chmat(a)dtu.dk) and Robert Rand (rand(a)uchicago.edu) with the subject line "POPL 2025 Tutorial Proposal: [tutorial name]". The proposal should be attached as a PDF, docx, or txt file. *Further information* Any query regarding POPL 2025 tutorial proposals should be addressed to the co-located events chairs Christoph Matheja (chmat(a)dtu.dk) and Robert Rand ( rand(a)uchicago.edu) or to the general chair Steve Zdancewic ( stevez(a)seas.upenn.edu)

1 0

Re: [Haskell-cafe] [ANNOUNCE] GHC 9.12.1-alpha1 is now available
by Vanessa McHale 17 Oct '24

17 Oct '24

2 1

anyone using wxHaskell
by Zoran Bošnjak 15 Oct '24

15 Oct '24

Dear haskell cafe, I have a problem with scrolledWindow inside notebook, when running with the latest version of wxHaskell. See the minimal example below, where the scrollbar is not shown (the same sample is OK on the wxHaskell version from few years ago). I would appreciate a suggestion how to make the scrollbar work again (a workaround if possible). I have also filed the issue on the wxHaskell project page. But the project does not look like being super actively maintained. https://codeberg.org/wxHaskell/wxHaskell/issues/48 Minimal example: module Main where import Graphics.UI.WXCore import Graphics.UI.WX gui :: IO () gui = do f <- frame [text := "Frame"] p <- panel f [] nb <- notebook p [] p1 <- scrolledWindow nb [ scrollRate := sz 20 20 ] texts <- mapM (\n -> staticText p1 [text := ("test" <> show n) ]) [1::Int ..20] set f [ layout := fill $ widget p , clientSize := sz 400 200 ] set p [ layout := fill $ tabs nb [ tab "tab1" $ container p1 $ column 5 (fmap widget texts) ] ] main :: IO () main = start gui regards, Zoran

3 7

Re: [Haskell-cafe] Runtime selection on types while capturing a dictionary?
by Benjamin Redelings 14 Oct '24

14 Oct '24

On 10/9/24 10:11 AM, Benjamin Redelings wrote: > Interesting! And thanks. I've been able to move the labels into the > Graph class, and just use () as the label type when I don't want > labels. Somehow I was expecting a Haskell mailing list to recommend > something involving DataKinds. > > The other augmentations are a bit more tricky. The tree can have > either a BranchLength augmentation OR a NodeTime augmentation, but not > both. The NodeTime augmentation only makes sense when the tree is > rooted. Additionally, it makes sense on rooted forests and directed > acyclic graphs. When using the NodeTime augmentation, we can > CALCULATE the branch lengths as the time difference between the nodes > at the two ends of a branch. This provides some motivation to make > the branchLength function polymorphic, so that some of the downstream > code can be agnostic as to whether the branch lengths are directly > augmented, or computed from NodeTimes. And then there is also a > BranchRate augmentation that only makes sense if we have a NodeTime > augmentation. > > I think your ADT makes more sense than just creating a lot of > (AddAugmentationX ExtraInfo Graph) data types. So, I'll have to think > how to do that. > > On the other hand, I would like to retain some polymorphism. For > example, it would be nice to allow multiple tree representations. > Sometimes a generic graph is what you want, but in other cases the > tree-generation process makes a data structure like > > data Tree = Leaf {parent :: Maybe Tree } | Internal { left:: Tree, > right:: Tree, parent:: (Maybe Tree)} > > more natural. So, having an IsGraph *class* versus just a single > Graph data structure seems valuable. > > QUESTION: Given that, can you expand on what counts as a type-class > "shenanigan"? I fully agree that the class structure and the data > type structure isn't very good yet. (It was implemented in haste to > make something "just work". The standard format for printing trees -- > Newick format -- really prints rooted trees, so I ended up creating a > 'type family Rooted t' to make a rooted tree type from an unrooted > tree type. That seems very hacky.) But I would like to retain some > generality across common features between NodeTime and BranchLength > augmented trees, as well as (perhaps) generality across different > implementations of Graph / Tree. > > QUESTION: For the constraint that a NodeTime tree should be rooted, do > you think I should encode this constraint at the data-type level, or > at the function level? I was initially thinking of encoding this at > the data type level, so that you couldn't construct a tree with node > times that was not rooted. But I suppose one could simply make all the > functions that USE node-time trees require some kind of Rooted > constraint by calling a function like 'parent node'. This would > decouple the Rooted/Unrooted augmentation from the BranchLength / > NodeTime / Nothing augmentation. Thoughts? > > -BenRI > > > On 10/7/24 6:13 PM, Tom Ellis wrote: >> On Mon, Oct 07, 2024 at 05:38:30PM -0400, Benjamin Redelings wrote: >>> I'm new to Haskell, and I'm writing a class for evolutionary trees. >>> Since >>> I'm new to Haskell, trying to encode information at the type level >>> is new to >>> me. In C++ I'd use runtime checks to ask whether (for example) a >>> tree is >>> rooted. Or I'd have the getRoot function return Maybe NodeID and >>> then make >>> the methods for checking if a branch points rootward throw an >>> exception if >>> the tree is unrooted. >> I think I'd just do >> >> data AugmentedTree roots lengths labels = >> MkAugmentedTree { >> tree :: Tree, >> labels :: labels, >> roots :: roots, >> lengths :: lenghts >> } >> >> and then just do stuff like >> >> type FullyAugmentedTree = >> AugmentedTree [NodeId] (IntMap Double) (IntMap (Maybe l)) >> type PartiallyAugmentedTree = >> AugmentedTree [NodeId] () (IntMap (Maybe l)) >> >> For rootedness-independence I strongly recommend against any type >> class shenanigans. Instead you can do >> >> data PossiblyRootedTree lengths labels where >> RootedTree :: AugmentedTree [NodeId] lengths labels >> UnrootedTree :: AugmentedTree () lengths labels >> >> and then >> >> isRooted :: PossiblyRootedTree lengths labels -> Bool >> isRooted = \case >> RootedTree {} -> True >> UnrootedTree {} -> False >> >> (but `isRooted` is not really very useful compared to just pattern >> matching every where you need to know.) >> >> Tom >> _______________________________________________ >> Haskell-Cafe mailing list >> To (un)subscribe, modify options or view archives go to: >> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe >> Only members subscribed via the mailman list are allowed to post.

2 1

Call for Contributions: BOB 2025 (Berlin, March 14 - Deadline Nov 15)
by Stefan Wehr 14 Oct '24

14 Oct '24

================================================================================ BOB Conference 2025 "What happens when we use what's best for a change?" https://bobkonf.de/2025/cfc.html Berlin, Mar 14 Call for Contributions Deadline: November 15, 2024 ================================================================================ 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 - next-generation IDEs - effective abstractions for data analytics - … everything really that isn’t mainstream, but you think should be - … includeing rough ideas 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 15, 2024 - Notification: December 4, 2024 - Program: December 11, 2024 Submit here: https://pretalx.com/bob-2025/submit/ Program Committee ----------------- (more information here: https://bobkonf.de/2025/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

Ideas for a master's thesis
by Jon Kristensen 12 Oct '24

12 Oct '24

Hi! I'm about to do a master's thesis in Software Engineering and I'm thinking about the possibility of doing something related to Haskell. I would like to apply (Bayesian) statistics and, ideally, conduct some kind of experiment. If you have any suggestions on topics, please let me know! Are there perhaps any particular challenges related to packages, dependencies, breakages or security vulnerabilities that I could take a look at? Is the PVP debate still ongoing, by the way? Back in 2016, when I started looking into what I could do as a thesis, I wrote the following in a thesis proposal: There is a (polarized) debate in the Haskell community about its package versioning policy (“PVP”), a variant of semantic versioning. Basically, the debate is centered around whether developers of Haskell packages should be “optimistic” or “pessimistic” in regards to breakages when introducing new versions of dependencies. Put differently, the debate is about how liberal or conservative developers should be when they set upper bound version restrictions for dependencies that have not been released yet. A liberal approach can result in a late discovery of a package breaking (possibly during compilation), and a conservative approach could result in constraints that cause the dependency solver not to find a set of dependencies that satisfies the version constraints (where one would have been possible and desirable). The objective for the study is to inform the PVP debate by developing a model that can be used to analyze why packages break when new versions of dependencies are released. The research question is: How can the handling of package dependencies in package systems using semantic versioning be changed to significantly reduce the problem of packages breaking? Thanks! 🙂 All the best, Jon

2 1

[TFP 2025 2nd Call for Papers] 25th International Symposium on Trends in Functional Programming (Oxford, UK)
by Peter Achten 11 Oct '24

11 Oct '24

# TFP 2025 - 2nd Call for Papers (trendsfp.github.io) 26th International Symposium on Trends in Functional Programming 14-16 January 2025, Oxford, UK ## Important Dates Submission deadline (pre-symposium, full papers): Wed 13th Nov 2024 (AOE) Notification (pre-symposium, full papers): Wed 11th Dec 2024 Submission deadline (pre-symposium draft papers): Wed 11th Dec 2024 (AOE) Notification (pre-symposium draft papers): Mon 16th Dec 2024 Submission deadline (post-symposium review): Wed 19th Feb 2025 (AOE) Notification (post-symposium submissions): Wed 26th Mar 2025 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 Oxford, UK. It is co-located with the Trends in Functional Programming in Education (TFPIE) workshop, which will take on the day before the main symposium. Please be aware that TFP has several submission deadlines. The first, 13th November, is for authors who wish to have their full paper reviewed prior to the symposium. Papers that are accepted in this way must also be presented at the symposium. The second, 11th December, is for authors who wish to present their work or work-in-progress at the symposium first without submitting to the full review process for publication. These authors can then take into account feedback received at the symposium and submit a full paper for review by the third deadline, 19th February. ## Scope The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five paper categories. High-quality submissions are solicited in any of these categories: * Research Papers: Leading-edge, previously unpublished research work * Position Papers: On what new trends should or should not be * Project Papers: Descriptions of recently started new projects * Evaluation Papers: What lessons can be drawn from a finished project * Overview Papers: Summarizing work with respect to a trendy subject Papers must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include, but are not limited to: * Functional programming and multicore/manycore computing * Functional programming in the cloud * High performance functional computing * Extra-functional (behavioural) properties of functional programs * Dependently typed functional programming * Validation and verification of functional programs * Debugging and profiling for functional languages * Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. * Interoperability with imperative programming languages * Novel memory management techniques * Program analysis and transformation techniques * Empirical performance studies * Abstract/virtual machines and compilers for functional languages * (Embedded) domain specific languages * New implementation strategies * Any new emerging trend in the functional programming area If you are in doubt on whether your paper is within the scope of TFP, please contact the programme chair, Jeremy Gibbons. ## Best Paper Awards TFP awards two prizes for the best papers each year. First, to reward excellent contributions, TFP awards a prize for the best overall paper accepted for the post-conference formal proceedings. Second, each year TFP also awards a prize for the best student paper. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are the paper's first authors, and a student would present the paper. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, then that paper will receive both prizes. ## Instructions to Authors Submission is via EquinOCS (https://equinocs.springernature.com/service/tfp2025) 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 Jeremy Gibbons University of Oxford, UK Programme 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 Peter Achten Radboud University Nijmegen, NL Edwin Brady University of St Andrews, UK Laura Castro University of A Coruña, ES Youyou Cong Tokyo Institute of Technology, JP Paul Downen University of Massachusetts Lowell, US João Paulo Fernandes University of Coimbra, PT Ben Greenman University of Utah, US Jurriaan Hage Heriot-Watt University, UK Jason Hemann Seton Hall University, US Zhenjiang Hu Peking University, CN Hans-Wolfgang Loidl Heriot-Watt University, UK Kazutaka Matsuda Tohoku University, JP Zoe Paraskevopoulou Ethereum Foundation, US Alejandro Serrano 47 Degrees, ES Nick Smallbone Chalmers University, SE Alley Stoughton Boston University, US Wouter Swierstra Utrecht University, NL Niki Vazou IMDEA Software Institute, ES Marcos Viera Universidad de la República, UY Viktória Zsók Eötvös Loránd University of Sciences, HU

1 0

1st CfP: SLE 2025 - 18th ACM SIGPLAN International Conference on Software Language Engineering
by Andrei Chis 10 Oct '24

10 Oct '24

18th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2025) 12-13 June 2025 Koblenz, Germany https://www.sleconf.org/2025/ https://x.com/sleconf ------------------------------------------------------------------------ We are pleased to invite you to submit papers to the 18th 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 2025 conference will be co-located with STAF 2025 and hosted in Koblenz, Germany, on 12-13 June 2025. --------------------------- Important Dates --------------------------- * Abstract submission: Fri 7 Feb 2025 * Paper submission: Fri 14 Feb 2025 * Authors response period: Tue 1 Apr - Sat 5 Apr 2025 * Notification: Tue 15 Apr 2025 * Conference: Thu 12 June - Fri 13 June 2025 (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 Validation - 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 refactoring * 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) - AI and ML language engineering (e.g., ML compiler testing, code classification) - 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 demonstrations. 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 2025 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 2025 Website. --------------------------- Submission --------------------------- SLE 2025 has a single submission round for papers, including a mandatory abstract registration and a rebuttal phase, where all authors of research papers will have the possibility of responding to the reviews on their submissions. 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. The submission website is: https://sle25.hotcrp.com --------------------------- 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, and replicability. New ideas/vision papers will be evaluated primarily concerning soundness, relevance, novelty, and presentation. SLEBoK papers will be reviewed on their soundness, relevance, originality, 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. For research papers, authors will get a chance to respond to the reviews before a final decision is made. --------------------------- 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 2015 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: Görel Hedin, Lunds Universitet, Sweden * PC co-chair: Regina Hebig, Universität Rostock, Germany * PC co-chair: Vadim Zaytsev, Universiteit Twente, The Netherlands * Publicity chair: Andrei Chiş, feenk gmbh, Switzerland * Local chair: Ralf Lämmel, Universität Koblenz, Germany --------------------------- Contact --------------------------- For additional information, clarification, or answers to any questions, please get in touch with the program co-chairs (regina.hebig(a)uni-rostock.de and vadim(a)grammarware.net)

1 0

Runtime selection on types while capturing a dictionary?
by Benjamin Redelings 09 Oct '24

09 Oct '24

Hi, I'm new to Haskell, and I'm writing a class for evolutionary trees. Since I'm new to Haskell, trying to encode information at the type level is new to me. In C++ I'd use runtime checks to ask whether (for example) a tree is rooted. Or I'd have the getRoot function return Maybe NodeID and then make the methods for checking if a branch points rootward throw an exception if the tree is unrooted. I'm trying to avoid doing this the C++ way, but this raises a lot of question. Let me start with 2 of them: 1. Is there any advice on how to represent data structures that may or may not have a list of attributes? But what I have in Haskell right now looks like this: data Graph (IntMap Node) (IntMap Edge) data WithBranchLengths t = WithBranchLengths t (IntMap Double) data WithLabels t l = WithLabels t (IntMap (Maybe l)) data Forest = Forest Graph {- Assert that the Graph is a Forest -} data WithRoots t = WithRoots t [NodeId] data WithNodeTimes t = WithNodeTimes t (IntMap Double) data WithBranchRates t = WithBranchRates t (IntMap Double) data Tree = Tree Forest {- Assert that the Forest is a Tree -} A tree with labels, roots, and branch lengths could have following types: WithLabels (WithRoots (WithBranchLengths Tree)) Text WithLabels (WithBranchLengths (WithRoots Tree)) Text WithRoots (WithLabels (WithBranchLengths Tree) Text) WithRoots (WithBranchLengths (WithLabels Tree Text)) .. etc etc.. The fact that there are multiple ways to represent the same thing is already not great. Also, the fact that you can do WithBranchLengths (WithBranchLengths Tree) indicates that the construction of types should be obeying certain rules that are not expressed. Only the outer WithBranchLengths is going to count, and there really should not be two of the same attribute. 2. I'm wondering if it is possible to do run-time selection on whether a tree is rooted or not. (I've considered trying to move all checks to the type-level, but this inhibits putting models with different properties into the same list -- see below) class IsGraph g where ... class IsGraph g => IsDirectedGraph g where isForward :: g -> EdgeId -> Bool class IsDirectedGraph g => IsDirectedAcyclicGraph g class IsGraph f => IsForest f where type family Unrooted f type family Rooted f unroot :: f -> Unrooted f makeRooted :: f -> Rooted f class (IsDirectedAcyclicGraph t, IsForest t) => HasRoots t where isRoot :: t -> NodeId -> Bool roots :: t -> [NodeId] isRoot f n = isSource f n roots f = filter (isRoot f) (getNodes f) At first I was thinking that since rooting is at the type level, then I can't do any runtime branching on whether a tree is rooted. But then it occured to me that a GADT can package dictionaries with a constructor, so that in theory I could do something like: likelihood s t = if isEquilibriumReversible s then equilibriumReversibleLikelihood s t else case isRooted t of Unrooted -> error "tree must be rooted, since model is not reversible or not at equilibrium!" Rooted -> rootedTreeLikelihood s t It seems like this might work if I could make a GADT with a signature something like: data MaybeRooted t = Unrooted | HasRoots t => Rooted -- Q: should this use a forall type? In that case the Rooted constructor would package the HasRoots t dictionary needed to run the rootedTreeLikelihood function. But I'm not sure how I would actually write the `isRooted` function that would construct the MaybeRooted t data type. I've considered trying to encode the EquilibriumReversible predicate at the type level to avoid runtime checks, but that has the problem that I couldn't put models with different properties into the the same list of type [m]. So I guess the questions are: Q2a: is this a reasonable way of trying to do runtime selection on whether a tree is rooted? Q2b: how would I write the `isRooted t` function? Feedback much appreciated. -BenRI P.S. Haskell code is here: https://github.com/bredelings/BAli-Phy/tree/master/haskell

3 3

Re: [Haskell-cafe] Runtime selection on types while capturing a dictionary?
by Olaf Klinke 08 Oct '24

08 Oct '24

> It seems like this might work if I could make a GADT with a signature > something like: > > data MaybeRooted t = Unrooted | HasRoots t => Rooted Yes, that is what GADTs can do for you. But as Tom said, avoid this if cou can. Incidentally, there is a pattern known as "trees that grow" [1] Where a skeleton type has rank-1 parameters that can switch on and off certain constructors. E.g. for a rooted tree you would provide an Identity parameter, for an unrooted tree provide a Const Void or Const () parameter. Small example: data Tree' root branch = Tree' (root [branch (Tree root branch)]) type UnrootedLabeled a = Tree' Identity ((,) a) type RootedLabeled r b = Tree' ((,) r) ((,) b) -- etc. As you observed, this can become confusing, if there are too many variants and the types you actually work with are just type aliases. The advantage is (a) no type classes, (b) you can have pattern-matching functions for a variety of different trees if they do not depend on patterns in the type parameters. > Also, the fact that you can do WithBranchLengths > (WithBranchLengths Tree) indicates that the construction of types > should > be obeying certain rules that are not expressed. Having several type parameters instead of the single t, where every parameter plays a single role, can aid in making rules clearer, but only a GADT may enforce them. There are other rules that only a dependently-typed language will be able to express. Finally, have you tried using one of the existing Haskell graph libraries as a starting point? It may save you a lot of boilerplate code. Olaf [1] https://www.microsoft.com/en-us/research/wp-content/uploads/2016/11/trees-t…

1 0

39th Agda Implementor's Meeting (AIM XXXIX) 25-30 Nov 2024 in Gothenburg
by Andreas Abel 20 Sep '24

20 Sep '24

---------------------------------------------------------------------- Agda Implementors' Meeting XXXIX Call for participation https://wiki.portal.chalmers.se/agda/Main/AIMXXXIX ---------------------------------------------------------------------- The 39th Agda Implementors' Meeting will take place in Gothenburg, Sweden, from Monday 25th to Saturday 30th November 2024. (This is our 20th anniversary of Agda meetings, the first took place in Fall 2004 in Gothenburg.) The meeting will consist of: * Presentations concerning theory, implementation, and use cases of Agda and other Agda-like languages. * Discussions around issues related to the Agda language. * Plenty of time to work in, on, under or around Agda, in collaboration with other participants. * A special session dedicated to the 20th anniversary of AIM. Attendance is free of charge, but a registration is warranted until 31st October 2024 (soft deadline). For information how to register check out https://wiki.portal.chalmers.se/agda/Main/AIMXXXIX Looking forward to seeing you in there! Andreas (on behalf of the AIM XXXIX organizing committee) -- Andreas Abel <>< Du bist der geliebte Mensch. Department of Computer Science and Engineering Chalmers and Gothenburg University, Sweden andreas.abel(a)gu.se http://www.cse.chalmers.se/~abela/

1 0

PhD position at KU Leuven
by Tom Schrijvers 16 Sep '24

16 Sep '24

KU Leuven invites applications for a PhD position in Prof. Tom Schrijvers' research team, exploring the interaction between multi-stage programming and computational effects. Ideal candidates hold a Master's in Computer Science, have a strong academic record, and a passion for programming languages like Haskell, type systems, and functional programming. We offer a 4-year scholarship, a dynamic research environment, and opportunities for international collaboration. Join us to push the boundaries of programming language theory! For more information see: https://www.kuleuven.be/personeel/jobsite/jobs/60384347?hl=nl&lang=nl

1 0

Call for Volunteers - Security Response Team
by Jose Calderon 04 Sep '24

04 Sep '24

The Security Response Team (SRT) is formally calling for applications to join the SRT. People from the Haskell community with information security experience are encouraged to apply. This is an opportunity to have a large impact on the practice of Haskell programming going forward. Since its inception, the SRT has had an outsized impact on the Haskell Ecosystem. I can say with confidence that the group conducts its business in an extremely professional and disciplined manner. If you have an interest in helping the team continue its mission, please apply! ## Security Response Team responsibilities The general responsibilities of the SRT are: - Manage the Haskell Security Advisory Database, on behalf of the Haskell community and the Haskell Foundation. - Triage and assess incoming security reports or proposed/candidate security advisories. - Assist reporters to determine CVSS scores and CWE values for confirmed security issues. - Communicate with package maintainers and the community to promote the timely resolution of reported security issues. - Ensure the security advisory data are useful for downstream security tooling. (Development of downstream tooling is not an SRT responsibility, but engaging with the developers is) - Report quarterly on the activities of the SRT and statistics/trends in new security issues. ## How can you help? - You can apply - If you don't want to apply but know someone who would be great, encourage them to apply. - Volunteers should have experience in one or more of the following areas: - web application security - information security incident response - vulnerability research and analysis - penetration testing - cryptography - authentication and identity management - governance, risk management and compliance (GRC) - secure application development - algorithms, data structures, and their role in DoS attacks - related disciplines ## Who is involved? The current membership of the SRT is: - Fraser Tweedale - Gautier Di Folco - Mihai Maruseac - Tristan de Cacqueray The team is hoping to gain 2-3 new members via this call for volunteers. ## How to apply Email `Fraser Tweedale <frase+hasksec(a)frase.id.au>` with subject "Haskell SRT Application". Include a brief overview of your background in security and the specific topics (e.g. from the list above) with which you have experience. ## Deadline Please submit your applications by end of day September 30th, 2024.

1 0

[TFP 2025 Call for Papers] 25th International Symposium on Trends in Functional Programming (Oxford, UK)
by Peter Achten 04 Sep '24

04 Sep '24

# TFP 2025 - Call for Papers (trendsfp.github.io) ## Important Dates Submission deadline (pre-symposium, full papers): Wed 13th Nov 2024 (AOE) Notification (pre-symposium, full papers): Wed 11th Dec 2024 Submission deadline (pre-symposium draft papers): Wed 11th Dec 2024 (AOE) Notification (pre-symposium draft papers): Mon 16th Dec 2024 Submission deadline (post-symposium review): Wed 19th Feb 2025 (AOE) Notification (post-symposium submissions): Wed 26th Mar 2025 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 Oxford, UK. It is co-located with the Trends in Functional Programming in Education (TFPIE) workshop, which will take on the day before the main symposium. Please be aware that TFP has several submission deadlines. The first, 13th November, is for authors who wish to have their full paper reviewed prior to the symposium. Papers that are accepted in this way must also be presented at the symposium. The second, 11th December, is for authors who wish to present their work or work-in-progress at the symposium first without submitting to the full review process for publication. These authors can then take into account feedback received at the symposium and submit a full paper for review by the third deadline, 19th February. ## Scope The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five paper categories. High-quality submissions are solicited in any of these categories: * Research Papers: Leading-edge, previously unpublished research work * Position Papers: On what new trends should or should not be * Project Papers: Descriptions of recently started new projects * Evaluation Papers: What lessons can be drawn from a finished project * Overview Papers: Summarizing work with respect to a trendy subject Papers must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include, but are not limited to: * Functional programming and multicore/manycore computing * Functional programming in the cloud * High performance functional computing * Extra-functional (behavioural) properties of functional programs * Dependently typed functional programming * Validation and verification of functional programs * Debugging and profiling for functional languages * Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. * Interoperability with imperative programming languages * Novel memory management techniques * Program analysis and transformation techniques * Empirical performance studies * Abstract/virtual machines and compilers for functional languages * (Embedded) domain specific languages * New implementation strategies * Any new emerging trend in the functional programming area If you are in doubt on whether your paper is within the scope of TFP, please contact the programme chair, Jeremy Gibbons. ## Best Paper Awards TFP awards two prizes for the best papers each year. First, to reward excellent contributions, TFP awards a prize for the best overall paper accepted for the post-conference formal proceedings. Second, each year TFP also awards a prize for the best student paper. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are the paper's first authors, and a student would present the paper. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, then that paper will receive both prizes. ## Instructions to Authors Submission is via EquinOCS (https://equinocs.springernature.com/service/tfp2025) 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 Jeremy Gibbons University of Oxford, UK Programme 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 Peter Achten Radboud University Nijmegen, NL Edwin Brady University of St Andrews, UK Laura Castro University of A Coruña, ES Youyou Cong Tokyo Institute of Technology, JP Paul Downen University of Massachusetts Lowell, US João Paulo Fernandes University of Coimbra, PT Ben Greenman University of Utah, US Jurriaan Hage Heriot-Watt University, UK Jason Hemann Seton Hall University, US Zhenjiang Hu Peking University, CN Hans-Wolfgang Loidl Heriot-Watt University, UK Kazutaka Matsuda Tohoku University, JP Zoe Paraskevopoulou Ethereum Foundation, US Alejandro Serrano 47 Degrees, ES Nick Smallbone Chalmers University, SE Alley Stoughton Boston University, US Wouter Swierstra Utrecht University, NL Niki Vazou IMDEA Software Institute, ES Marcos Viera Universidad de la República, UY Viktória Zsók Eötvös Loránd University of Sciences, HU

1 0

Call for Participation - Haskell Bug Interviews
by Leonhard Applis 02 Sep '24

02 Sep '24

Dear Haskell Mailing List, we are looking for participants for a ~30 minute interview on bugs, debugging and bug-classification in Haskell. There is a big body of literature on this for e.g. Java, but Haskell might has its own challenges (or hidden similarities), and we hope to map out valuable research that helps practitioners. Your opinion really matters, and I want to encourage anyone to reach out to us even if you don't feel "experienced enough". We don't have a measure for what a real Haskell programmer must do, and if you are coming from a different paradigm and background your insights are very valuable too. The only requirement is to use Haskell regularly enough to encounter and fix bugs, preferably in contact with other humans. This research is currently conducted at the TU Delft and underlies its Data Protection and Ethics standards. Participants from Industry are particularly encouraged and it is possible to redact the transcript post-interview to ensure only things are shared you are comfortable sharing. We will not share interviews or transcripts - only excerpts anonymized and gathered in a codebook. Looking forward for all your Bugs! Best Leonhard Applis (L.H.Applis(a)tu-delft.nl , Leonhard.Applis(a)Protonmail.com) Razvan Nistor (rnistor(a)protonmail.com)

1 0

NFData instance for ForeignPtr
by Vanessa McHale 01 Sep '24

01 Sep '24

I see that deepseq/base have NFData instances for Ptr but not ForeignPtr. Is there a reason there can be no such instance? Cheers, Vanessa McHale

1 0

Speeding up trivial programs
by amindfv＠mailbox.org 25 Aug '24

25 Aug '24

I'm working on a small program that has to run many, many times, as quickly as possible (yes, it needs to be a standalone program). I've optimized it in many ways, but I seem to have a time floor, observable with "Hello, world" $ cat Hello.hs main = putStrLn "Hello world" $ ghc -O2 Hello.hs $ time ./Hello Hello world real 0m0.150s user 0m0.117s sys 0m0.032s The equivalent program in C takes only 0.002s (75x faster). What is taking the extra time? Is it the RTS "booting"? Is there any way to speed this up? Thanks, Tom

7 8

[ANN] Dunai 0.13.1, dunai-test 0.13.1 and bearriver 0.14.10
by Ivan Perez 22 Aug '24

22 Aug '24

Dear all, I'm really excited to announce the release of Dunai 0.13.1 and Bearriver 0.14.10! Dunai is a reactive programming library structured around a notion of Monadic Stream Functions. Dunai can be used to implement other reactive and FRP frameworks on top, including Classic FRP and Arrowized FRP variants. Dunai comes with: - bearriver: API-compatible implementation of Yampa. (The Bear River is a tributary to the Yampa river.) - dunai-test: QuickCheck-based temporal testing library that can be connected with the testing system haskell-titan. See https://github.com/ivanperez-keera/dunai#features for details on Dunai's features. This release fixes an issue with the dependency on the list-transformer library as an alternative to transformers. Thanks to @ tomsmeding for the contribution. This release also provides a matching FRP.BearRiver.Integration, FRP.BearRiver.Random, FRP.BearRiver.Task and FRP.BearRiver.Simulation (akin to Yampa's), including the new Yampa combinator trapezoidIntegral. This last combinator was copied almost verbatim from Yampa, and I want to thank @idontgetoutmuch , @miguel-negrao and @thalerjonathan once again for the discussion and for contributing several alternative implementations. We are now just one module away from being able to provide 100% match in bearriver for all definitions in Yampa. Special thanks go to Johannes Riecken (@johannes-riecken on github) for a regular contribution to support the dunai and Yampa projects. As always, dunai, dunai-test and bearriver are released in sync. For details, see: - https://github.com/ivanperez-keera/dunai/releases/tag/v0.13.1 *Releases* You can explore the current versions at: - https://hackage.haskell.org/package/dunai - https://hackage.haskell.org/package/dunai-test - https://hackage.haskell.org/package/bearriver *Code* The github repo is located at: https://github.com/ivanperez-keera/dunai *What's coming* This release comes exactly 2 months after the last release. The next release is planned for Oct 21, 2024. There are several issues open that you can contribute to: https://github.com/ivanperez-keera/dunai/issues Following our roadmap, the pending changes remain as follows: - Match all definitions from FRP.Yampa.Switches. - Use new performance evaluation features of Yampa to improve performance of both Yampa and dunai. - Create new examples that demonstrate the features of dunai and bearriver. *Donations* Our project is now seeking donations to help continue developing dunai, create new open source libraries, new material, and give talks. No donation is too small. Any contribution will absolutely help. See https://github.com/sponsors/ivanperez-keera for details. If you can help, please come forward. All the best, Ivan

1 0

IFL 2024, final call for participation/registration
by Mart Lubbers 16 Aug '24

16 Aug '24

======================================================================= IFL 2024 36rd Symposium on Implementation and Application of Functional Languages venue: Radboud University Nijmegen, The Netherlands August 26 - 28 2024 https://ifl24.cs.ru.nl ======================================================================= ### 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 2024 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. ### Industrial track and topics of interest Topics of interest to IFL include, but are not limited to: - language concepts - type systems, type checking, type inferencing - compilation techniques - staged compilation - run-time function specialisation - run-time code generation - partial evaluation - (abstract) interpretation - meta-programming - generic programming - automatic program generation - array processing - concurrent/parallel programming - concurrent/parallel program execution - embedded systems - web applications - (embedded) domain specific languages - security - novel memory management techniques - run-time profiling performance measurements - debugging and tracing - virtual/abstract machine architectures - validation, verification of functional programs - tools and programming techniques ### Peer-review process Following IFL tradition, IFL 2024 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers will be screened by the program chairs to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. After the symposium, a formal review process will take place, conducted by the program committee. Reviewing is single blind. There will be at least 3 reviews per paper. The reviewers have 6 weeks to write their reviews. For the camera-ready version the authors can make minor revisions which are accepted without further reviewing. ### Important dates Submission deadline of draft papers August 6th, 2024 EXTENDED Notification of acceptance for presentation August 6th, 2024 Registration deadline August 19th, 2024 IFL symposium August 26-28, 2024 Submission of papers for proceedings December 1st, 2024 Notification of acceptance February 2nd, 2025 Camera-ready version March 2nd, 2025 ### Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template Submit your paper here: https://easychair.org/conferences/?conf=ifl20240 Register here: https://ifl24.cs.ru.nl/Registration 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: Mart Lubbers Radboud University, The Netherlands Local Chairs: Peter Achten Radboud University, The Netherlands Sven-Bodo Scholz, Radboud University, The Netherlands ### Program committee: Benoît Montagu, University of Lorraine, Inria, France Christos Dimoulas, Northwestern University, USA Edsko de Vries, Well-typed, The Netherlands Fritz Henglein, University of Copenhagen, Denmark Ian Mackie, University of Sussex, UK Jason Hemann, Seton Hall University, USA João Saraiva, Universidade do Minho, Portugal Jurriaan Hage, Heriot-Watt University, UK Kenichi Asai, Ochanomizu University, Japan Maja Kirkeby, Roskilde University, Denmark Marco Morazán, Seton Hall University, USA Neil Mitchell, Facebook, UK Ralf Laemmel, University of Koblenz Landau, Germany Rinus Plasmeijer, TOP Software/Radboud University, The Netherlands Stephen Chang, UMass Boston, USA Tim Steenvoorden, Open University, The Netherlands Tom Schrijvers, KU Leuven, Belgium Yusuf Moosa Motara, Rhodes University, South Africa ### Venue IFL 2024 will be held physically in Nijmegen, the Netherlands. See the website for more information. https://ifl24.cs.ru.nl ### 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

Vienna Haskell Meetup on Sep 26th
by Andreas Klebinger 15 Aug '24

15 Aug '24

** *Hello everyone! We are hosting a Haskell meetup in Vienna on the 26th of September! The location will be at TU Vienna Treitlstraße 3, Seminarraum DE0110. The room will open at 18:00.We plan to have 1-2 short talks starting at 19:00 (topics to be announced). Depending on interest there might also be a short Show & Tell session giving people the opportunity to show off or talk about something they work(ed) on for 5-10 Minutes each.There will be time to discuss the presentations with some snacks and non-alcoholic drinks being provided afterwards with an option to acquire beer for a reasonable price.The meetup is open ended but we might have to relocate to a nearby bar as a group if it goes very late..* *There is no entrance fee or mandatory registration, but to help with planning we ask you to let us know in advance if you plan to attend here https://forms.gle/Paiw6D4QJzTKzcmM6 <https://forms.gle/Paiw6D4QJzTKzcmM6>or per email at haskellvienna.meetup(a)gmail.com. We especially encourage you to reach out if you would like to participate in the show&tell or to give a full talk so that we can ensure there is enough time for you to present your topic.We hope to welcome everyone soon, your organizers:Andreas(Andreas PK), Benny, Chris, fendor, VeryMilkyJoe, Samuel*

1 0

no-unused-imports for only one import
by PICCA Frederic-Emmanuel 09 Aug '24

09 Aug '24

Hello, I would like to set -Wno-unused-imports for only one import, is it possible and how to do it ? thanks for your advices. Frederic

5 7

POPL 2025 Call for Tutorials
by Ningning Xie 08 Aug '24

08 Aug '24

POPL 2025 CALL FOR TUTORIALS https://popl25.sigplan.org/track/POPL-2025-tutorials#Call-For-Tutorials The 52nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2025) will be held in Denver, United States. 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 2025 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 19–21, 2025. The expected length of a tutorial is 3 hours, including questions and discussion (Q&A). *Submission details* Deadline for submission: October 18th, 2024 Notification of acceptance: November 1st, 2024 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 Christoph Matheja (chmat(a)dtu.dk) and Robert Rand (rand(a)uchicago.edu) with the subject line "POPL 2025 Tutorial Proposal: [tutorial name]". The proposal should be attached as a PDF, docx, or txt file. *Further information* Any query regarding POPL 2025 tutorial proposals should be addressed to the co-located events chairs Christoph Matheja (chmat(a)dtu.dk) and Robert Rand ( rand(a)uchicago.edu) or to the general chair Steve Zdancewic ( stevez(a)seas.upenn.edu)

1 0

Mathematics in Programming - a book with Haskell examples
by Xinyu LIU 06 Aug '24

06 Aug '24

Hello, My book 'Mathematics in Programming' in English was published on 7/11/2024. This book uses Haskell as the main tool for examples of mathematics ideas. Springer link: https://link.springer.com/book/10.1007/978-981-97-2432-1 Amazon link: https://www.amazon.com/Mathematics-Programming-Xinyu-Liu/dp/9819724317/ The book presents the mathematical view and tools of computer programming with broad and friendly context. It explains the basic concepts such as recursion, computation model, types, data, and etc. The book serves as an introductory and reference guide to the engineers, students, researchers, and professionals who are interested in functional programming, type system, and computer programming languages. The book covers seven topics. Firstly, it lays out the number system based on Peano Axioms and demonstrates the isomorphic computer data structures. Then, it introduces Lambda calculus as a computing model and recursion, an important programming structure, with the Y-combinator. It next presents the basic abstract algebra, including group and fields, and provides a friendly introduction to Galois theory. After that, it uses category theory as a tool to explain several concepts in computer programming, including the type system, polymorphism, null handler, and recursive data types, then followed by an application of program optimization. In the last two chapters, the author shows how to program with the concept of infinity through stream and lazy evaluation, and then explains the naïve set theory and transfinite numbers, from which the logic paradox arises. Finally, it introduces four historical views of mathematical foundation, as well as Gödel’s incompleteness theorems developed in 1930s, and how they define the boundaries of computer programming. Additionally, the book provides biographies, stories, and anecdotes of 25 mathematicians, along with over 130 exercises and their corresponding answers. Xinyu LIU https://github.com/liuxinyu95 <https://github.com/liuxinyu95/unplugged> *e*^(*π*i)+1 = 0

1 0

IFL 2024 Final call for papers, extended submission deadline.
by Mart Lubbers 05 Aug '24

05 Aug '24

======================================================================= IFL 2024 36rd Symposium on Implementation and Application of Functional Languages venue: Radboud University Nijmegen, The Netherlands August 26 - 28 2024 https://ifl24.cs.ru.nl ======================================================================= ### 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 2024 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. ### Industrial track and topics of interest Topics of interest to IFL include, but are not limited to: - language concepts - type systems, type checking, type inferencing - compilation techniques - staged compilation - run-time function specialisation - run-time code generation - partial evaluation - (abstract) interpretation - meta-programming - generic programming - automatic program generation - array processing - concurrent/parallel programming - concurrent/parallel program execution - embedded systems - web applications - (embedded) domain specific languages - security - novel memory management techniques - run-time profiling performance measurements - debugging and tracing - virtual/abstract machine architectures - validation, verification of functional programs - tools and programming techniques ### Peer-review process Following IFL tradition, IFL 2024 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers will be screened by the program chairs to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. After the symposium, a formal review process will take place, conducted by the program committee. Reviewing is single blind. There will be at least 3 reviews per paper. The reviewers have 6 weeks to write their reviews. For the camera-ready version the authors can make minor revisions which are accepted without further reviewing. ### Important dates Submission deadline of draft papers August 6th, 2024 EXTENDED Notification of acceptance for presentation August 6th, 2024 Registration deadline August 19th, 2024 IFL symposium August 26-28, 2024 Submission of papers for proceedings December 1st, 2024 Notification of acceptance February 2nd, 2025 Camera-ready version March 2nd, 2025 ### Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template Submit your paper here: https://easychair.org/conferences/?conf=ifl20240 Register here: https://ifl24.cs.ru.nl/Registration 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: Mart Lubbers Radboud University, The Netherlands Local Chairs: Peter Achten Radboud University, The Netherlands Sven-Bodo Scholz, Radboud University, The Netherlands ### Program committee: Benoît Montagu, University of Lorraine, Inria, France Christos Dimoulas, Northwestern University, USA Edsko de Vries, Well-typed, The Netherlands Fritz Henglein, University of Copenhagen, Denmark Ian Mackie, University of Sussex, UK Jason Hemann, Seton Hall University, USA João Saraiva, Universidade do Minho, Portugal Jurriaan Hage, Heriot-Watt University, UK Kenichi Asai, Ochanomizu University, Japan Maja Kirkeby, Roskilde University, Denmark Marco Morazán, Seton Hall University, USA Neil Mitchell, Facebook, UK Ralf Laemmel, University of Koblenz Landau, Germany Rinus Plasmeijer, TOP Software/Radboud University, The Netherlands Stephen Chang, UMass Boston, USA Tim Steenvoorden, Open University, The Netherlands Tom Schrijvers, KU Leuven, Belgium Yusuf Moosa Motara, Rhodes University, South Africa ### Venue IFL 2024 will be held physically in Nijmegen, the Netherlands. See the website for more information. https://ifl24.cs.ru.nl ### 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

Haskell Implementors' Workshop - Change of date
by Matthew Pickering 29 Jul '24

29 Jul '24

This year the decision has been taken to combine together Haskell Implementors' Workshop and Haskell Symposium. Therefore the workshop will now take place on the dates September 6/7 (the dates of the Haskell Symposium). Please email me if you have any questions. Cheers, Matt

1 0

[ANN] streamly-0.10 with fast binary serialization
by Harendra Kumar 29 Jul '24

29 Jul '24

Streamly is a concurrent stream and array library supporting a wide range of functionality. Important features in the new release include: (1) fast binary serialization to arrays with an option to serialize record field names; (2) the array type can now represent pinned as well unpinned memory, unifying the representations used by bytestring, text and vector; and (3) concurrency support for folds. For more details, see this post: https://blog.composewell.com/v0/posts/streamly-release-0.10.0.html . -harendra

1 0

Call for Participation, Functional Software Architecture (Sep 6, Milan)
by Michael Sperber 29 Jul '24

29 Jul '24

====================================================================== *** FUNARCH 2024 -- CALL FOR PARTICIPATION *** The Second ACM SIGPLAN Workshop on Functional Software Architecture - FP in the Large 6th September 2024, Milan, Italy Co-located with ICFP 2024 https://www.functional-architecture.org/events/funarch-2024/ ====================================================================== BACKGROUND: The ACM SIGPLAN Workshop on Functional Software Architecture - FP in the Large aims to disseminate and enable the use of functional programming in the large and long-lived software projects. We specifically want: - To assemble a community interested in software architecture techniques and technologies specific to functional programming; - To identify, categorize, and document topics relevant to the field of functional software architecture; - To connect the functional programming community to the software architecture community to cross-pollinate between the two. We'd love for you to be part of this effort. Whatever your background, you're welcome at FUNARCH - to listen to talks, report on your experience, and interact with others that share our goals. See you at FUNARCH! REGISTRATION: You can register for the workshop via the registration page for the ICFP conference, but there's no need to also register for the conference. Reduced fees are available until 5th August. http://icfp24.sigplan.org/attending/registration KEYNOTE: Architecting Functional Programs Marco Sampellegrini ACCEPTED SUBMISSIONS: F3: A Compiler For Feature Engineering Weixi Ma, Arnaud Venet, Junhua Gu, Subbu Subramanian, Siyu Wang, Rocky Liu (Meta) Daniel Friedman, Yafei Yang (Indiana University) Design and implementation of a verified interpreter for additive manufacturing programs Matthew Sottile, Mohit Tekriwal (Lawrence Livermore National Laboratory) Applying Continuous Formal Methods to Cardano James Chapman, Arnaud Bailly, Polina Vinogradova (IOHK) Continuations: what have they ever done for us? Marc Kaufmann (Austriae Central European University), Bogdan Popa Bidirectional Data Transformations Marcus Crestani, Markus Schlegel, Marco Schneider (Active Group) PROGRAM CHAIRS: Mike Sperber (Active Group, Germany) Perdita Stevens (University of Edinburgh, UK) PROGRAM COMMITTEE: Annette Bieniusa (University of Kaiserslautern) Jeffrey Young (IOG) Will Crichton (Brown University) Isabella Stilkerich (Schaeffler Technologies AG) Kiko Fernandez-Reyes (Ericsson) Ryan Scott (Galois) Satnam Singh (Groq) Facundo Dominguez (Tweag) Ilya Sergey (University of Singapore) Martin Elsman (University of Copenhagen) Benjamin Pierce (University of Pennsylvania) Matthew Flatt (University of Utah) Nada Amin (Harvard University) Richard Eisenberg (Jane Street) WORKSHOP VENUE: The workshop will be co-located with the ICFP 2024 conference at the Milano Convention Centre, Milan, Italy. ======================================================================

1 0

Functional Conf 2024 - Bengaluru, India
by John Sinclair 26 Jul '24

26 Jul '24

===================================================================== Call for Proposals Functional Conf 2024 21-23 November Bengaluru, India https://functionalconf.com <https://igafnl.com/click?redirect=https%3A%2F%2Ffunctionalconf.com&dID=1721…> ===================================================================== You are invited to join us for 3 days in-person for Functional Conf, Asia's Premier Functional Programming Conference. Immerse yourself in thought-provoking sessions led by top-notch speakers, engage in hands-on workshops to elevate your coding skills, and network with like-minded professionals. Whether you’re a seasoned pro or a curious beginner, this conference promises to ignite your passion for Functional Programming and revolutionize the way you approach software development. Don’t miss out on this exciting opportunity to be a part of the future of technology. *Call for Proposals is currently open* The stage is set for you to showcase your expertise at our upcoming event through our Call for Proposals. Whether you’re eager to deliver a captivating talk, lead a dynamic demonstration, present a compelling case study, offer an insightful tutorial, share an experience report, or facilitate an engaging workshop of Functional Programming in action, we welcome your submissions with open arms. * Submit a Proposal (deadline: 1 September 2024) https://confengine.com/conferences/functional-conf-2024/proposals <https://igafnl.com/click?redirect=https%3A%2F%2Fconfengine.com%2Fconference…> * Registration: https://confengine.com/conferences/functional-conf-2024/register/selection <https://igafnl.com/click?redirect=https%3A%2F%2Fconfengine.com%2Fconference…> Early bird tickets still available! We hope to see you there!

1 0

Strange kind error when using Lens.traverseOf
by Henning Thielemann 23 Jul '24

23 Jul '24

I have this simplified module: module Ganeti.LensPlain where import Control.Lens (LensLike, traverseOf) import Data.Functor.Compose (Compose(..)) traverseOf2 :: LensLike (Compose f g) s t a b -> (a -> f (g b)) -> s -> f (g t) traverseOf2 k f = getCompose . traverseOf k (Compose . f) With ghc-9.2 and later I get this kind error: src/Ganeti/LensPlain.hs:8:32: error: [GHC-25897] • Couldn't match kind ‘k2’ with ‘*’ When matching types Compose f g0 :: * -> * Compose f g :: k2 -> * Expected: s -> Compose f g t Actual: s -> Compose f g0 t0 ‘k2’ is a rigid type variable bound by the type signature for: traverseOf2 :: forall {k1} {k2} (f :: k1 -> *) (g :: k2 -> k1) s (t :: k2) a (b :: k2). LensLike (Compose f g) s t a b -> (a -> f (g b)) -> s -> f (g t) at src/Ganeti/LensPlain.hs:7:1-79 • In the second argument of ‘(.)’, namely ‘traverseOf k (Compose . f)’ In the expression: getCompose . traverseOf k (Compose . f) In an equation for ‘traverseOf2’: traverseOf2 k f = getCompose . traverseOf k (Compose . f) • Relevant bindings include f :: a -> f (g b) (bound at src/Ganeti/LensPlain.hs:8:15) k :: LensLike (Compose f g) s t a b (bound at src/Ganeti/LensPlain.hs:8:13) traverseOf2 :: LensLike (Compose f g) s t a b -> (a -> f (g b)) -> s -> f (g t) (bound at src/Ganeti/LensPlain.hs:8:1) | 8 | traverseOf2 k f = getCompose . traverseOf k (Compose . f) | ^^^^^^^^^^^^^^^^^^^^^^^^^^ GHC-9.0 accepts the code. Also GHC-9.2 accepts it when the module is compiled as part of a larger Cabal project! I thought that (.) would cause the problem, but manually inlining it does not help. I compiled with: $ ghc-9.6.6 -package lens -c src/Ganeti/LensPlain.hs

2 2

ICFP 2024: Call for Participation
by ICFP Publicity 22 Jul '24

22 Jul '24

===================================================================== Call for Participation The 29th ACM SIGPLAN International Conference on Functional Programming (ICFP 2024) and affiliated events https://icfp24.sigplan.org Milan, Italy; Sep 2-7, 2024 ===================================================================== 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. You are invited to participate in a full week dedicated to functional programming, featuring the ICFP main conference as well as several other related events. * Accepted Papers: https://icfp24.sigplan.org/track/icfp-2024-papers#event-overview * Registration: https://icfp24.sigplan.org/attending/registration The early-bird deadline is August 3, 2024 * Venue: Allianz MiCo (Milano Convention Centre) https://icfp24.sigplan.org/venue/icfp-2024-venue There are several events affiliated with ICFP: September 2 HOPE - https://icfp24.sigplan.org/home/hope-2024 PLMW - https://icfp24.sigplan.org/home/PLMW-ICFP-2024 HIW - https://icfp24.sigplan.org/home/hiw-2024 Erlang - https://icfp24.sigplan.org/home/erlang-2024 FARM - https://icfp24.sigplan.org/home/farm-2024 September 3-5 ICFP - Main conference September 6 Tutorials (Sep 6-7) - https://icfp24.sigplan.org/track/icfp-2024-tutorials FProPer - https://icfp24.sigplan.org/home/fproper-2024 ML - https://icfp24.sigplan.org/home/mlworkshop-2024 Haskell (Sep 6-7) - https://icfp24.sigplan.org/home/haskellsymp-2024 TyDe - https://icfp24.sigplan.org/home/tyde-2024 miniKanren - https://icfp24.sigplan.org/home/minikanren-2024 FUNARCH - https://icfp24.sigplan.org/home/funarch-2024 September 7 Tutorials (Sep 6-7) - https://icfp24.sigplan.org/track/icfp-2024-tutorials Scheme - https://icfp24.sigplan.org/home/scheme-2024 OCaml - https://icfp24.sigplan.org/home/ocaml-2024 Haskell (Sep 6-7) - https://icfp24.sigplan.org/home/haskellsymp-2024 Conference organizers: https://icfp24.sigplan.org/committee/icfp-2024-organizing-committee =====================================================================

1 0

POPL 2025: Final Call for Workshops and Co-located Events (July 26 AOE)
by Ningning Xie 19 Jul '24

19 Jul '24

FINAL CALL FOR WORKSHOPS AND CO-LOCATED EVENTS POPL 2025 52nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Sun 19 - Sat 25, January 2025 Denver, Colorado, United States https://popl25.sigplan.org The 52nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2025) will be held in Denver, Colorado, United States. POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Events focusing on experimental and theoretical topics are welcome. Proposals are invited for workshops and other events to be co-located with POPL 2025. All co-located events are sponsored by SIGPLAN ( http://acm.org/sigplan/) Workshops should be more informal and focused than POPL itself, and include sessions that enable interaction among the workshop attendees. The preference is for one-day workshops, but other schedules can also be considered. --------------------------------------------------------------------- Submission details Deadline for submission: 26 July 2024 Notification of acceptance: 2 August 2024 A workshop proposal should provide the following information: * Name of the workshop. * Duration of the workshop. * Whether the workshop will be Conference-approved or SIGPLAN-approved (see below). * Organizers: names, affiliation, contact information, brief (100 words) biography. * A short description (150-200 words) of the topic. * Event format: workshop; type of submissions if any; review process; results dissemination. * Expected attendance and target audience. * Potential PC members - please do not contact them before the workshop is approved. * History of the workshop. * Plans for remote participation Proposals must be submitted in PDF form by email with the subject POPL 2025 Workshop Proposal: [workshop name], to the workshop co-chairs: Christoph Matheja (chmat(a)dtu.dk) and Robert Rand (rand(a)uchicago.edu) --------------------------------------------------------------------- SIGPLAN Sponsorship POPL co-located events are sponsored by SIGPLAN (http://sigplan.org/) There are two kinds of co-located events: Conference-approved (no proceedings) and SIGPLAN-approved (proceedings in the ACM Digital Library). See http://www.sigplan.org/Resources/Guidelines/Workshops/ for more information, including a full listing of prescriptions for Conference-approved and SIGPLAN-approved workshops. SIGPLAN-approved workshops must respect the SIGPLAN Diversity Policy. Proposals for SIGPLAN-approved workshops must additionally include the gender, country of affiliation, and professional status of potential PC members. See https://www.sigplan.org/Resources/Policies/Diversity/ for more details. --------------------------------------------------------------------- Selection committee All submissions will be evaluated by a committee comprising the workshops co-chairs, the general chair, and the program chair. --------------------------------------------------------------------- Further information Any questions regarding POPL 2025 co-located event proposals should be addressed to the workshops chairs Christoph Matheja (chmat(a)dtu.dk) and Robert Rand (rand(a)uchicago.edu)

1 0

Call for Papers: Scheme ‘24 (extended deadline: July 25th)
by Kristopher K Micinski 15 Jul '24

15 Jul '24

-------------------------------------------------------------------------------- CALL FOR PAPERS The 2024 Workshop on Scheme and Functional Programming Co-located with ICFP 2024 (Milan, Italy) https://icfp24.sigplan.org/home/scheme-2024 -------------------------------------------------------------------------------- The 2024 Scheme and Functional Programming Workshop is calling for submissions. We invite high-quality papers and talk proposals about novel research results, lessons learned from practical experience in an industrial or educational setting, and even new insights on old ideas. We welcome and encourage submissions that apply to any dynamic functional language, especially those that can be considered a Scheme: from strict subsets of RnRS to other "Scheme" implementations, to Racket, to Lisp dialects including Clojure, Emacs Lisp, Common Lisp, to functional languages with continuations and/or macros (or extended to have them) such as Dylan, ECMAScript, Hop, Lua, Scala, Rust, etc. The elegance of the paper and the relevance of its topic to the interests of Schemers will matter more than the surface syntax of the examples used. * Topics Topics of interest include (but are not limited to): - Interaction: program-development environments, debugging, testing, refactoring - Implementation: interpreters, compilers, tools, garbage collectors, benchmarks - Extension: macros, hygiene, domain-specific languages, reflection, and how such extension affects interaction - Expression: control, modularity, ad hoc and parametric polymorphism, types, aspects, ownership models, concurrency, distribution, parallelism, non-determinism, probabilism, and other programming paradigms - Integration: build tools, deployment, interoperation with other languages and systems - Formal semantics: theory, analyses and transformations, partial evaluation - Human factors: past, present and future history, evolution and sociology of the language Scheme, its standard and its dialects - Education: approaches, experiences, curricula - Applications: industrial uses of Scheme - Scheme pearls: elegant, instructive uses of Scheme * Dates - Submission deadline is Thursday July 25, 2024 (extended). - Authors will be notified by Monday August 12, 2024. - Camera-ready versions are due Thursday August 29, 2024. - Workshop will be held in Milan, Italy on Saturday September 7, 2024. All deadlines are 23:59 UTC-12, anywhere on Earth. * Submission Information We encourage all kinds of submissions, including full papers, experience reports, and lightning talks. Papers and experience reports are expected to be 10–24 pages in length using the single-column SIGPLAN acmart style. (For reference, this is about 5–12 pages of the older SIGPLAN 2-column 9pt style.) Abstracts submitted for lightning talks should be limited to 192 words. 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. The size limits above exclude references and any optional appendices. There are no size limits on appendices, but the papers should stand without the need to read them, and reviewers are not required to read them. Authors are encouraged to publish any code associated to their papers under an open source license, so that reviewers may try the code and verify the claims. Proceedings will be uploaded to arXiv.org (https://arXiv.org/) Publication of a paper at this workshop is not intended to replace conference or journal publication, and does not preclude re-publication of a more complete or finished version of the paper at some later conference or in a journal. Please submit papers through the workshop's HotCRP site (https://scheme2024.hotcrp.com/) * Lightweight double-blind reviewing Scheme 2024 will use lightweight double-blind reviewing. Submitted papers must omit author names and institutions and reference the authors’ own related work in the third person (e.g., not “we build on our previous work…” but rather “we build on the work of…”). The purpose is to help the reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). * Formatting Information Full papers and experience reports should use the SIGPLAN acmsmall option to acmart. We recommend using the anonymous and review options to acmart when submitting a paper; these options hide the author names and enable line numbers for easy reference in review. LaTeX and Microsoft Word templates for this format are available through SIGPLAN (https://www.sigplan.org/Resources/Author/) Lightning talks can be submitted as either a text file or a PDF file. * Workshop Organization Organizing Committee: Kristopher Micinski (Syracuse University, United States) Youyou Cong (Tokyo Institute of Technology, Japan) Program Committee: Julia Belyakova (Purdue University, United States) Kimball Germane (Brigham Young University, United States) Yuki Nishida (Tohoku University, Japan) Gabriel Scherer (Inria Saclay, France) Philipp Schuster (University of Tübingen, Germany) Taro Sekiyama (National Institute of Informatice, Japan) Michael Sperber (Active Group GmbH, Germany)

1 0

Taking over maintenance of hsndfile package
by Tristan Cacqueray 10 Jul '24

10 Jul '24

Hello, I would like to take over the hsndfile package maintenance: https://hackage.haskell.org/package/hsndfile … to merge the following fix and improvement: https://github.com/kaoskorobase/hsndfile/pull/24 https://github.com/kaoskorobase/hsndfile/pull/25 The current maintainer seems inactive on GitHub and not responsive to my direct mail on June 7. So if that's ok with you, I'd like to make a new release with the above changes. I'd be happy to handle further maintenance if needed. Thanks, -Tristan

1 0

Perl Regular Expressions
by Henning Thielemann 09 Jul '24

09 Jul '24

There is an overview page for regular expression libraries in Haskell. [1] However, the last substantial update is from 2014. It seems that regex-pcre was quite popular, but it binds to the C library libpcre which is being phased out in favor of pcre2. There are bindings to pcre2 in the Hackage package pcre2, but there seems to be unresolved low-level problems. [2] I am looking for a package where speed is not top priority, but compatibility to libpcre regular expressions. I think a plain Haskell package would increase the chances of absence of memory bugs and interfacing issues. According to the Wiki page Haskell-only implementations seem to prefer Posix expressions over Perl ones. [1] https://wiki.haskell.org/Regular_expressions [2] https://github.com/sjshuck/hs-pcre2/issues/34

1 0

Call for Talks: Haskell Implementors' Workshop 2024
by Matthew Pickering 08 Jul '24

08 Jul '24

``` ACM SIGPLAN Haskell Implementors' Workshop https://icfp24.sigplan.org/home/hiw-2024 Milan, Italy, September 2, 2024 Co-located with ICFP 2024 https://icfp24.sigplan.org/ ``` ## Important dates * Deadline: July 19, 2024 (AoE) * Notification: August 2, 2024 * Workshop: September 2, 2024 The 16th Haskell Implementors’ Workshop is to be held alongside ICFP 2024 this year in Milan. It is a forum for people involved in the design and development of Haskell implementations, tools, libraries, and supporting infrastructure to share their work and to discuss future directions and collaborations with others. Talks and/or demos are proposed by submitting an abstract, and selected by a small program committee. There will be no published proceedings. The workshop will be informal and interactive, with open spaces in the timetable and room for ad-hoc discussion, demos, and lightning talks. ## Scope and Target Audience It is important to distinguish the Haskell Implementors’ Workshop from the Haskell Symposium which is also co-located with ICFP 2024. The Haskell Symposium is for the publication of Haskell-related research. In contrast, the Haskell Implementors’ Workshop will have no proceedings – although we will aim to make talk videos, slides, and presented data available with the consent of the speakers. The Implementors’ Workshop is an ideal place to describe a Haskell extension, describe works-in-progress, demo a new Haskell-related tool, or even propose future lines of Haskell development. Members of the wider Haskell community are encouraged to attend the workshop – we need your feedback to keep the Haskell ecosystem thriving. Students working with Haskell are especially encouraged to share their work. The scope covers any of the following topics. There may be some topics that people feel we’ve missed, so by all means submit a proposal even if it doesn’t fit exactly into one of these buckets: * Compilation techniques * Language features and extensions * Type system implementation * Concurrency and parallelism: language design and implementation * Performance, optimization and benchmarking * Virtual machines and run-time systems * Libraries and tools for development or deployment ## Talks We invite proposals from potential speakers for talks and demonstrations. We are aiming for 20-minute talks with 5 minutes for questions and changeovers. We want to hear from people writing compilers, tools, or libraries, people with cool ideas for directions in which we should take the platform, proposals for new features to be implemented, and half-baked crazy ideas. Please submit a talk title and abstract of no more than 300 words. Submissions can be made via HotCRP at https://hiw2024.hotcrp.com until July 19 (anywhere on earth). We will also have a lightning talks session. These have been very well received in recent years, and we aim to increase the time available to them. Lightning talks should be ~7mins and are scheduled on the day of the workshop. Suggested topics for lightning talks are to present a single idea, a work-in-progress project, a problem to intrigue and perplex Haskell implementors, or simply to ask for feedback and collaborators. ## Program Committee * Matthew Pickering (Well-Typed LLP) * David Binder (University of Tübingen) * Gabriella Gonzalez (Mercury) * Sylvain Henry (IOG) * Teofil Camarasu (Tracsis) ## Contact * Matthew Pickering

1 1

a tribute to Haskell Curry
by Mark McConnell 07 Jul '24

07 Jul '24

Haskell Curry was a professor for 37 years at the Pennsylvania State University. Curry Hall is a dormitory named after him. On a recent visit to Penn State, my laptop asked me to help it take a selfie.

1 0

[ANN] cabal-install-3.12.1.0 (and accompanying libraries) released
by Artem Pelenitsyn 06 Jul '24

06 Jul '24

Dear all, The cabal release team brings you the release of the cabal-install tool, version 3.12.1.0. This is the first release of the tool in the 3.12 series, and, hence, the first cabal-install supporting Cabal 3.12 packaged with GHC 9.10.1. We also update the three main libraries. - cabal-install: The command-line interface for Cabal and Hackage. <https://hackage.haskell.org/package/cabal-install-3.12.1.0> - Cabal: A framework for packaging Haskell software <https://hackage.haskell.org/package/Cabal-3.12.1.0> - Cabal-syntax: A library for working with .cabal files <https://hackage.haskell.org/package/Cabal-syntax-3.12.1.0> - cabal-install-solver: The command-line interface for Cabal and Hackage. <https://hackage.haskell.org/package/cabal-install-solver-3.12.1.0> The binaries for cabal-install are available on our website <https://downloads.haskell.org/cabal/cabal-install-3.12.1.0/> and can be installed via GHCup manually, e.g.: - Linux x86_64 (static, alpine3_18): ghcup --no-cache install cabal -u 'https://downloads.haskell.org/cabal/cabal-install-3.12.1.0/cabal-install-3.…' 3.12.1.0 - MacOS AArch64: ghcup --no-cache install cabal -u 'https://downloads.haskell.org/cabal/cabal-install-3.12.1.0/cabal-install-3.…' 3.12.1.0 - Windows: ghcup --no-cache install cabal -u 'https://downloads.haskell.org/cabal/cabal-install-3.12.1.0/cabal-install-3.…' 3.12.1.0 - or a similar command for your platform using the binaries provided on the website - as usual, cabal update && cabal install cabal-install-3.12.1.0 is an option too. We expect the official GHCup channel to be updated with the 3.12.1.0 binaries soon. <https://discourse.haskell.org/t/cabal-install-3-12-1-0-and-accompanying-lib…>What is new *Performance* - Significant speedups during cabal startup due to use of the latest tar *Project Organization* - Support for asm, cmm, and js sources in executable components - Support for per-component builds when coverage is enabled - Haskell files in explicit source directories take precedence over autogenerated Haskell files - Fix precedence for PATH for build-tools-depends (executables from PATH don’t shadow executables from build-tool-depends anymore) *UX* - Errors now have error codes, which will be documented on https://errors.haskell.org - A new subcommand, cabal path, which can be used to get information about the paths cabal will use within a project - Support for authentication tokens for uploading to Hackage - --(test-)show-details=direct is now the default - Shorten solver rejection messages by removing repetition - Show provenance of project constraints *Interaction with GHC* - Support for loading multiple components into one repl session - Support for the --semaphore flag to enable interaction with GHC Job Server protocol - Support for GHC2024 - Support for language extensions ExtendedLiterals¸ ListTuplePuns, and TypeAbstractions *Other Compilers* - Micro Haskell (MHS) has been added as a known compiler. We don’t have support for driving it yet, though. See the release notes <https://github.com/haskell/cabal/blob/master/release-notes/cabal-install-3.…> for more details and other changes. <https://discourse.haskell.org/t/cabal-install-3-12-1-0-and-accompanying-lib…> Contributors 50^2, Adam Gundry, Andrea Bedini, Andreas Abel, Andreas Klebinger, Arjun Kathuria, Artem Pelenitsyn, BasLaa, Bas Laarakker, Ben Gamari, Bodigrim, Brandon Chinn, brandon s allbery kf8nh, Bryan Richter, Colton Clemmer, Csaba Hruska, cydparser, Daniel Trstenjak, David Binder, David Christiansen, Edwin Marshall, Elodie Lander, Erik de Castro Lopo, Felix Yan, fendor, Finley, Francesco Ariis, Francesco Gazzetta, Fraser Tweedale, Gershom Bazerman, Hamish Mackenzie, Hécate Moonlight, Ikko Eltociear Ashimine, Jana Chadt, Javier Sagredo, Jean-Paul Calderone, Jens Petersen, Jessica Hamilton, John Paul Adrian Glaubitz, Josh Meredith, Julia Longtin, Julian Ospald, Kazuki Okamoto, Kristen Kozak, Krzysztof Gogolewski, liamzee, Liisi Kerik, Lin Runze, Malte Neuss, malteneuss, Marcin Szamotulski, Matthew Pickering, Mel Zuser, Michael Peyton Jones, Mike Pilgrem, Mikolaj Konarski, mixphix, Oleg Grenrus, Ondřej Šebek, Patrick Augusto, Patrick Dougherty, Peter Becich, Phil de Joux, Pierre Le Marre, Rebecca Turner, Rodrigo Mesquita, Ryan Scott, Samuel Thibault, Sander, Sebastian Tee, Sergey Vinokurov, Shae Erisson, sheaf, Simon Hengel, Siyuan Chen, Sören Tempel, SuganyaAK, Suganya Raju, Sylvain Henry, Taylor Fausak, Teo Camarasu, Tom Ellis, tomjaguarpaw, Tommy Bidne, Tom Smeding, Torsten Schmits, Tristan Cacqueray, Troels Henriksen, Wismill, Yvan Sraka, Zoe Zuser We thank all contributors as well as our reviewers, QA testers, devops, and others without whom this release wouldn’t be possible. <https://discourse.haskell.org/t/cabal-install-3-12-1-0-and-accompanying-lib…> Feedback Please, report any issues you notice with the 3.12.1.0 release on our GitHub: https://github.com/haskell/cabal — cabal release team (Artem, Brandon, Francesco, Gershom, Hécate, Mikołaj)

4 4

2 optimization bugs ?
by George Colpitts 03 Jul '24

03 Jul '24

It seems like I have found two optimization bugs. Before filing bugs , I wanted to double check if others agreed and can reproduce the bugs. Compile and run the attached file: ghc -O2 optBugs.hs Loaded package environment from /Users/avie/.ghc/aarch64-darwin-9.10.1/environments/default [1 of 2] Compiling Main ( optBugs.hs, optBugs.o ) optBugs.hs:45:49: warning: [GHC-18042] [-Wtype-defaults] • Defaulting the type variable ‘b0’ to type ‘Integer’ in the following constraints (Integral b0) arising from a use of ‘^’ at optBugs.hs:45:49 (Num b0) arising from the literal ‘6’ at optBugs.hs:45:50 • In the first argument of ‘counts’, namely ‘(10 ^ 6)’ In the second argument of ‘(.)’, namely ‘counts (10 ^ 6)’ In the second argument of ‘(.)’, namely ‘elems . counts (10 ^ 6)’ | 45 | solve = product . map (+ 1) . elems . counts (10^6) -- 1000000 | ^ [2 of 2] Linking optBugs avie@Anabela-Air Documents % ./optBugs +RTS -s ./optBugs +RTS -s 39001250856960000 2,932,564,768 bytes allocated in the heap 143,405,696 bytes copied during GC 76,022,072 bytes maximum residency (4 sample(s)) 11,034,312 bytes maximum slop 164 MiB total memory in use (0 MiB lost due to fragmentation) Tot time (elapsed) Avg pause Max pause Gen 0 263 colls, 0 par 0.032s 0.036s 0.0001s 0.0020s Gen 1 4 colls, 0 par 0.048s 0.060s 0.0150s 0.0368s INIT time 0.003s ( 0.003s elapsed) MUT time 3.343s ( 3.333s elapsed) GC time 0.080s ( 0.096s elapsed) EXIT time 0.002s ( 0.008s elapsed) Total time 3.428s ( 3.440s elapsed) %GC time 0.0% (0.0% elapsed) Alloc rate 877,099,801 bytes per MUT second Productivity 97.5% of total user, 96.9% of total elapsed Now change the line solve = product . map (+ 1) . elems . counts (10^6) -- 1000000 to solve = product . map (+ 1) . elems . counts 1000000 save the file to disk, compile and rerun: ghc -O2 optBugs.hs Loaded package environment from /Users/avie/.ghc/aarch64-darwin-9.10.1/environments/default [1 of 2] Compiling Main ( optBugs.hs, optBugs.o ) [Source file changed] [2 of 2] Linking optBugs [Objects changed] avie@Anabela-Air Documents % ./optBugs +RTS -s ./optBugs +RTS -s 39001250856960000 1,920,053,000 bytes allocated in the heap 16,488 bytes copied during GC 8,028,224 bytes maximum residency (2 sample(s)) 393,152 bytes maximum slop 22 MiB total memory in use (0 MiB lost due to fragmentation) Tot time (elapsed) Avg pause Max pause Gen 0 239 colls, 0 par 0.000s 0.001s 0.0000s 0.0002s Gen 1 2 colls, 0 par 0.000s 0.001s 0.0007s 0.0011s INIT time 0.003s ( 0.003s elapsed) MUT time 2.011s ( 2.015s elapsed) GC time 0.001s ( 0.002s elapsed) EXIT time 0.000s ( 0.007s elapsed) Total time 2.015s ( 2.027s elapsed) %GC time 0.0% (0.0% elapsed) Alloc rate 954,738,679 bytes per MUT second Productivity 99.8% of total user, 99.4% of total elapsed Allocation decreased by a billion bytes and runtime has decreased by almost a third. This is hard to believe. The obvious explanation is that I dropped a zero when I wrote out 10^6 but I checked that I have six zeros. Also I get the same answer in both cases. Next uncomment the following two lines in factor: -- let p = sm ! m -- sm = smallest maxN and comment out the line: let p = smallest maxN ! m save the file, compile and rerun: ghc -O2 optBugs.hs Loaded package environment from /Users/avie/.ghc/aarch64-darwin-9.10.1/environments/default [1 of 2] Compiling Main ( optBugs.hs, optBugs.o ) [Source file changed] [2 of 2] Linking optBugs [Objects changed] avie@Anabela-Air Documents % ./optBugs +RTS -s ./optBugs +RTS -s 39001250856960000 16,051,152 bytes allocated in the heap 10,040 bytes copied during GC 44,328 bytes maximum residency (1 sample(s)) 29,400 bytes maximum slop 22 MiB total memory in use (0 MiB lost due to fragmentation) Tot time (elapsed) Avg pause Max pause Gen 0 2 colls, 0 par 0.000s 0.000s 0.0001s 0.0002s Gen 1 1 colls, 0 par 0.000s 0.001s 0.0015s 0.0015s INIT time 0.003s ( 0.003s elapsed) MUT time 0.019s ( 0.018s elapsed) GC time 0.000s ( 0.002s elapsed) EXIT time 0.001s ( 0.002s elapsed) Total time 0.023s ( 0.025s elapsed) %GC time 0.0% (0.0% elapsed) Alloc rate 866,786,478 bytes per MUT second Productivity 78.9% of total user, 72.5% of total elapsed Allocation has dropped from 2 billion bytes to 16 million and runtime has dropped from 2 seconds to 0.02 seconds. I think the optimizer should move the call to smallest outside of the "loop" in go. This seems like a bug to me.

2 2

IFL 2024: Second Call for Papers
by Mart Lubbers 03 Jul '24

03 Jul '24

======================================================================= IFL 2024 36rd Symposium on Implementation and Application of Functional Languages venue: Radboud University Nijmegen, The Netherlands August 26 - 28 2024 https://ifl24.cs.ru.nl ======================================================================= ### 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 2024 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. ### Industrial track and topics of interest Topics of interest to IFL include, but are not limited to: - language concepts - type systems, type checking, type inferencing - compilation techniques - staged compilation - run-time function specialisation - run-time code generation - partial evaluation - (abstract) interpretation - meta-programming - generic programming - automatic program generation - array processing - concurrent/parallel programming - concurrent/parallel program execution - embedded systems - web applications - (embedded) domain specific languages - security - novel memory management techniques - run-time profiling performance measurements - debugging and tracing - virtual/abstract machine architectures - validation, verification of functional programs - tools and programming techniques ### Peer-review process Following IFL tradition, IFL 2024 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers will be screened by the program chairs to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. After the symposium, a formal review process will take place, conducted by the program committee. Reviewing is single blind. There will be at least 3 reviews per paper. The reviewers have 6 weeks to write their reviews. For the camera-ready version the authors can make minor revisions which are accepted without further reviewing. ### Important dates Submission deadline of draft papers August 4th, 2024 Notification of acceptance for presentation August 6th, 2024 Early registration deadline August 11th, 2024 Late registration deadline August 21th, 2024 IFL symposium August 26-28, 2024 Submission of papers for proceedings December 1st, 2024 Notification of acceptance February 2nd, 2025 Camera-ready version March 2nd, 2025 ### Submission details and Registration All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template Submit your paper here: https://easychair.org/conferences/?conf=ifl20240 Registration https://ifl24.cs.ru.nl/Registration ### 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: Mart Lubbers Radboud University, The Netherlands Local Chairs: Peter Achten Radboud University, The Netherlands Sven-Bodo Scholz, Radboud University, The Netherlands ### Program committee: Benoît Montagu, University of Lorraine, Inria, France Christos Dimoulas, Northwestern University, USA Edsko de Vries, Well-typed, The Netherlands Fritz Henglein, University of Copenhagen, Denmark Ian Mackie, University of Sussex, UK Jason Hemann, Seton Hall University, USA João Saraiva, Universidade do Minho, Portugal Jurriaan Hage, Heriot-Watt University, UK Kenichi Asai, Ochanomizu University, Japan Maja Kirkeby, Roskilde University, Denmark Marco Morazán, Seton Hall University, USA Neil Mitchell, Facebook, UK Ralf Laemmel, University of Koblenz Landau, Germany Rinus Plasmeijer, TOP Software/Radboud University, The Netherlands Stephen Chang, UMass Boston, USA Tim Steenvoorden, Open University, The Netherlands Tom Schrijvers, KU Leuven, Belgium Yusuf Moosa Motara, Rhodes University, South Africa ### Venue IFL 2024 will be held physically in Nijmegen, the Netherlands. See the website for more information. https://ifl24.cs.ru.nl ### 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

[ANNOUNCE] GHC 9.6.6 is now available
by Zubin Duggal 01 Jul '24

01 Jul '24

The GHC developers are happy to announce the availability of GHC 9.6.6. Binary distributions, source distributions, and documentation are available on the [release page](https://www.haskell.org/ghc/download_ghc_9_6_6.html). Blog Post: https://www.haskell.org/ghc/blog/20240701-ghc-9.6.6-released.html This release is primarily a bugfix release addressing some issues found in the 9.6 series. These include: * A fix for a bug in the NCG that could lead to incorrect runtime results due to erroneously removing a jump instruction (#24507). * A fix for a linker error that manifested on certain platform/toolchain combinations, particularly darwin with a brew provisioned toolchain, arising due to a confusion in linker options between GHC and cabal (#22210). * A fix for a compiler panic in the simplifier due to incorrect eta expansion (#24718). * A fix for possible segfaults when using the bytecode interpreter due to incorrect constructor tagging (#24870). * And a few more fixes A full accounting of changes can be found in the [release notes]. As some of the fixed issues do affect correctness users are encouraged to upgrade promptly. We would like to thank Microsoft Azure, GitHub, IOG, the Zw3rk stake pool, Well-Typed, Tweag I/O, Serokell, Equinix, SimSpace, 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. Happy Hacking! -Zubin [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new [release notes]: https://downloads.haskell.org/~ghc/9.6.6/docs/users_guide/9.6.6-notes.html

1 0

ICFP 2024: Call fo Volunteers
by ICFP Publicity 26 Jun '24

26 Jun '24

ICFP 2024: CALL FOR VOLUNTEERS Sign up to be a Volunteer and help us make ICFP 2024 a unique experience for all attendants! ICFP 2024 is pleased to offer a number of opportunities for volunteers, who are vital to the efficient operation and continued success of the conference each year. The volunteer program is a chance for people from around the world to participate in the conferences whilst assisting us in preparing and running the event. The Volunteer Program helps more people attend the ICFP conference by covering conference fees, including access to the banquet (but not travel or lodging expenses) in exchange for a fixed number of work hours (usually from 12 to 15) helping with the conference organization. How to apply: Please apply using this form: https://forms.gle/688UyUSRTfSGSCGF9 The deadline is *July 15th*. Eligibility: Everyone is welcome to apply. Priority is given to junior members of our community, e.g. full- or part-time students of computer science and related fields. Expectations: Applicants must be available for at least four (4) full days between September 2th and September 7th, 2024, and will be expected to provide a total of 12-15 hours of volunteering work in that time. The skills, talents, and dedication of our Volunteers contribute to the overall quality of the conference. The Volunteer role this year will mainly involve working with the organizers to prepare for the conference by providing technical assistance to attendees, managing online Q&A and poster sessions, and supporting active communication in our online environment. Compensation: * A Complimentary Conference Registration, offering access to all open sessions (i.e., parallel paper presentations, demonstrations, and workshops) and conference proceedings. * Free lunches and refreshments during breaks. * Volunteer garments. * Free admission to all social events. Please note that volunteers are responsible for their own travel and accommodation arrangements. If you need additional travel funding, please consider SIGPLAN PAC Funding and PLMW: * https://www.sigplan.org/PAC/ * https://icfp24.sigplan.org/home/PLMW-ICFP-2024

1 0

[Call for Participation]: Haskell Certification Program
by Jose Calderon 25 Jun '24

25 Jun '24

Serokell and the Haskell Foundation are excited to announce a community-led Haskell Certification Program (https://certification.haskell.foundation/) Serokell has developed an online testing platform for administering practical and theoretical Haskell problems. Haskell is a complex language, offering a wide range of techniques and features for programmers. It’s simply not feasible for a novice or intermediate programmer to master them all. The goal of the Haskell certification is to help standardize what it means to ‘know Haskell’ at various levels of experience. As a community driven effort, we are soliciting self-nomination for volunteers to take part in the organization and decision-making around the certification process. These volunteers will help determine how the certification process evolves and which questions are relevant to the various experience levels of a Haskell programmer. Volunteers from organizations that use Haskell professionally are especially welcome. Please send your self-nomination to certification(a)haskell.foundation by the end of July 10th 2024. Best wishes, Jose Calderon

7 9

SPLASH'24: Call for Volunteers
by Umar Farooq 24 Jun '24

24 Jun '24

======================================================================== Call for Volunteers The ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'24) October 20-25, 2024, Pasadena, California, United States https://2024.splashcon.org/track/splash-2024-Volunteers ======================================================================== ### Important dates Volunteer applications Deadline: Tue Jul 30, 2024 Notification of Acceptance: Wed Aug 7, 2024 Apply to be a Volunteer and help us make SPLASH 2024 a great experience for all attendants! SPLASH 2024 is pleased to offer a number of opportunities for volunteers, who are vital to the efficient operation and continued success of the conference each year. The volunteer program is a chance for students and Programming Languages researchers aspirants from around the world to participate in the conferences while assisting us in preparing and running the event. The Volunteer Program helps more people attend the SPLASH conference by covering conference fees, including access to the banquet (but not travel or lodging expenses), in exchange for a fixed number of work hours (usually from 12 to 15) helping with the conference organization. ### Eligibility criteria Everyone is welcome to apply. Priority is given to junior members of our community, e.g. full- or part-time students of computer science and related fields. ### Duration Applicants must be available for at least five (5) full days between October 20th and October 25th 2024, and will be expected to provide 12-15 hours of volunteering work in that time. Volunteers may also be expected to be available for some amount of pre-conference discussion and training if necessary. Volunteers from all timezones are welcome. ### About Volunteering The skills, talents, and dedication of our Volunteers contribute to the overall quality of the conference. The Volunteer role this year will mainly involve working with the organizers to prepare for the conference by providing technical assistance to attendees, managing online Q&A and poster sessions, and supporting active communication in our online environment. Volunteering allows you to meet other people (faculty and students) in the Programming Languages (PL) Community. With several opportunities for networking, you can share ideas about your research, find topics you are passionate about, investigate career paths, and even find your future collaborators! ### Compensation - A Complimentary Conference Registration, offering access to all open sessions (i.e., parallel paper presentations, demonstrations, and workshops) and conference proceedings. - Free lunches and refreshments during breaks. - Volunteer shirt. - Free admission to all social events.

1 0

PLMW@ICFP'24: Final call for Participation (travel funding application by June 21)
by Ningning Xie 17 Jun '24

17 Jun '24

APPLICATION FOR PLMW TRAVEL FUNDING For full consideration for scholarship funding, please apply at the link below by June 21, AoE. We will notify accepted attendees in a rolling fashion until all funding is committed. The application can be accessed at the following URL (Apply by June 21, 2024 AOE for full consideration!): https://forms.gle/vC6udnMWRvvAczPR6 —-------------------------------------------------------------- ACM SIGPLAN Programming Languages Mentoring Workshop (PLMW) at ICFP 24, Milan, Italy Workshop: Monday, September 2, 2024 Website: https://icfp24.sigplan.org/home/PLMW-ICFP-2024 PLMW is a workshop co-located with ICFP 2024 (the International Conference on Functional Programming) in Milan, Italy, from September 2-7. The purpose of this mentoring workshop is to encourage graduate students and senior undergraduate students to pursue careers in programming language research. This workshop will bring together world leaders in programming languages research and teaching from academia and industry to help students imagine how they might contribute to our research community. Topics will range from the abstract (e.g., what is PL research and how does one become involved in it) to the concrete (e.g., how to navigate an academic conference, how to pick a research area) as well as technical talks on cutting-edge topics. We especially encourage women and underrepresented minority students, and people with disabilities to attend PLMW. This workshop is part of the activities surrounding ICFP, and takes place the day before the main conference. One goal of the workshop is to make the ICFP conference more accessible to newcomers. We hope that participants will stay through the entire conference. Note that ICFP and PLMW are planned to be largely in-person events. While we recognize that travel to conferences is not easy for everyone, we do hope you will be able to join us in person to get the most out of the conference and its community-building aspects. A number of sponsors have generously donated scholarship funds for qualified students to attend PLMW. These scholarships can cover expenses (airfare, hotel, and registration fees) for attendance at both the workshop and the ICFP conference. Students attending this year will get one year free student membership of SIGPLAN, unless they prefer to opt out during their application. The workshop registration is open to all. Students with alternative sources of funding are welcome as well.

1 0

[ANN] csound-expression-5.4.4 - music and sound design framework
by Anton Kholomiov 16 Jun '24

16 Jun '24

I'd like to announce a new release of [csound-expression]( https://github.com/spell-music/csound-expression) on [hackage]( https://hackage.haskell.org/package/csound-expression) The CE is a music framework for haskell with focus on ease of use and feature rich as it rides on top of the powerful audio programming language Csound. It is a DSL to build Csound programs. So the library embeds Csound in Haskell. It's a bug fix release. Many algorithms in the low-level renderer csound-expression-dynamic were rewritten and fixed. In the previous version unfortunately there were severe bugs in effectful expressions and in if-then-else blocks. But now they are fixed. Also I've updated the library to include new Csound opcodes (audio processing units from 6.18 version). Happy music making with Haskell! About the future of the csound-expression: I've started the implementation of a more tiny csound-core package. It offers a missing layer of low-level building of type-safe Csound expressions. In the previous version I've created lots of abstractions to make music making more pleasant for FP style. But this layering makes it kind of hard to debug rendered code. So I'd like to create a tiny imperative style core that will allow me to debug produced Csound code. And the rest of the code should be expressed in terms of this library. I'm not there yet. I've built the core library and it turned out very well. But now I need to rewrite FP abstractions on top of it. I'm not there yet. But I hope that gradually I will make it. Also I plan to deprecate GUI features as FLTK was deprecated in Csound and it's not packaged with Csound anymore. I think maybe it would be better to substitute them with JS+OSC. github: https://github.com/spell-music/csound-expression hackage: https://hackage.haskell.org/package/csound-expression

1 0

Datakind and instance
by PICCA Frederic-Emmanuel 14 Jun '24

14 Jun '24

Hello, I have a class class HasIniConfig where getConfig ... a kind using DataKind data ProjectionType = TypeA | TypeB ... I would like to create instance for each 'TypeX But when I try to write an instance I get this error src/Hkl/Binoculars/Projections/QCustom.hs:195:23: error: • Expected a type, but ‘'QCustomProjection’ has kind ‘ProjectionType’ • In the first argument of ‘HasIniConfig’, namely ‘'QCustomProjection’ In the instance declaration for ‘HasIniConfig 'QCustomProjection’ | 195 | instance HasIniConfig 'QCustomProjection where | ^^^^^^^^^^^^^^^^^^ I should add class HasIniConfig (a :: ProjectionType) where But in that cas I can not create instance for other type, and I need to :) I would be glade if someone could explain how to all this. Thanks Frederic

2 2