thaliaarchi

9 ms·

1. 61.▲
   by thaliaarchi 3y ago

   Haskell is notoriously difficult to reason about runtime performance, but that is due to its lazy evaluation, not because it is functional. Lazy evaluation can cause hidden space leaks, where expressions have not yet been evaluated, so main
2. 62.▲
   by thaliaarchi 3y ago

   I think there are varying levels of assurance that developers need while writing software. I tend towards stricter languages with more guarantees, like Rust with its borrow checker and Coq with its powerful types and proofs. This doesn&#x27
3. 63.▲
   by thaliaarchi 3y ago

   Author here! I had a hunch that the typeclass resolution engine in the Coq typechecker could be Turing-complete, so I proved it by implementing a variant of Brainfuck in it. Feedback welcome.
4. 64.▲
   Coq typeclass resolution is Turing-complete(thaliaarchi.github.io)

   90 points by thaliaarchi 3y ago|24 comments
5. 65.▲
   by thaliaarchi 4y ago

   I find the stateless streaming paradigm in jq very pleasing. Results can be emitted iteratively using generators, which are implemented as tail-recursive streams [0]. Combined with the `input` built-in filter, which yields the next item in
6. 66.▲
   by thaliaarchi 5y ago

   Sounds like the Nand to Tetris course, gamified. https://www.nand2tetris.org/