3 ms·
> I've been observing something akin to Zawinski's Law ("Every program attempts to expand until it can read mail. Those programs which cannot so expand are repl
by teddyh 6y ago
> I've been observing something akin to Zawinski's Law ("Every program attempts to expand until it can read mail. Those programs which cannot so expand are replaced by ones which can.") but for programming languages:
Even more applicable, in this case, would be Greenspun's tenth rule:
“Any sufficiently complicated C or Fortran program contains an ad hoc, informally-specified, bug-ridden, slow implementation of half of Common Lisp.”
https://en.wikipedia.org/wiki/Greenspun%27s_tenth_rule https://en.wikipedia.org/wiki/Greenspun%27s_tenth_rule
- kazinator 6y agoIt occurs to me that whereas plenty of such C programs have been seen, where can we find such a Fortran program?
- kazinator 6y agoI totally forgot that Lisp's List processing came from Fortran: a system called FLPL. This had the CAR and CDR naming (in an ugly form, with additional prefix and suffix characters: XCARF and XCDRF). https://www.informatimago.com/articles/flpl/flpl.html https://www.informatimago.com/articles/flpl/flpl.html