I would add Greenspun's tenth rule (law)[1]: Any sufficiently complicated C or Fortran program contains an ad-hoc, informally-specified, bug-ridden, slow imple

I would add Greenspun's tenth rule (law)[1]: Any sufficiently complicated C or Fortran program contains an ad-hoc, informally-specified, bug-ridden, slow implementation of half of Common Lisp. And Beneford's law of controversy [2], which I see around monorepo vs polyrepo, language choices, tabs vs spaces, etc: Passion is inversely proportional to the amount of real information available. [1] https://en.wikipedia.org/wiki/Greenspun%27s_tenth_rule https://en.wikipedia.org/wiki/Greenspun%27s_tenth_rule [2] https://en.wikipedia.org/wiki/Gregory_Benford https://en.wikipedia.org/wiki/Gregory_Benford