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,a00006d3c4735d70 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2004-01-14 04:48:32 PST Path: archiver1.google.com!news2.google.com!news.maxwell.syr.edu!news-han1.dfn.de!news-ham1.dfn.de!news.uni-hamburg.de!cs.tu-berlin.de!uni-duisburg.de!not-for-mail From: Georg Bauhaus Newsgroups: comp.lang.ada Subject: Re: Certified C compilers for safety-critical embedded systems Date: Wed, 14 Jan 2004 12:48:32 +0000 (UTC) Organization: GMUGHDU Message-ID: References: <0F6Nb.1623$Tt.642@reader1.news.jippii.net> NNTP-Posting-Host: l1-hrz.uni-duisburg.de X-Trace: a1-hrz.uni-duisburg.de 1074084512 1798 134.91.1.34 (14 Jan 2004 12:48:32 GMT) X-Complaints-To: usenet@news.uni-duisburg.de NNTP-Posting-Date: Wed, 14 Jan 2004 12:48:32 +0000 (UTC) User-Agent: tin/1.5.8-20010221 ("Blue Water") (UNIX) (HP-UX/B.11.00 (9000/800)) Xref: archiver1.google.com comp.lang.ada:4391 Date: 2004-01-14T12:48:32+00:00 List-Id: Aatu Koskensilta wrote: : Because it seems flat out wrong. That : : [any compiler for a resonable language] either does not accept some : legal programs, accepts some illegal programs, or never halts for some : inputs : : does not in any sense follow from G?del's proof. The only way for it to : be true is if "reasonable language" is defined as a language that is : compile-time Turing-complete. Most languages currently in use are not. Can a self-hosting compiler then in theory decide whether it is correct? For the former or the latter languages? -- Georg