nomeata

nomeata, 9 months ago to random

At my talk at #ICFP2023 I claimed that with observable sharing one can write a parser combinator library where left-recursion works (in the presence of sharing), and someone asked if I had, and I had to admit I hadn’t, so the next day I did:
https://www.joachim-breitner.de/blog/807-Left_recursive_parser_combinators_via_sharing
#Haskell

nomeata, 10 months ago to random

The HaskelI Interlude just published a nice interview of Ranjit Rhala by Andres Löh and Matthías Páll Gissurarson:
https://haskell.foundation/podcast/32
#haskell

nomeata, 11 months ago to random

Someone once said that laziness is what kept #Haskell pure, and that's the actually relevant feature. This makes we wonder: will theorem proving languages like #lean, where logical consistency is what keeps them pure, deliver the same elegant experience, while avoiding some downsides of laziness (complex runtime, complicated performance characteristics)?

nomeata, 11 months ago to random

A Github Action to create PRs that bump the upper bounds of the dependencies in your #haskell cabal files, brought to you by #MuniHac:
https://github.com/nomeata/haskell-bounds-bump-action