RSS Parrot

BETA

🦜 blog :: Brent -> [String]

@byorgey.github.io.blog@rss-parrot.net

I'm an automated parrot! I relay a website's RSS feed to the Fediverse. Every time a new post appears in the feed, I toot about it. Follow me to get all new posts in your Mastodon timeline! Brought to you by the RSS Parrot.

---

Brent Yorgey's academic blog

Your feed and you don't want it here? Just e-mail the birb.

Site URL: byorgey.github.io/blog

Feed URL: byorgey.github.io/blog/rss.xml

Posts: 12

Followers: 1

Monads are not like burritos

Published: June 16, 2025 00:00

Monads are not like burritos Posted on June 16, 2025 Tagged monad, pedagogy, meme, burrito, analogy, Haskell In January 2009, while just a baby first-year PhD student, I wrote a blog post titled Abstraction, intuition, and the “monad…

Introduction to competitive programming in Haskell

Published: June 10, 2025 00:00

Introduction to competitive programming in Haskell Posted on June 10, 2025 Tagged Kattis, competitive programming, haskell A few days ago I gave a talk at ZuriHac 2025 entitled Haskell for Competitive Programming, a basic introduction…

Hendrix College Programming Contest 2025

Published: March 13, 2025 00:00

Hendrix College Programming Contest 2025 Posted on March 13, 2025 Tagged competitive programming, Hendrix, programming, contest, HCPC, Kattis I haven’t written on here in a while, mostly because a lot of my time has gone into preparing…

You could have invented Fenwick trees

Published: January 23, 2025 00:00

You could have invented Fenwick trees Posted on January 23, 2025 Tagged Haskell, segment, Fenwick, tree, JFP, journal, paper My paper, You could have invented Fenwick trees, has just been published as a Functional Pearl in the Journal…

Competitive Programming in Haskell: stacks, queues, and monoidal sliding windows

Published: November 27, 2024 00:00

Competitive Programming in Haskell: stacks, queues, and monoidal sliding windows Posted on November 27, 2024 Tagged challenge, Kattis, stack, queue, sliding window, monoid Suppose we have a list of items of length \(n\), and we want to…

Competitive Programming in Haskell: Union-Find, part II

Published: November 18, 2024 00:00

Competitive Programming in Haskell: Union-Find, part II Posted on November 18, 2024 Tagged challenge, Kattis, union-find In my previous post I explained how to implement a reasonably efficient union-find data structure in Haskell, and…

Competitive Programming in Haskell: Union-Find

Published: November 2, 2024 00:00

Competitive Programming in Haskell: Union-Find Posted on November 2, 2024 Tagged challenge, Kattis, union-find Union-find A union-find data structure (also known as a disjoint set data structure) keeps track of a collection of…

MonadRandom: major or minor version bump?

Published: October 14, 2024 00:00

MonadRandom: major or minor version bump? Posted on October 14, 2024 Tagged Hackage, MonadRandom, random, version, PVP tl;dr: a fix to the MonadRandom package may cause fromListMay and related functions to extremely rarely output…

Decidable equality for indexed data types

Published: September 9, 2024 00:00

Decidable equality for indexed data types Posted on September 9, 2024 Tagged agda, equality, indexed Recently, as part of a larger project, I wanted to define decidable equality for an indexed data type in Agda. I struggled quite a…

Competitive Programming in Haskell: tree path decomposition, part II

Published: August 8, 2024 00:00

Competitive Programming in Haskell: tree path decomposition, part II Posted on August 8, 2024 Tagged challenge, Kattis, number theory, tree, path, decomposition In a previous post I discussed the first half of my solution to…