27 ms·
> ... when exactly it's not considered "married"? Easy to test on a case-by-case basis -- either a person can or can't drop one language and become productive
by lutusp 13y ago
> ... when exactly it's not considered "married"?
Easy to test on a case-by-case basis -- either a person can or can't drop one language and become productive in another in a short time. If they can, then they're not married to a single language, unlike cybernetic swans who mate for life.
- coldtea 13y agoWell, what if Torvalds can't get productive in Lisp or Haskell? Does that make him any less of a programmer?