tomneo
- Karma
- 24
- Created
- November 27, 2009 (16y ago)
- Submissions
- 0
- Tarski's undefinability theorem (en.wikipedia.org)
- Readable Perl (compared to lang*) (greenokapi.net)
NO FLAMES PLEASE. Another i++ of perl's <blah> is not required. What have been the successful trade-offs interms of readability in <language>? CPAN Power…
- Scientific Calculator Hacking Tips (nayuki.eigenstate.org)