- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] Wincomplete-uni-patterns and bidirectional patterns
by Olaf Klinke 16 Jan '24

16 Jan '24

> On Mon, Jan 15, 2024 at 12:00:16PM +0100, Olaf Klinke wrote: > > How can I teach GHC 9 that the pattern is indeed exhaustive? > > Have you tried COMPLETE pragmas? > > > https://ghc.gitlab.haskell.org/ghc/doc/users_guide/exts/pragmas.html#comple… > > Tom Huh, of course that works. Thanks. It never occurred to me to even consider the existence of manual completeness annotation, since completeness checks work so reliably for ordinary constructors. But maybe my types weren't esoteric enough so far. Are there pattern-free cases where the GHC completeness checker is wrong? Of what computational class is the problem? Can I simulate a Turing machine by checking completeness in the presence of patterns? Olaf

3 2

GSoC 2024 Call for Ideas
by Aaron Allen 16 Jan '24

16 Jan '24

Dear Haskellers, Google Summer of Code is a long-running program by Google that supports Open Source projects. Haskell has been involved in the Google Summer of Code program almost since its inception and we are hoping to participate again in 2024! In order to do this we need a collection of ideas for participants to select from. In the past this has included significant improvements to Haskell projects such as GHC, Cabal, and HLS - and it can include your project as well! This is a great opportunity to find new contributors for your project and many past participants have become involved long-term. You can find more info and instructions on how to participate here: https://summer.haskell.org/ideas.html.

1 0

[Haskell] [ANNOUNCE] Haskell Language Server 2.6.0.0 released
by Zubin Duggal 15 Jan '24

15 Jan '24

Binaries for this release are available at https://downloads.haskell.org/~hls/haskell-language-server-2.6.0.0/. These binaries can be installed using [GHCup](https://www.haskell.org/ghcup/), using the vanilla metadata channel. ```bash ghcup --url-source=https://raw.githubusercontent.com/haskell/ghcup-metadata/master/ghcup-vanilla-0.0.8.yaml install hls 2.6.0.0 ``` All of these tarballs have associated GPG signatures. The signature should be from `Zubin Duggal <zubin(a)well-typed.com>` (key ID [588764FBE22D19C4](https://keys.openpgp.org/search?q=588764FBE22D19C4)) The prebuilt binaries in this release support the following GHC versions: - 9.2.8 - 9.4.8 - 9.6.4 - 9.8.1 # Changelog - Bindists for GHC 9.6.4 - A new semantic tokens plugin (#3892, @soulomoon). - Improvements to multiple home unit support with GHC 9.4. Using cabal 3.11+ will load proper multiple home unit sessions by default, fixing a lot of issues with loading and reloading projects that have more than one component (#3462, @wz1000). - Removed implicit-hie, resulting in better behaviour for projects without cradles. - Don't produce diagnostics for disabled plugins (#3941, @fendor). - Many other bug fixes. Happy editing! - Zubin.

1 0

Wincomplete-uni-patterns and bidirectional patterns
by Olaf Klinke 15 Jan '24

15 Jan '24

Dear Cafe, I have a data type with a bidirectional pattern {-# LANGUAGE PatternSynonyms #-} newtype T f t = C (f Double) pattern T :: Double -> T Identity t pattern T x = C (Identity x) Note that pattern T is the only way to construct something of type (T Identity t) for any phantom parameter t. When using the pattern to match in a where clause, the Wincomplete-uni-pattern warns me about non-exhaustive pattern matches that are in fact matched: f a = x where T x = g a :: T Identity () warning: [-Wincomplete-uni-patterns] Pattern match(es) are non- exhaustive in a pattern binding: Patterns not matched: C (Identity _) Minimal complete example is attached. How can I teach GHC 9 that the pattern is indeed exhaustive? GHC seems to have only three issues involving incomplete-uni-patterns, only one of them open, none of which matches my observations. Thanks Olaf

3 2

Fully-funded PhD studentship in functional programming
by Graham Hutton 15 Jan '24

15 Jan '24

Dear all, I'm advertising a fully-funded PhD studentship in functional programming, starting 1st October 2024. Please pass the advert on to anyone who may be intersted in applying. Best wishes, Graham Hutton +-----------------------------------------------------------+ Fully-Funded PhD Studentship Functional Programming Lab School of Computer Science University of Nottingham, UK http://tinyurl.com/fplab-phd Applications are invited for a fully-funded PhD studentship under the supervision of Prof Graham Hutton, starting on 1st October 2024. The successful applicant will join the Functional Programming Lab, an internationally-leading centre for programming language research. The topic for the studentship is open, but should relate to the research interests of Prof Hutton on the mathematics of program construction. The studentship forms part of the recently-funded EPSRC project on Semantics-Directed Compiler Construction, which seeks to develop new techniques for constructing certified compilers from semantics. The studentship is open to home and international students, is fully-funded for three and a half years, and includes a stipend of £18,622 per year and tuition fees. Applicants are expected to have a first-class Masters or Bachelors degree (or equivalent) in Computer Science and/or Mathematics, and an excellent ability and interest in the mathematical foundations of programming, together with experience of programming in a functional language. Further information and advice for prospective applicants is available from http://tinyurl.com/369xwzc7. Funding for this studentship is already in place. To apply, please submit the following items by email to graham.hutton(a)nottingham.ac.uk: (1) a brief covering letter that describes your reasons for wishing to undertake a PhD and any ideas you have about potential topics; (2) a copy of your CV, including your actual or expected degree class(es) and results of all university examinations; (3) an example of your technical writing, such as a report or dissertation; (4) email addresses for two academic referees. Closing date for applications: Friday 9th February 2024. +-----------------------------------------------------------+ — Professor Graham Hutton School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~pszgmh 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

2nd Call for Participation: BOB 2024 (Berlin, Mar 15, Early Bird until Jan 30)
by Stefan Wehr 15 Jan '24

15 Jan '24

========================================================================= BOB 2024 Conference “What happens if we simply use what’s best?” March 15, 2024, Berlin https://bobkonf.de/2024/ Program: https://bobkonf.de/2024/program.html Registration: https://bobkonf.de/2024/registration.html ========================================================================= BOB conference is a place for developers, architects, and decision-makers to explore technologies beyond the mainstream in software development and to find the best tools available to software developers today. Our goal is for all participants of BOB to return home with new insights that enable them to improve their own software development experience. The program features 14 talks and 8 tutorials on current topics: https://bobkonf.de/2024/program.html Talk subjects includes functional programming, property-based testing, service API design, programming for spacecraft, accessibility, hypermedia, business processes, software analytics, event-based communication and zero-knowledge proofs. BOB will feature tutorials on F#, Haskell, Lean, SwiftUI, Copilot, the K Framework, functional domain modelling, and Liberating Structures. Andreas Rossberg will give the keynote talk. Registration is open - online tickets are all under 200€, and many discount options are available, as are grants for members of groups underrepresented in tech. Early-bird registration runs until Jan 30: https://bobkonf.de/2024/registration.html

1 0

Fastest saturating add?
by amindfv＠mailbox.org 14 Jan '24

14 Jan '24

I have a function that's called many (many) times, which involves a saturating addition (addition without overflow). In other words, I'd like ((254 :: Word8) + 10) to equal 255 (which is maxBound::Word8), not 8 (which is what you get with overflow). My current code, without particular regard to performance, is simply: satAdd :: Word8 -> Word8 -> Word8 satAdd x y = let m = x + y in if m < x then 255 else m This seems like the type of code somebody's already worked on the performance for, though I can't find much Haskell-specific in searches online. Is there a faster way to do this? Thanks! Tom

2 1

restore type from existential
by zoran.bosnjak＠via.si 10 Jan '24

10 Jan '24

Dear haskellers, if for example I have the following (simplified) situation: import GHC.TypeLits type MyTypes = '[ () -- index 0 , Char -- index 1 , Int -- index 2 ] data SNat (n :: Nat) where SZ :: SNat 0 SS :: SNat n -> SNat (n+1) data Wrap where WrapUnsafe :: SNat n -> t -> Wrap t1 = WrapUnsafe SZ () :: Wrap t2 = WrapUnsafe (SS SZ) 'x' :: Wrap t3 = WrapUnsafe (SS (SS SZ)) (1::Int) :: Wrap Is it possible to have an 'unwrap' function? That is: to combine MyType types table and the type index... to get the exact type back. Something in the form: unwrapUnsafe :: Wrap -> t unwrapUnsafe (WrapUnsafe (ix::SNat n) (val::t)) = undefined x1 = unwrapUnsafe t1 x2 = unwrapUnsafe t2 x3 = unwrapUnsafe t3 GHC didn't like any of my attempt. Is it even possible? regards, Zoran

3 5

[ANNOUNCE] GHC 9.6.4 is now available
by Zubin Duggal 09 Jan '24

09 Jan '24

The GHC developers are happy to announce the availability of GHC 9.6.4. Binary distributions, source distributions, and documentation are available on the [release page](https://www.haskell.org/ghc/download_ghc_9_6_4.html). This release is primarily a bugfix release addressing a few issues found in the 9.6 series. These include: * A fix for a bug where certain warnings flags were not recognised (#24071) * Fixes for a number of simplifier bugs (#23952, #23862). * Fixes for compiler panics with certain package databases involving unusable units and module reexports (#21097, #16996, #11050). * A fix for a typechecker crash (#24083). * A fix for a code generator bug on AArch64 platforms resulting in invalid conditional jumps (#23746). * Fixes for some memory leaks in GHCi (#24107, #24118) * And a few other 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.4/docs/users_guide/9.6.4-notes.html

1 0

Technical Working Group: Call for Volunteers
by Jose Calderon 02 Jan '24

02 Jan '24

Hello, The Haskell Foundation Technical Working Group (TWG) <https://github.com/haskellfoundation/tech-proposals/blob/main/proposals/PRO…> serves as an advisory organization for both the HF management and the Haskell community as a whole, by evaluating specific proposals for projects that can have broad, ecosystem-wide effects. These proposals can be: - Community RFCs that seek the community’s input on a project - Community projects that will be executed primarily by the proposer, but seek administrative or financial support from the HF - HF projects that a community member would like us to execute - Other topics of relevance to the community Volunteers wanted! We presently have three openings on the working group, and we’re seeking volunteers. Members are expected to attend a monthly meeting, to participate in and moderate discussion threads regarding specific proposals, and to evaluate proposals for their technical merits. From time to time, committee members may also be asked to help a community member revise their proposal. The ability to communicate well and respectfully is important for any potential member. These discussions have a real impact on the Haskell ecosystem, so this is an opportunity to give back in a meaningful way. If you are interested, or if you know someone who might be, please get in touch with me at director(a)haskell.foundation! You don’t have to be a long-term Haskeller, or someone who is deeply embedded in Haskell development - we have members with this background already. If you are unsure as to whether you would fit in, please get in touch, and we can have a chat about it. We would like to have members with diverse backgrounds, professional experiences, and knowledge. All self-nominations must be submitted by the end of the day on Jan 12th 2024. Best wishes, Jose

1 0