Siddharth Mishra

Alright!

This will be a series of posts because I want this to be as practical as possible, and beacuse of that an attempt to capture this all in a single post would be something that I’m only ever going to do when I’m not in my right mind.

This post is coming very late.

links@random Few months back I noticed that some of my peers randomly post a link to an amazing writeup or an interesting news, and my question after reading that content would be “How did they even come across this?”.

Info This post is about self reflection, and methods I think (will/are) work(ing) for me.

Introduction I’m in a paper reading group for class.

Introduction C doesn’t have templates, but it does have the preprocessor.

Introduction Polymorphism sounds like a C++ word.

Introduction I’ve been developing and maintaining a Rizin plugin for past ten months for a startup, RevEngAI.

Logic If, Else Let’s build some boolean login out of power of pure combinations.

Free & Bound Variables A variable occurrence is bound if it lies inside the scope of some $\lambda$ that binds it.

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).

This section is important, because we’ll learn how are applications performed on given lambda expressions.