Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!security!genrad!grkermit!masscomp!clyde!ihnp4!inuxc!pur-ee!uiucdcs!smu!leff
From: leff@smu.UUCP
Newsgroups: net.mail
Subject: Re: Re: *uucp* addresses - (nf)
Message-ID: <4151@uiucdcs.UUCP>
Date: Fri, 25-Nov-83 22:48:18 EST
Article-I.D.: uiucdcs.4151
Posted: Fri Nov 25 22:48:18 1983
Date-Received: Sun, 27-Nov-83 04:19:22 EST
Lines: 26

#R:menlo70:-18800:smu:14000001:000:679
smu!leff    Nov 24 17:54:00 1983

Re: Unique Names

It seems the problem of having two bars talked to by different things
is in some way equivalent to the PL/1 problem of having two lower
level elements of structures that have the same name, i. e.

dcl 1 thing1, 
      2 a,
        3 c;

dcl 1 thing2,
      2 b,
         3 d,
            4 c;

one can refer to the first c by typing thing1.c or thing1.a.c or a.c;

one can refer to the second c by typinging thing2.c or d.c or b.c;

Not quite sure how this would work in a network, particularly a constantly
changing network but if there is no reference to it should make an
interesting problem for a parallel algorithms class or a thesis project
or something.