Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 11/03/84 (WLS Mods); site jendeh.UUCP Path: utzoo!watmath!clyde!burl!ulysses!allegra!princeton!astrovax!fisher!jendeh!arash From: arash@jendeh.UUCP (Arash Farmanfarmaian) Newsgroups: net.news Subject: Re: case sensitive names Message-ID: <149@jendeh.UUCP> Date: Fri, 31-May-85 03:04:02 EDT Article-I.D.: jendeh.149 Posted: Fri May 31 03:04:02 1985 Date-Received: Sat, 1-Jun-85 03:00:57 EDT References: <612@digi-g.UUCP> Distribution: net Organization: The Coalition of United Associations Lines: 47 > [argh] > There are two different sites named 'cfib' and 'cfiB' !? > Also olympus and Olympus. > > Paths are: > ...ihnp4!ima!cfib! > ...ihnp4!masscomp!sii!cfiB! > ...ihnp4!dual!olympus! > ...ihnp4!vax135!Olympus! > > I don't think case-sensitive sitenames should be encouraged. > I mean, what is this, 'C' or something? > > Merlyn Leroy Looks like its my night to bitch on the net. It has been caused by on overindulgeance in champagne, to celebrate the end of the school year in Princeton. Any way, even though I just bitched about the use of Fortran and even Basic (arghhhhh!!) on UNIX, I still think I should pick a bone of contention with Merlyn. Pascal ( at least some of you people out there must have heard about it ) IS case sensitive ( at least I have always seen it as such) and I do believe that 'C' should be so too. At least variable names and site names should be so. I am not going to profess any love for Pascal based languages ( especially after having worked on a stupid version called TPL, which is marketed by Texas Instrument ). Nonetheless I do believe that case sensitivity, especially in a non-programming-language context like news is worth it. Arash Farmanfarmaian'85 P.S.: On this machine e-mail has NOT been re-directed to /dev/null. So any flames are welcome. But do expect them to be answred with venom. And just to fuel to fire let me say something else. I think APL is a viable programming language ( don't bother flamming on this one, unless you have tried to implement any algorithm involving loops, WITHOUT LOOPING in APL, and have succeeded. For your information there is an argument running around the Civil Engineering Department here to the effect that any algorithm can be implemented without looping in APL. No one has been able to prove this; but after sucessfully implementing the 'shortest path', 'any path' and a version of the 'traveling salesman' problem without any looping, in APL, I believe this assertion -- Arash Farmanfarmaian ...!allegra!princeton!jendeh!arash "Any man who lives within his means suffers from a lack of imagination"