News for hackers. Stuff that matters.
Re:The Memory Models That Underlie Programming Languages by pekk on Sunday January 01, 2017 @02:37AM (#13295007)
The internal representations of Python's core types are indeed pointer-heavy ("graph model"), and Python also encourages making references. But Python is not used like C, nor is it used exactly like Lisp; one does not usually increment loop variables, nor base everything on linked lists. If you are writing programs which use NumPy or TensorFlow heavily, you might actually be relying more on parallel array representations.
Re:The Memory Models That Underlie Programming Languages by pg314 on Sunday January 01, 2017 @06:23AM (#13295426)
> nor base everything on linked lists.

It seems your comment implies that Lisp bases everything on linked lists. That is a misconception. As early as Lisp 1.5 (1962), arrays were available (see section 4.4 of [1]).

[1] http://www.softwarepreservation.org/projects/LISP/book/LISP%...

Re:The Memory Models That Underlie Programming Languages by kazinator on Sunday January 01, 2017 @03:32PM (#13297176)
Moreover, the submitted article itself makes it clear that when it says "LISP’s only data-structuring mechanism is something called a cons, which consists of two pointers" it is talking about Lisp 1.0. It also acknowledges that LISP is called Lisp now, too,
Re:The Memory Models That Underlie Programming Languages by lispm on Sunday January 01, 2017 @06:21AM (#13295424)
> nor base everything on linked lists

Lisp doesn't do that either.