Liam Goodacre (@goodacre_liam) header
Liam Goodacre (@goodacre_liam) profile picture

Programmer, mainly Haskell, maybe categories. The answer is always an optic. Monads are overrated. Applicatives are underrated. Hyperfunctions confuse me.

London, England
Joined January 2008
Photo by Liam Goodacre (@goodacre_liam)Photo by Liam Goodacre (@goodacre_liam)Photo by Liam Goodacre (@goodacre_liam)Photo by Liam Goodacre (@goodacre_liam)Photo by Liam Goodacre (@goodacre_liam)Photo by Liam Goodacre (@goodacre_liam)Photo by Liam Goodacre (@goodacre_liam)Photo by Liam Goodacre (@goodacre_liam)Photo by Liam Goodacre (@goodacre_liam)Photo by Liam Goodacre (@goodacre_liam)
short and long interleaving via hyperfunctions
3
1
1
4
528
A slither more readable. Even though I can somehow arrive at this, I am still baffled by Hyperfunctions.
1
1
5
89
long interleaving as an implementation of foldMap
11
Continuing to play with Hyperfunctions until I achieve enlightenment. Implementing `\xs -> xs <> 0 : reverse xs`.
2
9
503
`rep f` (with `id` & `.`) works a bit like a caterpillar track; the same hyperfunction comes around again and again.
1
19
Liam Goodacre retweeted
A slither more readable. Even though I can somehow arrive at this, I am still baffled by Hyperfunctions.
1
1
5
89
I can't prove it but I feel like @hensoncompany's "The Dark Crystal" and @Naughty_Dog's "Jak and Daxter" are somehow the same universe.
1
67
Ah, in the short ones: `kickit` can be replaced by `run`. Which is: ``` run :: (a -&> a) -> a run h = invoke h id ``` I didn't need the `rep id` at all.
2
61
heterogeneous zippy foldable of foldables via hyperfunctions github.com/LiamGoodacre/hype… nitter.cf/Jose_A_Alonso/status/1…
Hyperfunctions: Communicating continuations. ~ Donnacha Oisín Kidney, Nicolas Wu. doisinkidney.com/pdfs/hyperf… #Haskell #FunctionalProgramming
1
5
16
1,364
Hyperfunctions: Communicating continuations. ~ Donnacha Oisín Kidney, Nicolas Wu. doisinkidney.com/pdfs/hyperf… #Haskell #FunctionalProgramming
4
2
10
2,476
Inspired by Phil Freeman's (@paf31) water-level Tardis solution, here's an approach using a Day convolution of state, one running forwards the other backwards.
4
4
28
1,878
New algorithm for collaborative text editing just dropped: arxiv.org/pdf/2409.14252
6
47
8
396
37,736
Does this ( sort of alternating (pre-order-)depth-first and breadth-first ) tree walk have a name? I haven't found it anywhere yet. It walks immediate child elements first, and then each of their entire sub-trees, recursively.
6
1
19
4,278
Hehe, Walk the tree once but process each entry in an order determined by the entries themselves. Implemented via an enhanced FreeAp which maintains sorting via a key (entries at equal keys combine directly).
4
1
4
704
Using a `traverseWithLevel` operation, we can recover a breadth-first walk by using the level as the sorting key in a SortedAp.
3
166
Heh this one is fun, with a couple flips we get a kind of post-order version of the above.
1
422
Liam Goodacre retweeted
Read about an exciting new technique @mpickering_ and Zubin have been developing for profiling memory usage of Haskell programs: well-typed.com/blog/2024/01/…
8
1
34
3,403