Category Archives: haskell

Swarm 0.4 release

Posted on August 22, 2023 by Brent

The Swarm development team is very proud to announce the latest release of the game. This should still be considered a development/preview release—you still can’t save your games—but it’s made some remarkable progress and there are lots of fun things … Continue reading →

Posted in haskell, projects | Tagged , , , , | Leave a comment

Compiling to Intrinsically Typed Combinators

Posted on July 13, 2023 by Brent

tl;dr: How to compile a functional language via combinators (and evaluate via the Haskell runtime) while keeping the entire process type-indexed, with a bibliography and lots of references for further reading There is a long history, starting with Schönfinkel and … Continue reading →

Posted in haskell | Tagged , , , , , , | 6 Comments

Competitive Programming in Haskell: two more DP challenges

Posted on June 20, 2023 by Brent

Continuing the series on dynamic programming, I just have a couple challenge problems for you today. I have indeed solved both of these problems in Haskell, but I don’t yet know how to write elegant solutions! There is a reason … Continue reading →

Posted in competitive programming, haskell | Tagged , , , | 7 Comments

Nested folds

Posted on June 17, 2023 by Brent

I’m finally getting around to reading Algorithm Design with Haskell (hereafter abbreviated as ADH), by Jeremy Gibbons and Richard Bird. I’ve had it for a while, and I have no excuse for waiting this long to read it, but anyway. … Continue reading →

Posted in haskell | Tagged , , , , | 3 Comments

Dynamic programming in Haskell: automatic memoization

Posted on June 6, 2023 by Brent

This is part 2 of a promised multi-part series on dynamic programming in Haskell. As a reminder, we’re using Zapis as a sample problem. In this problem, we are given a sequence of opening and closing brackets (parens, square brackets, … Continue reading →

Posted in competitive programming, haskell | Tagged , , , | 4 Comments

Dynamic programming in Haskell: lazy immutable arrays

Posted on June 2, 2023 by Brent

This is part 1 of a promised multi-part series on dynamic programming in Haskell. As a reminder, we’re using Zapis as a sample problem. In this problem, we are given a sequence of opening and closing brackets (parens, square brackets, … Continue reading →

Posted in competitive programming, haskell | Tagged , , , | 2 Comments

Competitive programming in Haskell: introduction to dynamic programming

Posted on May 31, 2023 by Brent

In my previous post, I challenged you to solve Zapis. In this problem, we are given a sequence of opening and closing brackets (parens, square brackets, and curly braces) with question marks, and have to compute the number of different … Continue reading →

Posted in competitive programming, haskell | Tagged , , , | 8 Comments

Competitive programming in Haskell: parsing with an NFA

Posted on May 24, 2023 by Brent

In my previous post, I challenged you to solve Chemist’s Vows. In this problem, we have to decide which words can be made by concatenating atomic element symbols. So this is another parsing problem; but unlike the previous problem, element … Continue reading →

Posted in competitive programming, haskell | Tagged , , , , | 12 Comments

New ko-fi page: help me attend ICFP!

Posted on May 22, 2023 by Brent

tl;dr: if you appreciate my past or ongoing contributions to the Haskell community, please consider helping me get to ICFP by donating via my new ko-fi page! Working at a small liberal arts institution has some tremendous benefits (close interaction … Continue reading →

Posted in haskell, meta | Tagged , , , , , | Leave a comment

Competitive programming in Haskell: tries

Posted on May 3, 2023 by Brent

In my previous post, I challenged you to solve Alien Math, which is about reading numbers in some base , but with a twist. We are given a list of strings representing the names of the digits through , and … Continue reading →

Posted in competitive programming, haskell | Tagged , , , | 2 Comments