From w.s.swierstra at uu.nl Fri May 2 07:29:30 2025 From: w.s.swierstra at uu.nl (Wouter Swierstra) Date: Fri, 2 May 2025 09:29:30 +0200 Subject: [Haskell-cafe] Utrecht Summer School on Advanced Functional Programming Message-ID: <7bc50001-9163-4ec0-8255-2a31c1ac3e78@uu.nl> Second Call for Participation SUMMER SCHOOL ON ADVANCED FUNCTIONAL PROGRAMMING Utrecht, the Netherlands, 07 July – 11 July 2025 http://afp.school **Please register before June 15th** ## ABOUT The Advanced Functional Programming summer school has been running for more than fifteen years. We aim to educate aspiring Haskell programmers beyond the basic material covered by many textbooks. The lectures will cover several more advanced topics regarding the theory and practice of Haskell programming, including topics such as: * lambda calculus; * lazy evaluation; * generalized algebraic data types; * type families and type-level programming; * concurrency and parallelism. The summer school will be held in Utrecht and consists of a mix of lectures, labs, and a busy social program. ## PREREQUISITES We expect students to have a basic familiarity with Haskell already. You should be able to write recursive functions over algebraic data types, such as lists and trees. There is a great deal of material readily available that covers this material. If you've already started learning Haskell and are looking to take your functional programming skills to the next level, this is the course for you. ## DATES Registration deadline: June 15th, 2025 School: 07 July – 11 July 2025 ## COSTS € 950 euro - Profession registration fee € 500 euro - Student registration fee € 200 euro - Housing fee We will charge a registration fee of €950 (or €500 for students) to cover our expenses. This fee includes all lunches, dinners, and coffee breaks - you won't need to budget much else besides your travel. If this is problematic for you for any reason at all, please email the organisers and we can try to offer you a discounted rate or a fee waiver. We have a limited number of scholarships or discounts available for students that would not be able to attend otherwise, especially for women and under-represented minorities. ## FURTHER INFORMATION Further information, including instructions on how to register, is available on our website: http://afp.school From xnningxie at gmail.com Fri May 2 15:38:54 2025 From: xnningxie at gmail.com (Ningning Xie) Date: Fri, 2 May 2025 11:38:54 -0400 Subject: [Haskell-cafe] Haskell Symposium 2025 Second Call for Papers Message-ID: ======================================================================== Haskell Symposium 2025 Call for Papers Thu 16 - Fri 17 Oct 2025, Singapore https://conf.researchr.org/home/icfp-splash-2025/haskellsymp-2025 ======================================================================== The ACM SIGPLAN Haskell Symposium 2025 will be co-located with the 2025 International Conference on Functional Programming (ICFP) and the 2025 International Conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH). The Haskell Symposium presents original research on Haskell, discusses practical experience and future development of the language, and promotes other forms of declarative programming. Submission deadline: 9 June 2025 (Mon) Notification: 17 July 2025 (Thu) Deadlines are valid anywhere on Earth. Papers should be submitted through HotCRP at: https://haskell25.hotcrp.com/ Topics of interest include: * Language design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal semantics of the present language or future extensions, type systems, effects, metatheory, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management, as well as foreign function and component interfaces; * Libraries, that demonstrate new ideas or techniques for functional programming in Haskell; * Tools, such as profilers, tracers, debuggers, preprocessors, and testing tools; * Applications, to scientific and symbolic computing, databases, multimedia, telecommunication, the web, and so forth; * Functional Pearls, being elegant and instructive programming examples; * Experience Reports, to document general practice and experience in education, industry, or other contexts; * Tutorials, to document how to use a particular language feature, programming technique, tool or library within the Haskell ecosystem; * System Demonstrations, based on running software rather than novel research results. Keynote Speakers ================= * Richard A. Eisenberg * Simon Peyton Jones Program Committee ================= Andreas Abel Gothenburg University Patrick Bahr IT University of Copenhagen Matthew Fluet Rochester Institute of Technology Adam Gundry Well-Typed LLP Xuejing Huang IRIF Hideya Iwasaki Meiji University Patricia Johann Appalachian State University Hsiang-Shang 'Josh' Ko Institute of Information Science, Academia Sinica András Kovács University of Gothenburg and Chalmers University of Technology Andres Löh Well-Typed LLP J. Garrett Morris (co-chair) University of Iowa Liam O'Connor Australian National University Maciej Piróg University of Wrocław Arnaud Spiwack Tweag Meng Wang University of Bristol Li-yao Xia Inria Ningning Xie (co-chair) University of Toronto Gergő Érdi Standard Chartered Bank -------------- next part -------------- An HTML attachment was scrubbed... URL: From zubin at well-typed.com Sat May 3 11:53:14 2025 From: zubin at well-typed.com (Zubin Duggal) Date: Sat, 3 May 2025 17:23:14 +0530 Subject: [Haskell-cafe] GHC 9.10.2 is now available Message-ID: <5exf6skh63uhw3inlhqdoi52rcqqnbsgjx6ukppmnooanzkaxt@2sn6ofbqzwmu> The GHC developers are very pleased to announce the availability of the release candidate for GHC 9.10.2. Binary distributions, source distributions, and documentation are available at [downloads.haskell.org][] and via [GHCup](https://www.haskell.org/ghcup/). GHC 9.10.2 is a bug-fix release fixing over 50 issues of a variety of severities and scopes, including: * Significantly improved performance when dynamically loading Haskell symbols (#23415). * Fixing a bug where the simplifier sometimes destroyed join points during float out, which could impact performance (#24768). * Reduced memory fragmentation in the non-moving GC's segment allocator, improving resident set size by up to 26% for some applications (#24150). * Added new flags to control speculative evaluation (-fspec-eval and -fspec-eval-dictfun) to work around performance regressions (#25606). * Fixed several platform-specific issues, including segfaults with FFI on PowerPC (#23034) and improved code generation for AArch64 with multiway branches now using jump tables (#19912) * And many more! A full accounting of these fixes can be found in the [release notes][]. As always, GHC's release status, including planned future releases, can be found on the GHC Wiki [status][]. We would like to thank Well-Typed, Tweag I/O, Juspay, QBayLogic, Channable, Serokell, SimSpace, the Haskell Foundation, and other anonymous contributors whose on-going financial and in-kind support has facilitated GHC maintenance and release management over the years. Finally, this release would not have been possible without the hundreds of open-source contributors whose work comprise this release. As always, do give this release a try and open a [ticket][] if you see anything amiss. Cheers, Zubin [release notes]: https://downloads.haskell.org/~ghc/9.10.2/docs/users_guide/9.10.2-notes.html [status]: https://gitlab.haskell.org/ghc/ghc/-/wikis/GHC-status [downloads.haskell.org]: https://downloads.haskell.org/ghc/9.10.2 [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 488 bytes Desc: not available URL: From sergueyz at gmail.com Tue May 6 08:01:08 2025 From: sergueyz at gmail.com (Serguey Zefirov) Date: Tue, 6 May 2025 11:01:08 +0300 Subject: [Haskell-cafe] Non-linear patterns. Message-ID: There are artifacts of old Haskell standards that are a matching against integer value (2 + 2 = 5) and a matching against arithmetic expression (f (n+1) = f n). Both are interesting in requiring a class over type to match. f 10 = 11 has type f :: (Eq a1, Num a1, Num a2) => a1 -> a2 f (n+1) = f n has type f :: Integral t1 => t1 -> t2 In that vein it is possible to add non-linear patterns by adding an equality constraint on the non-linear matches. E.g., f x x = x would have type f :: Eq a => a -> a -> a For example: data Logic = True | False | Not Logic | Or Logic Logic | And Logic Logic deriving Eq simplify (And x x) = simplify x simplify (Or x x) = simplify x simplify (Not (Not x)) = simplify x simplify x = x Patterns like that are common in simplification/optimization rules. Also, by making them legal, it would be possible to use them in Template Haskell to make better embedded languages. On the implementation side, it can be implemented much like the (n+k) pattern. I also think that pattern matching completeness checker should not change. What would you say? -------------- next part -------------- An HTML attachment was scrubbed... URL: From Graham.Hutton at nottingham.ac.uk Tue May 6 08:04:10 2025 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Tue, 6 May 2025 08:04:10 +0000 Subject: [Haskell-cafe] Journal of Functional Programming - Call for PhD Abstracts Message-ID: <1EA92233-FF1D-4B6A-9BF4-4612EBE8B7BB@nottingham.ac.uk> Dear all, If you or one of your students recently completed a PhD (or Habilitation) in the area of functional programming, please submit the dissertation abstract for publication in JFP: simple process, no refereeing, open access, 200+ published to date, deadline 30th May 2025. Please share! Best wishes, Graham Hutton ============================================================ CALL FOR PHD ABSTRACTS Journal of Functional Programming Deadline: 30th May 2025 http://tinyurl.com/jfp-phd-abstracts ============================================================ PREAMBLE: Many students complete PhDs in functional programming each year. As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. The abstracts are made freely available on the JFP website, i.e. not behind any paywall. They do not require any transfer of copyright, merely a license from the author. A dissertation is eligible for inclusion if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. The abstracts are not reviewed. Please submit dissertation abstracts according to the instructions below. We welcome submissions from both the student and the advisor/supervisor although we encourage them to coordinate. Habilitation dissertations are also eligible for inclusion. ============================================================ SUBMISSION: Please submit the following information to Graham Hutton by 29th November 2024. o Dissertation title: (including any subtitle) o Student: (full name) o Awarding institution: (full name and country) o Date of award: (month and year; depending on the institution, this may be the date of the viva, corrections being approved, graduation ceremony, or otherwise) o Advisor/supervisor: (full names) o Dissertation URL: (please provide a permanently accessible link to the dissertation if you have one, such as to an institutional repository or other public archive; links to personal web pages should be considered a last resort) o Dissertation abstract: (plain text, maximum 350 words; you may use \emph{...} for emphasis, but we prefer no other markup or formatting; if your original abstract exceeds the word limit, please submit an abridged version within the limit) Please do not submit a copy of the dissertation itself, as this is not required. JFP reserves the right to decline to publish abstracts that are not deemed appropriate. ============================================================ PHD ABSTRACT EDITOR: Graham Hutton School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom ============================================================ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From S.J.Thompson at kent.ac.uk Tue May 6 08:11:25 2025 From: S.J.Thompson at kent.ac.uk (Simon Thompson) Date: Tue, 6 May 2025 08:11:25 +0000 Subject: [Haskell-cafe] Non-linear patterns. In-Reply-To: References: Message-ID: <678C774F-308B-454A-B4B5-3FEDEE1CF330@kent.ac.uk> Repeated variables in patterns were allowed in Miranda, a predecessor of Haskell. In a lazy context there are interesting questions about how pattern matches fail, and in particular the point at which equality tests take place in matching a complex pattern. This paper [preview.png] BF01887213 PDF Document · 1.5 MB section 6.2 explains how these two definitions differ in meaning g [x,x] = 37 g z = 42 h [x,y] = 37 , x=y h z = 42 Simon On 6 May 2025, at 10:01, Serguey Zefirov wrote: There are artifacts of old Haskell standards that are a matching against integer value (2 + 2 = 5) and a matching against arithmetic expression (f (n+1) = f n). Both are interesting in requiring a class over type to match. f 10 = 11 has type f :: (Eq a1, Num a1, Num a2) => a1 -> a2 f (n+1) = f n has type f :: Integral t1 => t1 -> t2 In that vein it is possible to add non-linear patterns by adding an equality constraint on the non-linear matches. E.g., f x x = x would have type f :: Eq a => a -> a -> a For example: data Logic = True | False | Not Logic | Or Logic Logic | And Logic Logic deriving Eq simplify (And x x) = simplify x simplify (Or x x) = simplify x simplify (Not (Not x)) = simplify x simplify x = x Patterns like that are common in simplification/optimization rules. Also, by making them legal, it would be possible to use them in Template Haskell to make better embedded languages. On the implementation side, it can be implemented much like the (n+k) pattern. I also think that pattern matching completeness checker should not change. What would you say? _______________________________________________ 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. Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: preview.png Type: image/png Size: 209182 bytes Desc: preview.png URL: From noonsilk at gmail.com Tue May 6 08:21:47 2025 From: noonsilk at gmail.com (Noon van der Silk) Date: Tue, 6 May 2025 09:21:47 +0100 Subject: [Haskell-cafe] Non-linear patterns. In-Reply-To: <678C774F-308B-454A-B4B5-3FEDEE1CF330@kent.ac.uk> References: <678C774F-308B-454A-B4B5-3FEDEE1CF330@kent.ac.uk> Message-ID: The `Eq` you request there is not quite enough; right? you don't want merely a to have an Eq; you want a to be exactly equal to (the other) a? On Tue, 6 May 2025 at 09:11, Simon Thompson via Haskell-Cafe < haskell-cafe at haskell.org> wrote: > Repeated variables in patterns were allowed in Miranda, a predecessor of > Haskell. In a lazy context there are interesting questions about how > pattern matches fail, and in particular the point at which equality tests > take place in matching a complex pattern. This paper > > [image: preview.png] > > BF01887213 > PDF Document · 1.5 MB > > > section 6.2 explains how these two definitions differ in meaning > > g [x,x] = 37 > g z = 42 > > h [x,y] = 37 , x=y > h z = 42 > > Simon > > On 6 May 2025, at 10:01, Serguey Zefirov wrote: > > There are artifacts of old Haskell standards that are a matching against > integer value (2 + 2 = 5) and a matching against arithmetic expression (f > (n+1) = f n). > > Both are interesting in requiring a class over type to match. > > f 10 = 11 has type f :: (Eq a1, Num a1, Num a2) => a1 -> a2 > > f (n+1) = f n has type f :: Integral t1 => t1 -> t2 > > In that vein it is possible to add non-linear patterns by adding an > equality constraint on the non-linear matches. > > E.g., f x x = x would have type f :: Eq a => a -> a -> a > > For example: > > data Logic = True | False | Not Logic | Or Logic Logic | And Logic Logic > deriving Eq > > simplify (And x x) = simplify x > simplify (Or x x) = simplify x > simplify (Not (Not x)) = simplify x > simplify x = x > > Patterns like that are common in simplification/optimization rules. Also, > by making them legal, it would be possible to use them in Template Haskell > to make better embedded languages. > > On the implementation side, it can be implemented much like the (n+k) > pattern. I also think that pattern matching completeness checker should not > change. > > What would you say? > _______________________________________________ > 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. > > > Simon Thompson | Professor of Logic and Computation > School of Computing | University of Kent | Canterbury, CT2 7NF, UK > s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt > > _______________________________________________ > 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. -- Noon van der Silk http://silky.github.io/ "My programming language is kindness." -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: preview.png Type: image/png Size: 209182 bytes Desc: not available URL: From sergueyz at gmail.com Tue May 6 08:50:17 2025 From: sergueyz at gmail.com (Serguey Zefirov) Date: Tue, 6 May 2025 11:50:17 +0300 Subject: [Haskell-cafe] Non-linear patterns. In-Reply-To: <678C774F-308B-454A-B4B5-3FEDEE1CF330@kent.ac.uk> References: <678C774F-308B-454A-B4B5-3FEDEE1CF330@kent.ac.uk> Message-ID: I fail to see why the guarded definition (h [a,b] = 37, a == b; h z = 42) needs to evaluate tail of (a:b:tail). The computation of pattern's complements omits guards and operates only at pattern level. The same can be applied to f [10] = 11 -- that is f [x] | x == 10 = 11 or, in Miranda's terms, f [x] = 11, x == 10 f z = 12 and we can say that complement of pattern in "f [x] | x == 10" is [], (a:b:c) and, thusly, f [11, undefined] should evaluate to undefined. In the case of ghc, this is not true: ghci> let {f [10] = 11; f _ = 12} ghci> :t f f :: (Eq a1, Num a1, Num a2) => [a1] -> a2 ghci> f [10,undefined] 12 ghci> f [11,undefined] 12 ghci> f [11] 12 ghci> f [10] 11 Thus, I believe that reasoning from Miranda's paper is not directly applicable here. вт, 6 мая 2025 г. в 11:11, Simon Thompson : > Repeated variables in patterns were allowed in Miranda, a predecessor of > Haskell. In a lazy context there are interesting questions about how > pattern matches fail, and in particular the point at which equality tests > take place in matching a complex pattern. This paper > > [image: preview.png] > > BF01887213 > PDF Document · 1.5 MB > > > section 6.2 explains how these two definitions differ in meaning > > g [x,x] = 37 > g z = 42 > > h [x,y] = 37 , x=y > h z = 42 > > Simon > > On 6 May 2025, at 10:01, Serguey Zefirov wrote: > > There are artifacts of old Haskell standards that are a matching against > integer value (2 + 2 = 5) and a matching against arithmetic expression (f > (n+1) = f n). > > Both are interesting in requiring a class over type to match. > > f 10 = 11 has type f :: (Eq a1, Num a1, Num a2) => a1 -> a2 > > f (n+1) = f n has type f :: Integral t1 => t1 -> t2 > > In that vein it is possible to add non-linear patterns by adding an > equality constraint on the non-linear matches. > > E.g., f x x = x would have type f :: Eq a => a -> a -> a > > For example: > > data Logic = True | False | Not Logic | Or Logic Logic | And Logic Logic > deriving Eq > > simplify (And x x) = simplify x > simplify (Or x x) = simplify x > simplify (Not (Not x)) = simplify x > simplify x = x > > Patterns like that are common in simplification/optimization rules. Also, > by making them legal, it would be possible to use them in Template Haskell > to make better embedded languages. > > On the implementation side, it can be implemented much like the (n+k) > pattern. I also think that pattern matching completeness checker should not > change. > > What would you say? > _______________________________________________ > 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. > > > Simon Thompson | Professor of Logic and Computation > School of Computing | University of Kent | Canterbury, CT2 7NF, UK > s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt > > -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: preview.png Type: image/png Size: 209182 bytes Desc: not available URL: From sergueyz at gmail.com Tue May 6 08:52:01 2025 From: sergueyz at gmail.com (Serguey Zefirov) Date: Tue, 6 May 2025 11:52:01 +0300 Subject: [Haskell-cafe] Non-linear patterns. In-Reply-To: References: <678C774F-308B-454A-B4B5-3FEDEE1CF330@kent.ac.uk> Message-ID: An "Eq a" equality constraint would be enough. I do not ask for equality of definitions or references, despite the fact these can be used in DSL's. вт, 6 мая 2025 г. в 11:22, Noon van der Silk : > The `Eq` you request there is not quite enough; right? you don't want > merely a to have an Eq; you want a to be exactly equal to (the other) a? > > On Tue, 6 May 2025 at 09:11, Simon Thompson via Haskell-Cafe < > haskell-cafe at haskell.org> wrote: > >> Repeated variables in patterns were allowed in Miranda, a predecessor of >> Haskell. In a lazy context there are interesting questions about how >> pattern matches fail, and in particular the point at which equality tests >> take place in matching a complex pattern. This paper >> >> [image: preview.png] >> >> BF01887213 >> PDF Document · 1.5 MB >> >> >> section 6.2 explains how these two definitions differ in meaning >> >> g [x,x] = 37 >> g z = 42 >> >> h [x,y] = 37 , x=y >> h z = 42 >> >> Simon >> >> On 6 May 2025, at 10:01, Serguey Zefirov wrote: >> >> There are artifacts of old Haskell standards that are a matching against >> integer value (2 + 2 = 5) and a matching against arithmetic expression (f >> (n+1) = f n). >> >> Both are interesting in requiring a class over type to match. >> >> f 10 = 11 has type f :: (Eq a1, Num a1, Num a2) => a1 -> a2 >> >> f (n+1) = f n has type f :: Integral t1 => t1 -> t2 >> >> In that vein it is possible to add non-linear patterns by adding an >> equality constraint on the non-linear matches. >> >> E.g., f x x = x would have type f :: Eq a => a -> a -> a >> >> For example: >> >> data Logic = True | False | Not Logic | Or Logic Logic | And Logic Logic >> deriving Eq >> >> simplify (And x x) = simplify x >> simplify (Or x x) = simplify x >> simplify (Not (Not x)) = simplify x >> simplify x = x >> >> Patterns like that are common in simplification/optimization rules. Also, >> by making them legal, it would be possible to use them in Template Haskell >> to make better embedded languages. >> >> On the implementation side, it can be implemented much like the (n+k) >> pattern. I also think that pattern matching completeness checker should not >> change. >> >> What would you say? >> _______________________________________________ >> 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. >> >> >> Simon Thompson | Professor of Logic and Computation >> School of Computing | University of Kent | Canterbury, CT2 7NF, UK >> s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt >> >> _______________________________________________ >> 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. > > > > -- > Noon van der Silk > > http://silky.github.io/ > > "My programming language is kindness." > -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: preview.png Type: image/png Size: 209182 bytes Desc: not available URL: From andrask at chalmers.se Wed May 7 12:58:47 2025 From: andrask at chalmers.se (Andras Kovacs) Date: Wed, 7 May 2025 12:58:47 +0000 Subject: [Haskell-cafe] TyDe 2025 - Second Call for Papers Message-ID: ========================================================================= The Tenth International Workshop on TYPE-DRIVEN DEVELOPMENT Call for papers and extended abstracts Singapore, 12 October 2025 https://icfp25.sigplan.org/home/tyde-2025 ========================================================================= The Workshop on Type-Driven Development (TyDe) aims to show how static type information may be used effectively in the development of computer programs. Co-located with ICFP and SPLASH, this workshop brings together leading researchers and practitioners who are using or exploring types as a means of program development. We welcome all contributions, both theoretical and practical, on a range of topics including: * dependently typed programming; * generic programming; * design and implementation of programming languages, exploiting types in novel ways; * exploiting typed data, data dependent data, or type providers; * static and dynamic analyses of typed programs; * tools, IDEs, or testing tools exploiting type information; * pearls, being elegant, instructive examples of types used in the derivation, calculation, or construction of programs. ### Important dates ### * Mon 9 Jun 2025 (AoE): Submission deadline for papers and extended abstracts * Wed 16 Jul 2025: Notification of acceptance * Wed 30 Jul 2025: Submission of camera-ready papers to ACM * Sun 12 Oct 2025: Workshop ### Proceedings and Copyright ### We will have formal proceedings for full-length papers, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance, but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. The official publication date is the date the papers 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. ### Submission Details ### Submissions should fall into one of two categories: * regular research papers (12 pages); * extended abstracts (3 pages). The bibliography will not be counted against the page limits for either category. Regular research papers are expected to present novel and interesting research results, and will be included in the formal proceedings. Extended abstracts should report work in progress that the authors would like to present at the workshop. Extended abstracts will be distributed to workshop attendees but will not be published in the formal proceedings. We welcome submissions from PC members (with the exception of the two co-chairs), but these submissions will be held to a higher standard. Submission is handled through HotCRP: > https://tyde25.hotcrp.com All submissions should be in portable document format (PDF) and formatted using the ACM SIGPLAN style guidelines: > https://www.sigplan.org/Resources/Author/ Note that submissions should use the new ‘acmart’ format and the two-column ‘sigplan’ subformat (not to be confused with the one-column ‘acmsmall’ subformat). Extended abstracts must be submitted with the label ‘Extended Abstract’ clearly in the title. ### Presentations ### We expect that each accepted submission is presented at the workshop. Presentations are around 20 minutes plus questions. Remote presentation is possible. ### Participant Support ### Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover participation-related expenses. PAC also offers other support, such as for child-care expenses during the meeting or for accommodations for members with physical disabilities. For details on the PAC program, see its web page: > https://www.sigplan.org/PAC/ ### Workshop Organization ### Organizing Committee: - András Kovács (University of Gothenburg and Chalmers University of Technology) - Yuting Wang (Shanghai Jiao Tong University, China) Program Committee: - Nathan Corbyn (University of Oxford, United Kingdom) - Stephen Dolan (Jane Street, United Kingdom) - Paul Downen (University of Massachusetts at Lowell, United States) - Brandon Hewer (University of Nottingham, United Kingdom) - Hongwei Xi (Boston University, United States) - Wen Kokke (University of Edinburgh, United Kingdom) - Yao Li (Portland State University, United States) - Hidehiko Masuhara (Institute of Science Tokyo, Japan) - Stefan Monnier (Université de Montréal, Canada) - Steven Ramsay (University of Bristol, United Kingdom) - Di Wang (Peking University, China) - Zhixuan Yang (Imperial College London, United Kingdom) -------------- next part -------------- An HTML attachment was scrubbed... URL: From chisvasileandrei at gmail.com Thu May 8 12:51:35 2025 From: chisvasileandrei at gmail.com (Andrei Chis) Date: Thu, 8 May 2025 14:51:35 +0200 Subject: [Haskell-cafe] Call for Participation: SLE 2025 - 18th ACM SIGPLAN International Conference on Software Language Engineering Message-ID: ** Call for Participation ** 18th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2025) 12-13 June 2025 Koblenz, Germany https://conf.researchr.org/home/sle-2025 https://www.sleconf.org/2025/ https://x.com/sleconf ------------------------------------------------------------------------ The ACM SIGPLAN International Conference on Software Language Engineering (SLE) is devoted to the principles of software languages: their design, their implementation, and their evolution. Like its predecessors, the 18th edition of the SLE conference, SLE 2025, will bring together researchers from different areas united by their common interest in the creation, capture, and tooling of software languages. It overlaps with traditional conferences on the design and implementation of programming languages, model-driven engineering, and compiler construction, and emphasises the fusion of their communities. To foster the latter, SLE traditionally fills a two-day program with a single track, with the only temporal overlap occurring between co-located events. --------------------------- Registration --------------------------- Registration happens via the STAF registration page Early Bird Registration Deadline is May 10th, 2025 https://conf.researchr.org/attending/staf-2025/staf-2025-registration --------------------------- Venue --------------------------- University of Koblenz https://conf.researchr.org/venue/sle-2025/staf-2025-venue --------------------------- Keynotes --------------------------- * Thorsten Berger, Ruhr University Bochum, Germany A New DSL Textbook in Town! * Friedrich Steimann, Fernuniversität in Hagen, Germany an Programming Be Liberated from the Functional Style? https://conf.researchr.org/home/sle-2025#Keynotes --------------------------- Awards --------------------------- During the conference, we will announce the following 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. * COLA Award: 2024 Journal of Computer Languages Best Paper Award --------------------------- Accepted Papers --------------------------- * A Model-Driven Approach to Design, Generation, and Deployment of GUI Component Libraries Arkadii Gerasimov, Nico Jansen, Judith Michael, Bernhard Rumpe, Sebastian Will * AnyText: Incremental, left-recursive Parsing and Pretty-Printing from a single Grammar Definition with first-class LSP support Georg Hinkel, Alexander Hert, Niklas Hettler, Kevin Weinert * Boosting Parallel Parsing through Cyclic Operator Precedence Grammars Michele Chiari, Michele Giornetta, Dino Mandrioli, Matteo Pradella * Detecting Resource Leaks on Android with Alpakka Gustavo Amorim Santos, Alexandra Mendes, João Bispo * Dynamic Dependency-Based Purity Checking Anton Risberg Alaküla, Niklas Fors, Christoph Reichenbach * Exploratory, Omniscient, and Multiverse Diagnostics in Debuggers for Non-Deterministic Languages Damian Frölich, Tommaso Pacciani, L. Thomas van Binsbergen * Handling Grammar Cycles in the 1997 Standard ML Definition Elizabeth Scott, Adrian Johnstone * Integrating Model Checking into a Live Modeling Environment Joeri Exelmans, Ciprian Teodorov, Hans Vangheluwe * Lessons Learned: Challenges of Modular Language Design Alex Lüpges, Nico Jansen, Bernhard Rumpe * Optimal Language Design is Hard: A Case Study in ECMAScript (JavaScript) Standardization Philipp Riemer, Yury Nikulin, Ashley Claymore, Mikhail Barash * Optimize Effect Handling for Tail-resumption with Stack Unwinding Yuze Fu, Shigeru Chiba * Property-based Testing of Attribute Grammars José Nuno Macedo, Marcos Viera, João Saraiva * Scheduling the Construction and Interrogation of Scope Graphs Using Attribute Grammars Luke Bessant, Eric Van Wyk * (Semantic) Feature Model Differences with (Q)SAT Simone Heisinger, Maximilian Heisinger, Martina Seidl * TranspileJS, an Intelligent Framework for Transpiling JavaScript to WebAssembly José Pedro Ferreira, João Bispo, Susana Lima * Variability Fault Localization by Abstract Interpretation and its Application to SPL Repair Aleksandar S. Dimovski -------------- next part -------------- An HTML attachment was scrubbed... URL: