Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!lavaca.uh.edu!menudo.uh.edu!sugar!ficc!peter
From: peter@ficc.ferranti.com (Peter da Silva)
Newsgroups: comp.lang.misc
Subject: Re: C's sins of commission
Message-ID: <=GH6UHD@xds13.ferranti.com>
Date: 17 Oct 90 18:02:03 GMT
References: <64618@lanl.gov) <2883@igloo.scum.com) <2171@enea.se> <1990Oct8.135551.21639@arnor.uucp> <1990Oct10.101527.2247@maths.nott.ac.uk> <1990Oct15.204343.2907@arnor.uucp>
Reply-To: peter@ficc.ferranti.com (Peter da Silva)
Organization: Xenix Support, FICC
Lines: 12

In article <1990Oct15.204343.2907@arnor.uucp> lowry@lusitania.watson.ibm.com (Andy Lowry) writes:
> The Hermes programmer could represent a graph precisely in the
> standard conceptual manner--as a collection of nodes and a collection
> of arcs, where each arc is a record containing two node id's.

...each of which node-ids is a pointer, no? It's not a machine address, but
its an identifier that can reference any arbitrary node... it's a pointer
into a bounded collection of objects, but you still have to worry about
aliasing within that collection. The problem of aliasing is alleviated,
but not solved.

(basically, you've switched from C to lisp)
-- 
Peter da Silva.   `-_-'
+1 713 274 5180.   'U`
peter@ferranti.com