- Haskell-Cafe - Haskell.org

Near Semi Ring problem
by Henry Laxen 23 Apr '22

23 Apr '22

Dear Group, Many years ago I read a fascinating article which I can't seem to find anymore. It was about writing down (in english) the numbers from one to a billion? and being able to retrieve the nth letter. ie: onetwothreefourfive...ninehundredninetymillion....ninetynineonebillion I remember it used near semi rings and automatic differentiation, but no matter how I use those words to search (both google and duckduck) I can't find it. Do any of you have a pointer. I believe the code was written in haskell too. Best wishes, Henry Laxen

2 1

Haskell.org outage
by Ben Gamari 18 Apr '22

18 Apr '22

Hello everyone, Unfortunately Haskell.org, downloads.haskell.org, and hoogle.haskell.org are currently down. We are currently investigating the cause. Updates will be posted as they are available. Cheers, - Ben

1 1

Ord/Ix and Bounded?
by Zemyla 16 Apr '22

16 Apr '22

Are there any laws relating Bounded to Ord and Ix? For instance, any reasonable type should say minBound <= x == True for all x maxBound >= x == True for all x inRange (minBound, maxBound) x == True for all x

2 2

Retro/indie Haskell to appreciate
by Vanessa McHale 13 Apr '22

13 Apr '22

I’m looking to appreciate “retro” Haskell projects, things from before stabilization/company use. Such as: fgl https://web.engr.oregonstate.edu/~erwig/fgl/haskell/ <https://web.engr.oregonstate.edu/~erwig/fgl/haskell/> WWWBrowser https://cth.altocumulus.org/~hallgren/wwwbrowser.html <https://cth.altocumulus.org/~hallgren/wwwbrowser.html> Balsa/Teak (languages) http://apt.cs.manchester.ac.uk/projects/tools/balsa/ <http://apt.cs.manchester.ac.uk/projects/tools/balsa/> BlueSpec compiler https://github.com/B-Lang-org/bsc <https://github.com/B-Lang-org/bsc> The CABAL spec (Common Architecture for Building Applications and Tools) https://www.haskell.org/cabal/proposal/index.html <https://www.haskell.org/cabal/proposal/index.html> Frag (that one Haskell game) https://wiki.haskell.org/Frag Hugs string extensions https://www.haskell.org/hugs/pages/users_guide/here-documents.html <https://www.haskell.org/hugs/pages/users_guide/here-documents.html> I guess darcs/c2hs/happy/alex count, they have history! Bonus points for Makefiles to build the project Professor-HTML project page Hugs support Haskell 1.4 etc. support

9 10

The planned monomorphisation of Data.List
by Tom Ellis 13 Apr '22

13 Apr '22

There is a plan to monomorphise the contents of Data.List. I have written up an executive summary on the GitHub thread where it is being discussed. If you have an opinion that you would like to be taken into account then please leave a comment on that GitHub thread. https://github.com/haskell/core-libraries-committee/issues/22#issuecomment-…

1 0

Re: [Haskell-cafe] ANN: haskell for mathematicians
by Olaf Klinke 10 Apr '22

10 Apr '22

>Dear Olaf, > >On Sat 09 Apr 2022 10:45:56 PM GMT, Olaf Klinke wrote: >> my monograph "Haskell for Mathematicians" has found a home online: >> https://hub.darcs.net/olf/haskell_for_mathematicians > >I just had a first look, your monograph looks awesome! Thank you for >sharing! > >In haskell_for_mathematicians.tex, you mention as a further idea that >Hask is like a Heyting algebra. Could you elaborate on that point? Are >you thinking of types as propositions here? > >Cheers, >Ingo Hi Ingo, Types as propositions is dealt with in haskell_for_logicians.lhs. Hask has an arrow that is a right adjoint, just like a Heyting algebra. It is less clear, however, whether the the arrow gives rise to a partial order as it does in Heyting algebras. I am interested in the complete Heyting algebras, a.k.a. frames a.k.a. locales. Many concepts in point-free topology heavily rely on partial orders and lattice theory, so without a good analogue I would not dare declare a similarity. For example, in a Heyting algebra x <= y iff x -> y equals the top element. But then, what is the top element of Hask? Do we declare x <= y if x -> y is inhabited? That seems to collapse all inhabited types. In a future chapter I would like to tell a story around this: In point-free topology (locale theory), there are several inter-definable concepts of sub-object. One of them is a "nucleus", that is an endo-function j with the following properties. x <= y implies j(x) <= j(y) (j is a functor) x <= j(x) (return :: x -> j x) j(j(x)) <= j(x) (join :: j (j x) -> j x) j(x) /\ j(y) <= j(x /\ y) (liftM2 (,) :: j x -> j y -> j (x,y)) In other words: sub-objects of point-free spaces are (strong) monads. In that respect, every monad j is a sub-object of Hask, and indeed it is: It defines the sub-category (Kleisli j). There are more analogues: The identity function is a nucleus and corresponds to the greatest sub-object, and in Hask (Kleisli Identity) is the largest Kleisli category. Nuclei can not be combined easily, and neither can monads. Another interesting question is: What are the "points" of Hask? A point of a locale is a mapping from opens (types of Hask) to Bool that preserves finite products and arbitrary coproducts, where True is considered as the empty product and False as the empty coproduct. How many of such mappings can be defined in Haskell? How would we implement them? As a class? Type family? GADT? The funny thing about locales is that one can have few or no points but still a rich supply of sub-objects. Olaf

2 1

ANN: haskell for mathematicians
by Olaf Klinke 09 Apr '22

09 Apr '22

Dear Café, my monograph "Haskell for Mathematicians" has found a home online: https://hub.darcs.net/olf/haskell_for_mathematicians The intended audience of this course is mathematicians. While there are many (and excellent) introductions and complete books on Haskell available, most of them target programmers. But Haskell, despite being practically useful, is very good at modelling certain branches of mathematics. The aim of this course is to supplement the pen-and-paper mathematics with a more palpable, more interactive variant of exploring mathematical concepts. Each chapter contains exercises and is a self-contained literate haskell file that requires no package dependencies other than those included in a basic Haskell installation. Selected goodies you can find in Haskell for Mathematicians: * Constructive topology via domain semantics of Haskell * Let the compiler verify theorems of intuitionistic logic * Two implementations of exact real numbers: signed-digit and Conway's surreal numbers * Categories (of course!) * Detailed discussion of mathematical properties of monads such as commutative and affine monads * Detailed derivation of a probability measure monad that is actually affine (unlike sampling-based ones) Please use the darcs issue tracker for reporting typos, strange wording or incaccuracies. Also please don't hesitate to point me to existing work that might be worth mentioning or incorporating in the monograph. Cheers Olaf

3 2

Utrecht Summer School on Advanced Functional Programming 2022
by Swierstra, W.S. (Wouter) 08 Apr '22

08 Apr '22

# Call for Participation SUMMER SCHOOL ON ADVANCED FUNCTIONAL PROGRAMMING Utrecht, the Netherlands, 04 July – 08 July 2022 http://www.afp.school ## ABOUT The Advanced Functional Programming summer school has been running for more than ten years. We aim to educate aspiring Haskell programmers beyond the basic material covered by many textbooks. After running remotely for the past two years, we're thrilled to announce that this year's edition will take place on site in Utrecht. We are monitoring the pandemic closely - and will make contingency plans if we cannot meet in person; at the moment, we do not have plans for remote participation. The lectures will cover several more advanced topics regarding the theory and practice of Haskell programming, including topics such as: * lambda calculus; * monads and monad transformers; * lazy evaluation; * generalized algebraic data types; * type families and type-level programming; * concurrency and parallelism. The summer school consists of a mix of lectures, labs, and a busy social program. ## LECTURERS * Gabriele Keller * Trevor McDonell * Wouter Swierstra ## 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 Soft registration deadline: 24 June, 2022 School: 04 July – 08 July 2022 ## COSTS 750 euro - Profession registration only 250 euro - Student registration fee 200 euro - Housing fee We will charge a registration fee of 750 euros (or 250 euros for students) to cover our expenses. 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://www.afp.school

1 0

Typechecker complains about untouchable types
by rowan goemans 07 Apr '22

07 Apr '22

Hello everyone, I'm running into a type error I don't quite understand why it's happening. Consider this type class and function: ``` class KnownNat n => F (n :: Nat) foo :: forall n. F n => (F n => Proxy n -> Proxy n) -> Int foo f = let _ = f (Proxy @n) in 0 ``` This typechecks with no issues. But once I add an LTE constraint to the type class it won't typecheck and complains about an untouchable type. ``` class (KnownNat n, 1 <= n) => F (n :: Nat) foo :: forall n. F n => (F n => Proxy n -> Proxy n) -> Int foo f = let _ = f (Proxy @n) in 0 ``` with this error: ``` test.hs:11:8: error: • Could not deduce (F n0) from the context: F n bound by the type signature for: foo :: forall (n :: Nat). F n => (F n => Proxy n -> Proxy n) -> Int at test.hs:11:8-58 The type variable ‘n0’ is ambiguous • In the ambiguity check for ‘foo’ To defer the ambiguity check to use sites, enable AllowAmbiguousTypes In the type signature: foo :: forall n. F n => (F n => Proxy n -> Proxy n) -> Int | 111 | foo :: forall n. F n => (F n => Proxy n -> Proxy n) -> Int | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ test.hs:11:8: error: • Couldn't match type ‘n0’ with ‘n’ ‘n0’ is untouchable inside the constraints: F n0 bound by a type expected by the context: F n0 => Proxy n0 -> Proxy n0 at test.hs:11:8-58 ‘n’ is a rigid type variable bound by the type signature for: foo :: forall (n :: Nat). F n => (F n => Proxy n -> Proxy n) -> Int at test.hs:11:8-58 Expected type: Proxy n0 -> Proxy n0 Actual type: Proxy n -> Proxy n • In the ambiguity check for ‘foo’ To defer the ambiguity check to use sites, enable AllowAmbiguousTypes In the type signature: foo :: forall n. F n => (F n => Proxy n -> Proxy n) -> Int | 111 | foo :: forall n. F n => (F n => Proxy n -> Proxy n) -> Int | ^^^^^^^^^^^^^^^^^^^^ ``` Interestingly adding an equality constraint on `n` does also work: ``` class (KnownNat n, 1 ~ n) => F (n :: Nat) foo :: forall n. F n => (F n => Proxy n -> Proxy n) -> Int foo f = let _ = f (Proxy @n) in 0 ``` Anyone have any clue what is going on here? Best regards, Rowan Goemans

3 2

[ANN] Jacinda 1.0.0.0 - a functional text processing language complementing sed, awk, etc.
by Vanessa McHale 07 Apr '22

07 Apr '22

Hi all, I have released the 1.0.0.0 version of Jacinda, an expression-oriented text processing language for the command-line. You can find it here (Linux, mainly): https://github.com/vmchale/jacinda/releases/tag/1.0.0.0 Cheers, Vanessa McHale

2 1