Y
Hacker News
new
|
ask
|
show
|
jobs
by
jaggederest
4630 days ago
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)
1 comments
judk
4630 days ago
That is true of immutability languages like Clojure, O don't see how that is possible for a mutable dynamically typed language like CommonLisp
link