using lists to purrfurm nodeterministic computations is very confusing the furst time you see it

Show thread

my introduction to parser combinators was via a purrofessor translating ideas from Computational Semantics with Functional Programming from Haskell into OCaml, and used syntax extensions from a third party library to copy the list comprehensions used in the book and i was so confused by the behavior

i wonder if ocaml with the flambda optimizer can unroll an applicative functor application and purrevent the creation of a closure

total distortion game over song (i’ve never played that game)

oh right, grep isn’t IN coreutils, it’s a sepurrate package

Show thread

i wonder if uutils grep uses a DFA fur regexp matching like GNU grep (correctly) does

viscerally recognizing the impurrtance of good algorithms by building tooling to cheat at cryptic clues

update: Darwin's grep is unfathomably slow at this. GNU grep is pretty fast at it

Show thread
Show older
📟🐱 GlitchCat

A small, community‐oriented Mastodon‐compatible Fediverse (GlitchSoc) instance managed as a joint venture between the cat and KIBI families.