From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,583275b6950bf4e6 X-Google-Attributes: gid103376,public X-Google-Thread: 1108a1,59ec73856b699922 X-Google-Attributes: gid1108a1,public X-Google-Thread: 11232c,59ec73856b699922 X-Google-Attributes: gid11232c,public X-Google-Thread: fdb77,5f529c91be2ac930 X-Google-Attributes: gidfdb77,public X-Google-ArrivalTime: 2003-05-06 07:47:06 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!newsfeed.stueberl.de!eusc.inter.net!cs.tu-berlin.de!uni-duisburg.de!not-for-mail From: Georg Bauhaus Newsgroups: comp.lang.java.advocacy,comp.object,comp.lang.ada,misc.misc Subject: Re: Using Ada for device drivers? Date: Tue, 6 May 2003 14:47:05 +0000 (UTC) Organization: GMUGHDU Message-ID: References: <9fa75d42.0304230424.10612b1a@posting.google.com> <3EA7E0E3.8020407@crs4.it> <9fa75d42.0304240950.45114a39@posting.google.com> <4a885870.0304291909.300765f@posting.google.com> <416273D61ACF7FEF.82C1D1AC17296926.FF0BFD4934A03813@lp.airnews.net> <1052140321.148445@master.nyc.kbcfp.com> NNTP-Posting-Host: d2-hrz.uni-duisburg.de X-Trace: a1-hrz.uni-duisburg.de 1052232425 9521 134.91.1.15 (6 May 2003 14:47:05 GMT) X-Complaints-To: usenet@news.uni-duisburg.de NNTP-Posting-Date: Tue, 6 May 2003 14:47:05 +0000 (UTC) User-Agent: tin/1.5.8-20010221 ("Blue Water") (UNIX) (HP-UX/B.11.00 (9000/831)) Xref: archiver1.google.com comp.lang.java.advocacy:63200 comp.object:62817 comp.lang.ada:37007 misc.misc:13969 Date: 2003-05-06T14:47:05+00:00 List-Id: In comp.lang.ada Hyman Rosen wrote: : Georg Bauhaus wrote: :> Because people have done something means what? : It means that it can be done. SPITBOL (and SNOBOL4) has been written in assembly language. Can be done. Are languages of its type written in assembly language? You can write functions working on trees or graphs in Fortran 77. Can be done. Do you prefer choosing a language for your recursive matters such that you will have the freedom of managing the stack yourself? :> Because people have not done something means what? : That we do not yet know whether it can be done. Or that they have known it was not a good idea to do it. :> Does that mean anything in a general language comparison? : We're not talking about general language comparisons. : We're talking about a company choosing an implementation : language for a project. So narrow general down to what is best for some project. In particular, the projects mentioned here recently.