I'm a software engineer and computer science enthusiast most known for my work on Teloxide and Metalang99 . My interests range over systems programming, backend engineering, compilers, type theory, functional programming, and related things. I occasionally publish posts, participate in conferences, and do open-source…
Visit hirrolot.github.io → On Hacker News Jan 2022 – Feb 2024
Software Engineering 6Programming Languages 4Math & Algorithms 2
The boolean satisfiability problem (“SAT” for short) is arguably the most famous NP-complete problem in theoretical computer science. According to Wikipedia, it is “the problem of determining if there exists an interpretation that satisfies a given Boolean formula ”; or, in simpler terms, if there is at least one…
Once upon a time, my curiosity of dependent types transitioned into an endeavour to learn how they work under the bonnet. Then I found the paper called “A Tutorial Implementation of a Dependently Typed Lambda Calculus” or just “Simply Easy” – and began reading it. However, the affairs happening there were so complex…