I wrote a Markdown to HTML compiler to pickup some Haskell -- it was a really fun project!! I really like the language (although the compiler infrastructure and package manager are lacking compared to Rust). If you have any simple ideas like this for projects I can write to learn even more, please let me know!! I'd love to create something neat in Haskell again to keep learning! submitted by /u/adamthekiwi [visit reddit] [comments ..read more

So I've been using Haskell for a while now, I've gotten the hang of monads, applicatives, lazy evaluation, dabbled in mtl, lenses, and free monads, and I've absolutely loved all of it. But there's one single function that perpetually stumps me and I can't seem to understand how it works, and that's fix. The definition is fix f = let x = f x in x Trying to read through some stackoverflow answers explaining this function the closest I could get to understanding it is that the f passed into fix is infinitely composed with itself like so: x = f . f $ x -- or x = f (f x) x = f . f . f $ x -- or x ..read more

Hello everyone! My company, Functional Software, is recruiting for several Haskell positions in the Stockholm (Sweden) area. If you live in or near Stockholm and want to work with Haskell, don't hesitate to reach out! (Please note that employees must be on-site in Stockholm at least a few days per week) submitted by /u/JohnyTex [visit reddit] [comments ..read more

submitted by /u/jmct [visit reddit] [comments ..read more

submitted by /u/raehik [visit reddit] [comments ..read more

You're given a directed acyclic graph (DAG) represented as a list of edges where each edge is a tuple (source, destination, weight). Implement a Haskell function that finds the longest path in the graph from a given source node to a target node. The longest path is defined as the path with the maximum sum of edge weights. The function should return the length of the longest path and the path itself. Example: Input: Graph: [("A", "B", 2), ("A", "C", 3), ("B", "D", 5), ("C", "D", 7), ("D", "E", 4)] Source: "A" Target: "E" Output: (16, ["A", "C", "D", "E"]) submitted by /u/Witty-Guava26 ..read more

submitted by /u/ysangkok [visit reddit] [comments ..read more

I wrote a .hs file in VSCode and saved it to my desktop it’s called baby-steps.hs and I‘m trying to get ghci on my terminal to read the file with :l baby-steps.hs but sadly I get an error saying it can’t find the file as there is "no location info" .. what do I do? I‘m completely new to Haskell incase that wasn’t obvious:) would appreciate any help! (MacOS, M1 incase that matters) submitted by /u/felix_using_reddit [visit reddit] [comments ..read more

Hello, it's pushing six months since I posted this question originally. While I appreciate the tips from then, I'm still stuck and eager to overcome this problem so that I can move on with my learning. Since then, I have read LYAH and I have read a large chunk of Real World Haskell, yet I still can't overcome this obstacle. I have pondered this problem on and off regularly during this six months. I feel like it is holding me back at this point. As before, this is *not homework*. This is for my own edification. This code won't compile and I don't know how I could bring it to a state where it c ..read more

When typing => or -> occassionally neovim will freeze for multiple minutes and leave no log of issues. I've checked the neovim, treesitter, lsplog, etc. and checkhealth and nothing seems out of the ordinary. stopping treesitter seems to resolve it. I'm using tree-sitter runtime ABI version 14. I'm using nixos so TSUpdate and TSInstall are not gonna work afaik. It happens if I paste the culprit text as well submitted by /u/Proper-Cover-2558 [visit reddit] [comments ..read more