On Sat, Feb 28, 2015 at 09:19:54AM -0800, Robert Ferguson wrote:
On Feb
28, 2015, at 3:35 AM, Peter Corlett <abuse at cabal.org.uk> wrote:
APL's cryptic syntax is not a feature; if you want that, you know where to
find Perl or Clojure.
Your homework assignment is to read Ken Iverson?s Turing
Award lecture, write
a book report, and bring it to class for next time.
Oh, alright then :)
I have skimmed quite a lot of it as it's quite long and I don't actually care
to learn APL, but it has a few central points that fit in a few pages, with 50
pages of exposition:
Well done.
I look forward to your thoughtful and modest critiques of other Turing award winners
life's work.