Author: larry
Date: Thu Feb  8 09:43:50 2007
New Revision: 13574


Unconjectured the directed hyper semantics on trees per feedback from
GPU-programming lambdafolk via audreyt++.

Modified: doc/trunk/design/syn/S03.pod
--- doc/trunk/design/syn/S03.pod        (original)
+++ doc/trunk/design/syn/S03.pod        Thu Feb  8 09:43:50 2007
@@ -12,9 +12,9 @@
   Maintainer: Larry Wall <[EMAIL PROTECTED]>
   Date: 8 Mar 2004
-  Last Modified: 5 Feb 2007
+  Last Modified: 8 Feb 2007
   Number: 3
-  Version: 99
+  Version: 100
 =head1 Overview
@@ -2682,9 +2682,8 @@
 is one of the ways that you can promise to the optimizer that your
 code is parallelizable.  (The tree visitation above is allowed to
 have side effects, but it is erroneous for the meaning of those side
-effects to depend on the order of visitation.  [Conjecture: we could
-allow dependencies that assume top-down visitation and only leaves
-sibling calls unordered.])
+effects to depend on the order of visitation in any way.  Hyper tree
+visitation is not required to follow DAG semantics, at least by default.)
 Even in the absence of hardware that can do parallel processing,
 hyperoperators may be faster than the corresponding scalar operators

Reply via email to