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

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

I found a way to revert your python version from 3 to 2!

Moral of the story: add tests to your code so you find the errors earlier rather than later

Fixed. I wrote Left instead of Right. https://github.com/olligobber/DirectProof/commit/32cda016f41ce1b5df96c2ec3fec0d33eb033c12#r52648834

So I just tried to prove this on a whim and my proof generator gave an error it's never supposed to give...
https://mathstodon.xyz/@logicbot/106464647817299861
https://github.com/olligobber/DirectProof/issues/1