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,4c86cf2332cbe682
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-02-09 21:26:58 PST
Path: 
 swrinde!howland.reston.ans.net!vixen.cso.uiuc.edu!uwm.edu!news.alpha.net!news.mathworks.com!zombie.ncsc.mil!admii!cmcl2!thecourier.cims.nyu.edu!thecourier.cims.nyu.edu!nobody
From: dewar@cs.nyu.edu (Robert Dewar)
Newsgroups: comp.lang.ada
Subject: Re: Passive tasks (was: bounded strings)
Date: 9 Feb 1995 20:51:44 -0500
Organization: Courant Institute of Mathematical Sciences
Message-ID: <3hegrg$fbu@gnat.cs.nyu.edu>
References: <EMERY.95Jan30091540@goldfinger.mitre.org>
 <D3Bqzw.D12@inmet.camb.inmet.com> <3grvi1$jvm@gnat.cs.nyu.edu>
 <3hankdINN5d1@marble.summit.novell.com>
NNTP-Posting-Host: gnat.cs.nyu.edu
Date: 1995-02-09T20:51:44-05:00
List-Id: <comp.lang.ada>

Jonothan Shilling says that Telsoft marketed a compiler with passive
task optimization. Is this true, because my impression was that they
had talked about it but did not actually do it. If this impression is
wrong, I would like to be corrected (by someone who has definitely seen 
and used such a product)