By "reflection" they mean adding, removing or inserting (>>=) calls while the monad is being interpreted.

@wunidz.bsky.social here ya go. Not the easiest on the eyes but it's what I could make

drive.google.com/file/d/1udxh...

what about buster

calling it 'this' is fun because, as you may have noticed, 'this' takes no arguments. so you're truly recursing on yourself

maybe i should have called 'loop' 'this' for funsies

only 3 is certainly lazy in the stem of the list, so if you want to build an infinite list, you don't have many choices

if your function is called f, then essentially define f like this: (f a = (a :) f (g a)), where g is some function of type (a -> a), assuming a :: a. this technique is used by the sort function found in Data.List (as of writing)

i’ll take a look