- Haskell-Cafe - Haskell.org

[Haskell] [ANNOUNCE] GHC 9.2.3 released
by Zubin Duggal 27 May '22

27 May '22

The GHC developers are very happy to at announce the availability of GHC 9.2.3. Binary distributions, source distributions, and documentation are available at [`downloads.haskell.org`](https://downloads.haskell.org/ghc/9.2.3). Download Page: https://www.haskell.org/ghc/download_ghc_9_2_3.html Blog Post: https://www.haskell.org/ghc/blog/20220527-ghc-9.2.3-released.html This release includes many bug-fixes and other improvements to 9.2.2 including: * A fix to a critical linking bug on Windows causing the 9.2.2 release to be unusable (#21196). * Numerous bug fixes for regressions and other issues in the typechecker (#2147, #21515, #20582, #20820, #21130, #21479). * Correctness bugs in the code generator and compiler backends (#21396, #20959, #21465). * Packaging fixes on many platforms (#20760, #21487, #21402). * Many others. See the [release notes][] for a full list. 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, Tweag I/O, Serokell, Equinix, SimSpace, 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, - Zubin [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new [release notes]: https://downloads.haskell.org/ghc/9.2.3/docs/html/users_guide/9.2.3-notes.h…

1 0

GHC.X.Hackage and GHC's release cycle
by Ben Gamari 27 May '22

27 May '22

Hello all, Recently in the Haskell Foundation's stability working group we have been discussing various practical issues that Haskell users and prospective adopters encounter around the ecosystem. During these discussions the topic of GHC's release schedule and the ecosystem's process migration to new GHC releases has come up repeatedly. To address some of these issues, I have opened a pair of somewhat-related HF Tech Proposals: * the GHC.X.Hackage proposal ([ghc.x.hackage]) seeks to extend the [head.hackage] infrastructure used to test GHC to enable use by library maintainers in porting and testing their libraries on new GHC releases. * the [tick-tock] release proposal seeks to provide better guidance to users needing long release lifecycles by designating every other release as a "long-term support" release, with 18-month backport window. Given the wide applicability of these proposals we hope to gather feedback from a broad swath of the community. If you have questions, opinions, or concerns on either, please leave your feedback on the respective proposal. We look forward to hearing from you. Thanks! - Ben [ghc.x.hackage]: https://github.com/haskellfoundation/tech-proposals/pull/27 [head.hackage]: https://ghc.gitlab.haskell.org/head.hackage/ [tick-tock]: https://github.com/haskellfoundation/tech-proposals/pull/34

1 0

Should there be a haskell template for inclusion polymorphism in Haskell?
by Miao ZhiCheng 27 May '22

27 May '22

Hi Haskellers! Here are some of my thoughts about polymorphism in Haskell especially the inclusion polymorphism, with questions in the end. ~IGNORE THESE LHS BOILER PLATES~ > {-# LANGUAGE GADTs #-} > module Main where > import Unsafe.Coerce ( unsafeCoerce ) ~IGNORE THESE LHS BOILER PLATES~ * Classification of Polymorphism Let's assume that we are following the classification of polymorphism where there are four types of it: ?? Btw, does anyone have a good citation of this classification? I got it from all over the Internet instead: e.g https://www.tutorialspoint.com/types-of-polymorphisms-ad-hoc-inclusion-para… ** Overloading Polymorphism It allows function with same name to act in different manner for different types. ** Coercion Polymorphism Also called as casting sometimes. ** Inclusion Polymorphism Also called as subtyping. This allows to point derived classes using base class pointers and references. ** Parametric Polymorphism Also called early Binding, it allows to use same piece of code for different types. We can get it by using templates. ** Sub Classifications In terms of being ad-hoc or universal: - Overloading and Coercion are ad-hoc, - Inclusion and Parametric are universal. In terms of being compile-time vs run-time: - Coercion, Overloading, Parametric are all compile-time polymorphism, - while only Inclusion is run-time polymorphism. * Different Polymorphism in Haskell In terms of their counter parties in Haskell language: ** Overloading Polymorphismin Haskell I think type classes basically provides such overloading ad-hoc polymorphism. Some thinks so too: https://stackoverflow.com/questions/6636107/how-does-haskell-handle-overloa… > class Fooable a where > foo :: a -> Int > instance Fooable Int where > foo = id > instance Fooable Bool where > foo _ = 42 ** Coercion Polymorphism in Haskell I think Haskell has both `Coercible` & `unsafeCoerce` for handling representational equality in compile time. But I am not sure if c/c++ style of conercion between similar types such as int/float/double is something Haskell would want to inject these magic conversion code ever. ** Parametric Polymorphism in Haskell This is probably what Haskell is best at the most, demonstrated by the classic `map` function definition: > map' :: (a -> b) -> [a] -> [b] > map' _ [] = [] > map' f (x:xs) = f x : map' f xs Note that, one could also combine parametric and overloading together using constraints: > double :: Num a => a -> a > double x = x + x This `double` function is parametric, but constrained only to work with Num type classes, hence their implementations are overloaded. ** Inclusion Polymorphism in Haskell Ok, finally inclusion polymorphism is what I want to focus on and have some questions here. Before that, I do want to mention one observation, inclusion polymorphism probably is most likely the old OOP habits that die hard. For me at least, since I consider myself a recovering OOP run-time polymorphism addict, and my guess is that unless the use case do need run-time polymorphism, e.g. run-time execution layer abstration, it is often better off using other type of polymorphism to achieve the same result. And even Bjarne Stroustrup is flirting with the idea: [[https://www.youtube.com/watch?v=xcpSLRpOMJM][Bjarne Stroustrup - Object Oriented Programming without Inheritance - ECOOP 2015]] Let's think of translating this piece of pseudo OOP style code into haskell. ``` interface Num { Num (+)(Num a, Num b); Num (*)(Num a, Num b); Num abs(Num a); Num negate(Num a); Num signum(Num a); Num fromInteger(Integer); } interface Show { String show(Show a); } class AnyNum<T> implements Num, Show { // trivially implements Num Show interfaces } // Now we can use AnyNum<Int>, AnyNum<Double>, etc. through their Num or Show interfaces. ``` In Haskell though, thanks to the ability of having existential type, AnyNum is actually quite nice to write: > data AnyNum where > MkAnyNum :: (Num a, Show a) => a -> AnyNum But in order to use AnyNum like using interfaces in our pseudo code, we would have to write these boiler plates and in some cases using unsafeCoerce due to not using Typeable run-time information: > instance Num AnyNum where > (+) (MkAnyNum a) (MkAnyNum b) = MkAnyNum $ a + unsafeCoerce b > (*) (MkAnyNum a) (MkAnyNum b) = MkAnyNum $ a + unsafeCoerce b > abs (MkAnyNum a) = MkAnyNum . abs $ a > negate (MkAnyNum a) = MkAnyNum . negate $ a > signum (MkAnyNum a) = MkAnyNum . signum $ a > fromInteger = MkAnyNum . fromInteger > instance Show AnyNum where > show (MkAnyNum a) = show a Here is some test code that demonstrate how distressful unsafeCoerce is: > main = do > let a = MkAnyNum(1 :: Int) > let b = MkAnyNum(2 :: Double) > let c = MkAnyNum(3 :: Int) > print $ show $ a + b > print $ show $ a + c Outputs are: ``` λ> "4611686018427387905" "4" ``` Few observations: - If there is at most one occurance of the usage of the type class, there is no need for the unsafeCoerce. - Otherwise, unsafeCoerce is required, or otherwise those functions could be left to "undefined". So my central questions for discussions are: - Is inclusion polymorphism something we should use at all in Haskell? - These boiler plate code maybe better be generated using Haskell template instead, is there one already, or should there be one? Cheers, Miao

2 2

GHC 9.4.1-alpha2 now available
by Ben Gamari 24 May '22

24 May '22

The GHC developers are happy to announce the availability of the second alpha release of the GHC 9.4 series. Binary distributions, source distributions, and documentation are available at downloads.haskell.org: https://downloads.haskell.org/ghc/9.4.1-alpha2 This major release will include: - A new profiling mode, `-fprof-late`, which adds automatic cost-center annotations to all top-level functions *after* Core optimisation has run. This incurs significantly less performance cost while still providing informative profiles. - A variety of plugin improvements including the introduction of a new plugin type, *defaulting plugins*, and the ability for typechecking plugins to rewrite type-families. - An improved constructed product result analysis, allowing unboxing of nested structures, and a new boxity analysis, leading to less reboxing. - Introduction of a tag-check elision optimisation, bringing significant performance improvements in strict programs. - Generalisation of a variety of primitive types to be levity polymorphic. Consequently, the `ArrayArray#` type can at long last be retired, replaced by standard `Array#`. - Introduction of the `\cases` syntax from [GHC proposal 0302] - A complete overhaul of GHC's Windows support. This includes a migration to a fully Clang-based C toolchain, a deep refactoring of the linker, and many fixes in WinIO. - Support for multiple home packages, significantly improving support in IDEs and other tools for multi-package projects. - A refactoring of GHC's error message infrastructure, allowing GHC to provide diagnostic information to downstream consumers as structured data, greatly easing IDE support. - Significant compile-time improvements to runtime and memory consumption. - On overhaul of our packaging infrastructure, allowing full traceability of release artifacts and more reliable binary distributions. - ... and much more. See the [release notes] for a full accounting. Note that, as 9.4.1 is the first release for which the released artifacts will all be generated by Hadrian, it's possible that there will be packaging issues. If you enounter trouble while using a binary distribution, please open a [ticket]. Likewise, if you are a downstream packager, do consider migrating to [Hadrian] to run your build; the Hadrian build system can be built using `cabal-install`, `stack`, or the in-tree [bootstrap script]. We would like to thank Microsoft Azure, GitHub, IOHK, the Zw3rk stake pool, Tweag I/O, Serokell, Equinix, SimSpace, 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 testing, - Ben [GHC proposal 0302]: https://github.com/ghc-proposals/ghc-proposals/blob/master/proposals/0302-c… [ticket]: https://gitlab.haskell.org/ghc/ghc/-/issues/new [bootstrap script]: https://gitlab.haskell.org/ghc/ghc/-/blob/e2520df3fffa0cf22fb19c5fb872832d1… [release notes]: https://downloads.haskell.org/~ghc/9.4.1-alpha2/docs/users_guide/9.4.1-note…

2 1

ANN: haskell-links.org - searchable links db
by Simon Michael 21 May '22

21 May '22

Hello Haskell friends, Recently I said this on reddit: > There's no way these very frequent reddit and chat requests for learning materials can capture all the existing resources. There are too many, and folks who know where they are get burned out reposting them. There have been many attempts to gather them, haskell.org/documentation being the most obvious, but none of them have fully succeeded. We could really do with some more systematic, scalable (crowd-sourced, lightweight) approach. Then I experimented and set up https://haskell-links.org . This is version 1, providing: - A searchable read-only view of the Haskell links collected by lambdabot, the popular #haskell IRC bot. - A redirector/link shortener/memory aid, for jumping to any of these links via their short ID. Eg: https://haskell-links.org/doc <https://haskell-links.org/doc> https://haskell-links.org/books <https://haskell-links.org/books> https://haskell-links.org/ghc-guide <https://haskell-links.org/ghc-guide> - Collected links to other Haskell search tools, making this a fast way to get to anywhere in Haskelldom. After contemplation and discussion on #haskell, I believe version 2 should allow web editing and use its own database. But I wanted to share this one as it's a nice simple setup. I hope you might find useful ! Help is welcome, see README. Best, -Simon

2 2

[ANN]: simfin 1.0.0 - Simple financial data API wrapper
by Owen Shepherd 21 May '22

21 May '22

Hello everyone, I've released a small library that wraps the SimFin (https://simfin.com/) API. SimFin collates and organises financial data, and provides a nice little web API which provides historical prices, ratios, financial statement extracts, etc. Hackage link: https://hackage.haskell.org/package/simfin-1.0.0 Enjoy, - Owen

1 0

[template haskell] Sharing names between constructors and types
by Patrick L Redmond 20 May '22

20 May '22

Hello Haskell Cafe, When can a type not share the name of a constructor? Defining a type and a constructor with the same name, manually, as follows, seems to be acceptable: data F = F | T data T However, if the type is generated by Template Haskell, it is no longer acceptable, as follows: voidType :: Name -> DecsQ voidType n = do d <- dataD (return []) n [] Nothing [] [] return [d] In a separate module: data F = F | T $(voidType 'T) This will result in a "Multiple declarations of ‘T’" error. Is this expected? Thank you, Patrick

2 2

Package takeover request for rapid
by Markus Läll 19 May '22

19 May '22

Hi I would like to take over https://hackage.haskell.org/package/rapid The author of the package Ertugrul Söylemez, once an active member of the community perhaps best known for netwire, passed away in 2018. [1] The work required for the package thus far, and for which I've kept a fork for, is to bump version bounds as GHCs progress. [1] https://github.com/esoeylemez/rapid/pull/2#issuecomment-427065739 -- Markus Läll

5 7

ML Family Workshop 2022: Final Call for Presentations
by Benoit Montagu 17 May '22

17 May '22

We are happy to invite submissions to the ML Family Workshop 2022, to be held during the ICFP conference week on Thursday, September 15th. The ML family workshop warmly welcomes submission touching on the programming languages traditionally seen as part of the “ML family” (Standard ML, OCaml, F#, CakeML, SML#, Manticore, MetaOCaml, etc.). The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of the members of the ML family. We also encourage presentations from related languages (such as Haskell, Scala, Rust, Nemerle, Links, Koka, F*, Eff, ATS, etc), to exchange experience of further developing ML ideas. The workshop does not have proceedings, making it the perfect venue to run some ideas with the community or present some work in progress within a friendly environment. The PC has a broad expertise and submissions are 3 pages long: when in doubt, just submit! Currently, the workshop is scheduled to be an in-person event. We will give to the authors of accepted abstracts the opportunity to give their talks remotely if necessary, in case they could not travel. See the detailed CFP online on the ICFP website: https://icfp22.sigplan.org/home/mlfamilyworkshop-2022#Call-for-Presentations Important dates --------------- Friday 3th June (any time zone): Abstract submission deadline Tuesday 28th June: Author notification Thursday 15th August: ML Family Workshop Program committee ----------------- Kenichi Asai (Ochanomizu University) Arthur Azevedo de Amorim (Boston University) Dariusz Biernacki (University of Wrocław) Stephen Dolan (Jane Street) Kavon Farvardin (Apple) Armaël Guéneau (Inria) Sam Lindley (University of Edinburgh) Guido Martínez (CIFASIS-CONICET) Keiko Nakata (SAP Innovation Center Potsdam) Lionel Parreaux (Hong Kong University of Science and Technology) Matija Pretnar (University of Ljubljana) Mike Rainey (Carnegie Mellon University) Yann Régis-Gianas (Nomadic Labs) KC Sivaramakrishnan (IIT Madras and Tarides) Ningning Xie (University of Cambridge) Chair: Benoît Montagu (Inria) Submission details ------------------ See the online CFP for the details on the expected submission format. Submissions must be uploaded to the workshop submission website https://ml2022.hotcrp.com/ before the submission deadline.

1 0

Assistant Professorships in Nottingham
by Graham Hutton 17 May '22

17 May '22

Dear all, As part of a strategic expansion, the School of Computer Science at the University of Nottingham is seeking to make multiple new appointments at the Assistant Professor level: https://tinyurl.com/38f753d5 These positions are aimed at early career academics who recently completed or will soon complete their PhD, and have a reduced teaching responsibility for the first three years. Applications in the area of the Functional Programming (FP) lab are strongly encouraged! The FP lab is keen to receive applications from candidates with a strong publication record (e.g. papers in leading venues such as LICS, POPL, ICFP, JFP, TOPLAS, etc) and the potential to secure external funding. The group recently grew its profile in type theory with the appointment of Nicolai Kraus and Ulrik Buchholtz. To complement these appointments, we particularly welcome applications from candidates who would bring further or other areas of expertise. Further information about the FP lab is available from: https://tinyurl.com/y2ekdkqa The deadline for applications is Tuesday 24th May 2022. -- Graham Hutton and Thorsten Altenkirch 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