In this post, we discuss the Y Combinator (no, not the company!) and attempt to gently introduce you to the derivation of the construct through small bite-sized refactoring steps done on a simple recursive function.
Badges
Badges come from GitHub once the author claims this feed.
Recent posts
every link opens the author’s post-
Y Combinators for Fun and (No) Profit
-
Asking Z3 About COBOL Programs
A static analyser can list the tests on the way to a statement.
-
Automated domain object candidate extraction in COBOL using matrix factorisation
This post how to use non-negative matrix factorisation (NMF) as an extremely fast first-pass technique (when combined with byte-level dataflow analysis) to find domain object candidates when reverse engineering a legacy COBOL codebase.
-
Short Notes on Classical Machine Learning: Deriving the Logistic Regression Curve
In this post, I take a look at the basic idea of why the logistic regression’s familiar S-curve exists, its relation to the familiar concept of probability, and how framing probability as the logarithm of odds naturally leads to a representation amenable to linear regression.