13 comments

[ 3.7 ms ] story [ 36.9 ms ] thread
Page 10. A description of a linked list, and the memory structures required to intermingle them.

Incredibly simple, powerful, and to my eyes, beautiful.

Reading this I get an urge to reach back in time and tell the author about all the amazing programs and languages this work will lead to, about Emacs, Scheme, Clojure, ...
He found out. Not sure he used any Clojure.
It [the language] is not so convenient for representing lists of fixed length where one frequently wants the nth element where n is computed rather than obtained by adding 1 to n-1.

I find this is an interesting way of saying it, it made me think for a moment..

Reading this my eye was caught by the name Gelernter. Wait, wasn't that the guy who... no, it was his father, Herbert[1], who

> implemented, with Nathaniel Rochester, a computer language for list processing within FORTRAN ... the Fortran list processing language (FLPL)

His son David, who would have been 3yo at the time McCarthy wrote this paper, has had his own effect on computer science[2].

[1] https://en.wikipedia.org/wiki/Herbert_Gelernter

[2] https://en.wikipedia.org/wiki/David_Gelernter

Another classic paper by John McCarthy, the father of Lisp and much of early AI.