­jonoodle­ @ionchy@types.pl

It is with great regret that I announce that I'm thinking about W types and eliminators again

idk about you but that doesn't look like a lognormal distribution to me

I'm done but instead of doing the actual work with the data I've collected I'm going to visualize it in graphs with Racket ​

Nowadays logos are all flat colour sans serif letters. Boring and uninteresting

Perl's logo actually looks pretty cool
It's like a stamp

Networks, machine learning, AI, graphics, distributed computing...

Thinking about how there's entire branches of computer science I know nothing of

lmao someone sent [a, c, a, b] in the Zoom chat for the Haskell course

I know I should write my filesystem script in Python because it's the standard and looking up related tools always yields Python results. But then I'm like "but I could write it in Racket"

e g g 🥚

The problem is that the core of type theory is the function, and in set theory those are... sets
It's all sets

I guess I never made a proper thread for this
Just hopped in halfway to something that sounded like type theory but looked like set theory
No idea what that was about. But I'm wondering if you could define a type theory whose axioms are all set theory ones

Fine. I will write a named function and return it instead of implementing a Y combinator

Back on my nonsense again (trying to write an anonymous recursive function in Scala)

​