Also did this for the Little Schemer, and have started on one for the Seasoned Schemer, in here: github.com/philcrissman...

When I first saw the examples (I'm going through Graham Hutton's "Programming in Haskell") I thought it was pseudocode or something, and we would see the implementations later. Then I tried the examples in ghci and they all just work.

🤯

The fact that this just works blows my mind a little bit:

qsort [] = []
qsort (x:xs) = qsort smaller ++ [x] ++ qsort larger
where
smaller = [a | a <- xs, a <= x]
larger = [b | b <- xs, b > x]

I think it still means the latter. I’ve heard people use terms like “guided coding” for AI assisted coding. If I hear or say “vibe coding” my assumption is the LLM did _all_ the coding.

The posts are up, now.

I’m on time for meetings, does that make me a prompt engineer?

🥸

Since then

- I’ve always wanted that t-shirt
- I always figured I would like Superchunk

But I never did get a Superchunk album, ever.

Thanks for the playlist, here, @hotdogsladies.bsky.social

I saw the book recently, and yes, I _did_ reflexively think of Seveneves… but also “the moon suddenly turns into cheese” is clearly totally different and also hilarious.

One of my roommates way back in the early 90s had Rock & Rule on VHS... great movie.

😂😂😂

Stable partition can be done by recursively performing rotate.

Rotate can be implemented with reverse.

Reverse can be implemented with swap.

It’s not going to be the most efficient, but I really like how this is composed of simpler, smaller algorithms…