Skip to content

Comment on “I wrote FAT on an airplane, for heaven's sake”parent

Comments

pg's whole thesis for lisp was that it reduces the increasing time of modifying larger codebases to o(log n) rather than o(n^k) or o(n) (n being size of codebase)

That is true of immutability languages like Clojure, O don't see how that is possible for a mutable dynamically typed language like CommonLisp

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.