Posts by janiczek@functional.cafe
 (DIR) Post #APdQkX6D0IDVsBGsIS by janiczek@functional.cafe
       2022-11-15T17:35:15Z
       
       1 likes, 0 repeats
       
       @billstclair I do have a work in progress in elm-in-elm to compile down to #hvm, and folks will likely take a look at bolting HVM output to the Haskell #elmlang unofficially. Really exciting!Also, Victor is on Mastodon! @VictorTaelin
       
 (DIR) Post #APfhcwI1Y66HDigMq0 by janiczek@functional.cafe
       2022-11-16T17:50:20Z
       
       0 likes, 0 repeats
       
       @hungryjoe I loved this talk about folds: https://www.youtube.com/watch?v=dSMB3rsufC8Haven't really thought about folds as replacing constructors before that.
       
 (DIR) Post #APfhcx9uJlCZuptOpE by janiczek@functional.cafe
       2022-11-16T18:09:31Z
       
       1 likes, 0 repeats
       
       @hungryjoeRecursion Scheme minesYou have my condolences! ⛏️🏔️
       
 (DIR) Post #APfhczJuHYOAcQaPgm by janiczek@functional.cafe
       2022-11-16T19:42:31Z
       
       0 likes, 0 repeats
       
       @hungryjoe Uh, not yet. Thankfully I will be offline for the rest of the week 😂Recursion schemes look to me like a great puzzle for cold winter evenings, but whenever I tried to use them in the elm-in-elm codebase (so no HKTs) I felt lost very very quick. I understand how some of it gives better code separation, but I feel like it's not for me currently.Anecdotally there are about three people on the Elm Slack who understand, play with and evangelize them 😁
       
 (DIR) Post #APfrN5rFCrZDnsEtZQ by janiczek@functional.cafe
       2022-11-16T20:34:44Z
       
       0 likes, 0 repeats
       
       @billstclair @hungryjoe Recursion (tail or not, mutual or not) is fine and understood.Recursion schemes are a whole another beast though :)
       
 (DIR) Post #APfuADOgAEflHfQeIa by janiczek@functional.cafe
       2022-11-16T22:08:32Z
       
       0 likes, 0 repeats
       
       @billstclair @hungryjoe I am too big of an amateur to give a comprehensive summary but basically they're functions generalizing recursion patterns.One for folds (catamorphism as in "cata"strophe, collapsing N values into one)One for unfolds - building N values from one (anamorphism as in "ana"bolics, building up muscles or something) -- the clearest example I have of that in Elm is Ilias' Tree.unfold, creating a tree from an initial value. They're more useful in Haskell where you can build infinite sequences based on previous items etc.There are some more for various combinations of "what do I want to hold while folding" (current item, whole history so far, etc.). It's a whole zoo! And for me the main question when looking at these is: Why bother 😁
       
 (DIR) Post #APp6YEIDOhiVoC5jg8 by janiczek@functional.cafe
       2022-11-21T08:48:47Z
       
       1 likes, 0 repeats
       
       @fuxoft Erlang - what a lovely mind bender. To me it was perhaps more eye-opening than all the Lisps and their macros. I miss Joe Armstrong...
       
 (DIR) Post #APq6NYZTrAVQfq2Ptw by janiczek@functional.cafe
       2022-11-21T20:01:44Z
       
       0 likes, 0 repeats
       
       The real question is: what do I use for Advent of Code 2022?#adventofcode #adventofcode2022 #elmlang #jakt #hvm #python