This is How to Build Haskell with GNU Make (and why it’s worth trying)In a previous article I showed the GHC commands you need to compile a basic Haskell executable without explicitly using the source files…Apr 17, 2023Apr 17, 2023
How to Make ChatGPT Go Around in Circles (with GHC and Haskell)As part of my research for the recently released (and free!) Setup.hs course, I wanted to explore the different kinds of compilation…Apr 10, 20231Apr 10, 20231
Published inQuick CodeHow to Stump ChatGPT in 1 Easy Step (Hint: Ask a Windows Question)While doing some research for Setup.hs, my new free course, I confronted a fact of Haskell development with Stack.Apr 3, 2023Apr 3, 2023
New Free Course: Setup.hs!You can read all the Haskell articles you want, but unless you write the code for yourself, you’ll never get anywhere! But there are so…Mar 27, 2023Mar 27, 2023
An Unusual Application for DijkstraToday will be the final part of our work on Dijkstra’s algorithm! We’ll go over a complete solution from the Advent of Code problem…Dec 18, 2022Dec 18, 2022
Dijkstra with MonadsLast time on this series, we considered this library version of Dijkstra’s algorithm that you can find on Hackage.Dec 17, 2022Dec 17, 2022
Dijkstra Comparison: Looking at the Library FunctionIn the last few articles I’ve gone through my approach for generalizing Dijkstra’s algorithm in Haskell. The previous parts of this series…Dec 16, 2022Dec 16, 2022
Dijkstra in a 2D GridWe’ve now spent the last few articles looking at implementations of Dijkstra’s algorithm in Haskell, with an emphasis on how to generalize…Dec 15, 2022Dec 15, 2022
Dijkstra with Type FamiliesIn the previous part of this series, I wrote about a more general form of Dijkstra’s Algorithm in Haskell. This implementation used a…Dec 14, 2022Dec 14, 2022
Generalizing Dijkstra’s AlgorithmEarlier this week, I wrote a simplified implementation of Dijkstra’s algorithm. You can read the article for details or just look at the…Dec 13, 2022Dec 13, 2022
