- Haskell-Cafe - Haskell.org

IFL23 last Call for papers
by Pieter Koopman 28 Jul '23

28 Jul '23

Important Dates Draft Paper Submission Deadline 31st July, 2023 Notification of Acceptance for Presentation 1st August, 2023 Early Registration Deadline 11th August, 2023 Late Registration Deadline 23rd August, 2023 IFL Symposium 29th - 31st August, 2023 Submission of Papers for Peer-Reviewed Proceedings 24th November, 2023 Notification of Acceptance 2nd February, 2024 Camera-ready Version 8th March, 2024 SCOPE AND TOPICS 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. You can find more information about the symposium on its oficial website <https://ifl21-publicity-dot-yamm-track.appspot.com/29dDA6XwvedbWv4fOQOENw2-…>. IFL 2023 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. See the call for papers in text format <https://ifl21-publicity-dot-yamm-track.appspot.com/22-oQB0FEIVsa3YDKL7S2hh9…> . Areas of interest include, but are not limited to: - language concepts - type systems, type checking, type inferencing - compilation techniques - staged compilation - run-time function specialization - run-time code generation - partial evaluation - abstract interpretation - metaprogramming - 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 - industrial applications PAPER SUBMISSIONS Following IFL tradition, IFL 2023 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 chair 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. Notice that it is a requirement that accepted draft papers are presented physically at the symposium. After the symposium every presenter is invited to submit a full paper, incorporating feedback from discussions at the symposium. Work submitted to IFL may not be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy. The program committee will evaluate these submissions according to their correctness, novelty, originality, relevance, significance, and clarity, and will thereby determine whether the paper is accepted or rejected for the formal proceedings. As in previous years, we will try to have the papers that are accepted for the formal proceedings published in the International Conference Proceedings Series of the ACM Digital Library. This possibility will be confirmed as soon as possible. Reviewing is single blind. There will be at least 3 reviews per paper. For the camera-ready version the authors can make minor revisions which are accepted without further reviewing. Papers must use the ACM two columns conference format, which can be found here <https://ifl21-publicity-dot-yamm-track.appspot.com/2Z34AGflDaGf8EcFImELD02V…>. (For LaTeX users, start your document with \documentclass[sigconf,screen,review]{acmart}.) All contributions must be written in English. Note that this format has a rather long but limited list of packages that can be used. Please make sure that your document adheres to this list. The page limit for papers is twelve pages (excluding references). Only papers that were presented at the IFL 2023 Symposium will be considered for publication. See the webpage for paper submissions. LOCATION IFL 2023 will be held physically in Braga, Portugal. For more information, click here <https://ifl21-publicity-dot-yamm-track.appspot.com/2YpNKpbXPCivYXoXnLEVurcA…>. Registration information will be added as soon as possible. [image: beacon]

1 0

Call for Participation, Functional Software Architecture - FP in the Large
by Graham Hutton 26 Jul '23

26 Jul '23

====================================================================== *** FUNARCH 2023 -- CALL FOR PARTICIPATION *** The First ACM SIGPLAN Workshop on Functional Software Architecture - FP in the Large 8th September 2023, Seattle, Washington, USA Co-located with ICFP 2023 https://www.functional-architecture.org/events/funarch-2023/ ====================================================================== 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://icfp23.sigplan.org/attending/registration OPENING TALK: Functional Programming in the Large - Status and Perspective Mike Sperber ACCEPTED SUBMISSIONS: A Software Architecture Based on Coarse-Grained Self-Adjusting Computations Stefan Wehr Crème de la Crem: Composable Representable Executable Machines Marco Perone and Georgios Karachalias Functional Shell and Reusable Components for Easy GUIs Ben Knoble and Bogdan Popa Phases in Software Architecture Jeremy Gibbons, Oisín Kidney, Tom Schrijvers and Nicolas Wu Stretching the Glasgow Haskell Compiler Jeffrey M. Young, Sylvain Henry and John Ericson Typed Design Patterns for the Functional Era Will Crichton Types that Change: The Extensible Type Design Pattern Ivan Perez PROGRAM CHAIRS: Mike Sperber Active Group, Germany Graham Hutton University of Nottingham, UK PROGRAM COMMITTEE: Joachim Breitner Germany Manuel Chakravarty Tweag & IOG, The Netherlands Ron Garcia University of British Columbia, Canada Debasish Ghosh LeadIQ, India Lars Hupel Giesecke+Devrient, Germany Andy Keep Meta, USA Shriram Krishnamurthi Brown University, USA Andres Löh Well-Typed, Germany Anil Madhavapeddy University of Cambridge, UK José Pedro Magalhães Standard Chartered, UK Simon Marlow Meta, UK Hannes Mehnert Robur, Germany Erik Meijer USA Ivan Perez KBR / NASA Ames Research Center, USA Stefanie Schirmer DuckDuckGo, Germany Perdita Stevens University of Edinburgh, UK Stefan Wehr Hochschule Offenburg, Germany Scott Wlaschin FPbridge, UK WORKSHOP VENUE: The workshop will be co-located with the ICFP 2023 conference at The Westin Seattle Hotel, Seattle, Washington, United States. ====================================================================== This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.

1 0

Munich Haskell Meeting, 2023-07-26 @ 19:30
by Leah Neukirchen 24 Jul '23

24 Jul '23

Dear all, This week, our monthly Munich Haskell Meeting will take place again on Wednesday, July 26 at Cafe Puck at 19h30, as the weather will be wet and cold. For details see here: http://muenchen.haskell.bayern/dates.html If you plan to join, please add yourself to this nuudel so we can reserve enough seats! It is OK to add yourself to the nuudel anonymously or pseudonymously. https://nuudel.digitalcourage.de/QEVV6sKxTm2DGwle Everybody is welcome! cu, -- Leah Neukirchen <leah(a)vuxu.org> https://leahneukirchen.org/

1 0

Redundant/overlapping patterns?
by Todd Wilson 22 Jul '23

22 Jul '23

Hi, Cafe, Can someone please explain this: ghci> case 1 of 2 -> 3 <interactive>:1:11: warning: [-Woverlapping-patterns] Pattern match is redundant In a case alternative: 2 -> ... *** Exception: <interactive>:1:1-16: Non-exhaustive patterns in case The non-exhaustive patterns part is obvious, but what is redundant about this match? And how can there be overlapping patterns when there's only one? Todd Wilson

6 10

Citation information for 'base' hackage docs
by Patrick L Redmond 18 Jul '23

18 Jul '23

Hi Haskell-Cafe, I'd like to cite the documentation for a particular module and version of the "base" package in an academic publication. In this case, it makes sense to cite the documentation instead of the papers listed at the top because the behavior described in the documentation isn't described by the papers (the module's implementation has diverged from them). To what author should I attribute the documentation? The page lists " libraries(a)haskell.org" as the maintainer. What title should I give for the work? The html title is "Control.Exception". Thank you, Patrick

3 2

Taking over maintenance of int-cast package
by Nikolay Yakimov 17 Jul '23

17 Jul '23

I intend to take over int-cast (https://hackage.haskell.org/package/int-cast) package. I think it implements a reasonable approach to ensuring compile-time safety of integer casts, and it would be sad to see it silently fall into obscurity due to the lack of maintenance. This was discussed on GitHub (https://github.com/haskell-hvr/int-cast/issues/5#issuecomment-1620402453) since July 4, 2023, and I tried reaching @hvr via e-mail on July 5. Didn't receive a reply at the time of writing, and it seems unlikely I will anytime soon, hence moving on with the takeover process. This message is cross-posted to Haskell Discourse (https://discourse.haskell.org/t/taking-over-maintenance-of-int-cast-package…)

1 0

Re: [Haskell-cafe] Musings on lists
by Olaf Klinke 14 Jul '23

14 Jul '23

The fact that [a] is a linked list is exploited in Data.List.tails as well as in https://hackage.haskell.org/package/suffixtree where suffixes and internal segments of the tree all use Cons cells of the original list, so the overhead is only in the tree structure itself. In fact, exploiting the location of the internal tree nodes relative to the original list, one could compress the list similarly to the Lempel-Ziv 78 algorithm. This way, bioinformaticians manage to create full-text index structures [*] that are not much larger, or even smaller than, the original text. Olaf [*] Lempel-Ziv 78 creates a suffix tree of the text holding only a subset of all suffixes, namely those starting at a block boundary. This already suffices to find all occurrences of substrings spanning a block boundary.

1 0

Musings on lists
by Todd Wilson 13 Jul '23

13 Jul '23

Deaf Cafe, I'm an educator using Haskell, and I've been telling my students certain stories about Haskell evaluation that I'm now starting to question, so I'm writing for some clarification. I've written before about similar things (e.g., "Basic list exercise" from Mar 16), so it seems my own education on this topic is not yet complete! My apologies if this is too trivial for the Cafe. One story I tell students is that list concatenation, xs ++ ys, ends up "copying" the elements of xs but not the elements of ys, and in particular an expression like xs ++ [a], putting a new element at the end of a list, is particularly expensive, at least compared to x : xs, putting one at the beginning, which seems obvious, right? But here is my question: isn't xs ++ ys just a thunk that, as elements are "requested" from it, produces them first from xs and then, when those run out, defers entirely to ys from that point on? If so, then the elements of xs aren't "copied" any more than the elements of ys are; they are just produced from different places. Even the expression xs ++ [a] isn't problematic in this light: just act like xs, but with one more "card up the sleeve" when you are done. Have I gotten that right? Second, if the above is correct, then if there is a nesting, (xs ++ ys) ++ zs, and we want an element from it, there will be two steps before we can get that element from xs. And this will continue until xs is exhausted, at which point we get new elements in one step from ys, and finally in zero steps from zs. But ++ is associative, and so this list is also xs ++ (ys ++ zs), which requires less work getting the elements from xs. Is this kind of optimization something that is or can be done (automatically)? Thanks for your indulgence, Todd Wilson

6 7

Re: [Haskell-cafe] Musings on lists
by Olaf Klinke 13 Jul '23

13 Jul '23

Perhaps, if the students have been in contact with a language that has explicit pointers (C or C++), let them implement linked lists and concatenation in that procedural language. (An AI will likely also produce a correct implementation nowadays.) The advantage is that one can inspect the values of the pointers to see whether any copying has happened. Then the students easily see that only the spine (structure holding pointers) is re-created, but the memory the list elements point to is never touched. That is an instance of parametricity, I believe. The fact that length (replicate 3 undefined ++ replicate 2 undefined) evaluates to 5 also shows this. Olaf

2 1

[TFP 2024 Call for Papers] 25th International Symposium on Trends in Functional Programming
by Peter Achten 12 Jul '23

12 Jul '23

# TFP 2024 -- Call for Papers (trendsfp.github.io) ## Important Dates Submission deadline: pre-symposium, full papers, Saturday 4 November, 2023 Submission deadline: pre-symposium, draft papers, Wednesday 30 November, 2023 Notification: pre-symposium submissions, Friday 8 December, 2023 TFPIE Workshop: Tuesday 9 January, 2024 TFP Symposium: Wednesday 10 - Friday 12 January, 2024 Submission deadline: post-symposium review, Friday 23 February, 2024 Notification: post-symposium submissions, Friday 5 April, 2024 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 Seton Hall University, in South Orange, NJ in the United States. 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, November 4, is for authors that 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, November 30, is for authors that 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 article for review by the third deadline, February 23. ## 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 article categories. High-quality articles are solicited in any of these categories: * Research Articles: Leading-edge, previously unpublished research work * Position Articles: On what new trends should or should not be * Project Articles: Descriptions of recently started new projects * Evaluation Articles: What lessons can be drawn from a finished project * Overview Articles: Summarizing work with respect to a trendy subject Articles 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 article is within the scope of TFP, please contact the TFP 2024 program chair, Jason Hemann. ## 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 Authors must submit papers to: <https://easychair.org/conferences/?conf=tfp24> 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 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 receive at the symposium. A post-symposium refereeing process will then select a subset of these articles 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 (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 Jason Hemann PC Chair Seton Hall University, USA Stephen Chang Symposium Chair University of Massachusetts Boston, USA Shajina Anand Local Arrangements Seton Hall University, South Orange, USA

1 0