A Personal Coding Standard I’ve been working on improving my coding stlye for past few years and I think now I’ve realized it. My main goal was to make programming in C easier like it is in other languages. I realized that the only thing that makes C hard to sometimes work with is lack of good libraries. Unlike other languages that provide an open-source well written and maintained library for almost anything you want to do, C does not have something like that, even though it’s one of t...| Posts on Siddharth Mishra
For some reason (i don't know why) I have super duper interest in decompilers| Siddharth Mishra
This section is important, because we’ll learn how are applications performed on given lambda expressions. Information TL;DR, to apply a lambda term in a lambda expression, we use a series of reductions. These reductions come from corresponding equivalence relations. A reduction is just another way of replacing the lambda expression with a corresponding equivalent expression. Equivalence When considering equivalence of two expressions, they can be equivalent in four ways $\alpha$-equivalenc...| Posts on Siddharth Mishra
Disclaimer TODO| Posts on Siddharth Mishra
Logic If, Else Let’s build some boolean login out of power of pure combinations. Unlike usual logic, we won’t get true/false as values. Here true and false are lambda abstractions itself. $\text{True} \stackrel{\beta}{=} \lambda xy.x$ - Meaning, take two values, and evaluate to only the first one. $\text{False}\stackrel{\beta}{=} \lambda xy.y$ - Take two, and evaluate to only the second one, discarding the first. These are often called $\text{First}$ and $\text{Second}$ correspondingly fo...| Posts on Siddharth Mishra
Fixed Point Theorem $ \forall F \quad \exists X \mid FX = X $ For all lambda expression $F$, there exists another lambda expression $X$, such that $FX = X$, meaning when $F$ is applied over $X$ we get $X$ (itself). Let’s take $F = \lambda x . x$ (the identity abstraction), Then any lambda expression can take place of $X$. Now consider $F = \lambda x . y$, then we have $X \equiv y$, because $(\lambda x . y)y = y$. If $F = \lambda x . xy$, then? Then can use $X \stackrel{\beta}{=} \lambda y ....| Posts on Siddharth Mishra
I recently started a new project where I had to decide (again) how to build this project. This decision is faced by any developer who use a language that does not have a standard way of building things. In my case, my project is to be written in C, my go-to language, and as we all know, it does not have any standard other than the standard spec. I usually go with CMake, as my go-to build system, because I’ve seen many projects use it. It’s almost like the “industry” standard. It’s v...| Posts on Siddharth Mishra
Independent Git Service| Siddharth Mishra
Nectar of lessons learned after working on a Rizin plugin for past ten months| Siddharth Mishra
Notes On Lambda Calculus| Siddharth Mishra