GoKawiilBlog post formalizes quine construction via Kleene's second recursion theorem
A software engineer blogged about an attempt to formalize the well-known result that quines follow from Kleene's second recursion theorem, drawing on an existing preprint that carries out the construction in untyped lambda calculus. The post walks through the classical computability-theoretic statement of the theorem and sketches how setting the relevant function to the identity yields a self-referential index resembling a quine.