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-Thread: 103376,590b710e61b9ddf8
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII
Received: by 10.68.135.231 with SMTP id pv7mr12192644pbb.8.1329214044907;
        Tue, 14 Feb 2012 02:07:24 -0800 (PST)
Path: 
 wr5ni23571pbc.0!nntp.google.com!news2.google.com!postnews.google.com!x19g2000yqh.googlegroups.com!not-for-mail
From: Erich <john@peppermind.com>
Newsgroups: comp.lang.ada
Subject: Re: Concurrency always is non-deterministic?
Date: Tue, 14 Feb 2012 02:05:51 -0800 (PST)
Organization: http://groups.google.com
Message-ID: 
 <0dbc36f5-15f6-4b47-808c-d19d5ac72cba@x19g2000yqh.googlegroups.com>
References: <3721724.784.1329154891821.JavaMail.geo-discussion-forums@pbcwt9>
 <6f19eaa9-c75f-4fca-86d4-bfaee2f51db7@k40g2000yqf.googlegroups.com>
NNTP-Posting-Host: 85.242.122.141
Mime-Version: 1.0
X-Trace: posting.google.com 1329214044 431 127.0.0.1 (14 Feb 2012 10:07:24
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Tue, 14 Feb 2012 10:07:24 +0000 (UTC)
Complaints-To: groups-abuse@google.com
Injection-Info: x19g2000yqh.googlegroups.com; posting-host=85.242.122.141;
 posting-account=nd46uAkAAAB2IU3eJoKQE6q_ACEyvPP_
User-Agent: G2/1.0
X-Google-Web-Client: true
X-Google-Header-Order: HUALENKC
X-HTTP-UserAgent: Mozilla/5.0 (X11; Ubuntu; Linux x86_64; rv:10.0)
 Gecko/20100101 Firefox/10.0,gzip(gfe)
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Date: 2012-02-14T02:05:51-08:00
List-Id: <comp.lang.ada>

On Feb 14, 2:18=A0am, Phil Clayton <phil.clay...@lineone.net> wrote:

> functional programming is unsuitable for systems
> that are any of: real-time, embedded or critical

The first two points, yes, but what about the third. Haven't
functional programming languages like Haskell been used for critical
(high-integrity) applications as a substitute for Ada/Spark, because
they make formal verification very easy?

I'm not claiming it, just believe I've read about it and ask as a
layman out of curiosity.