olligobber @olligobber@mathstodon.xyz

I made a regex to match all multiples of 7, but it was >10,000 characters so grep couldn't handle it.

I wanted to write a prime generator, but all the popular languages already have optimised ones I can't compete with.

++[>++<[->>+>+<<<]>>>[-<<<+>>>]<<[->->+<<]>>[-<<+>>]<[[>[->+>+>+<<<]>>>[-<<<+>>>]<[<->[-<->]]<+[<<<[->>+>>+<<<<]>>>>[-<<<<+>>>>]<-]<<->-<]>[->+>+>+<<<]>>>[-<<<+>>>]<[<->[-<->]]<+[<<<[-]<[->+>+<<]>>[-<<+>>]<->>>>-<-]<[-]<<+<[->>+>+<<<]>>>[-<<<+>>>]<<[->->+<<]>>[-<<+>>]<]<[-]>>>>+[<<<<<.>>>>>-]<<<<<+]

commented version: https://gist.github.com/olligobber/0445a1721eb22b1d5b65bb4d4becdbf6

Credit: https://github.com/spdskatr

Exp is a homomorphism: exp (x+y) == exp x * exp y

Found some more:
Total ordering: x < y or x == y or x > y
Negatives: x - x == 0
More associativity: x * (y * z) == (x * y) * z
Inverses: 1/x * x == 1
Distributivity: x*(y+z) == x*y + x*z

Rules I've found that floating point numbers disobey:
substitution: x == y => f(x) == f(y)
reflexivity: x == x
associativity: (x + y) + z == x + (y + z)

"Haskell is a dynamically-typed, interpreted language." https://aphyr.com/posts/342-typing-the-technical-interview

Since when was it spelled quaternion instead of quaRternion?

The BubbleT comonad transformer: https://github.com/spdskatr/BubbleT

I just found a new favourite monad: the non-deterministic state monad! https://gist.github.com/olligobber/9f853ed210beec3e4a7fbc7941f4fc11

"I prove a lot with induction because it’s obviously false and hence quite powerful" - @frobunnius@twitter.com

Since Haskell → C and C → BF compilers presumably exist, I have an Iota → Lambda compiler, and I'm gonna write BF → Iota and Lambda → Tex compilers, that means Haskell → Tex will be a thing. Convenient!

So, turns out LaTeX is a lazy functional language... https://gist.github.com/olligobber/e044c87a834b34bc74d8c8903b0b0d94