On Wed, Apr 10, 2013 at 1:17 PM, Filip Pizlo <fpi...@apple.com> wrote:
> I.e. if you believe that (A) is not a solvable problem, then this > constitutes an argument against ParallelArrays, and not against inferring > that a normal array should behave like a ParallelArray. > > I believe that there are a class of solvable problems for soundness, but it's hard if not impossible to do it generally; that was my main concern. There are certainly languages that make this problem easier, for example (Haskell, J). I agree that the JIT+runtime bailout strategy you discuss gives you more options here. > - Adding hints to the language results in programming models that nobody > uses. Have you ever used OpenMP? > > I'm familiar enough with it. I was referring to things more like "restrict", "const", and "pure" which give you (or the compiler) more guarantees about what it is safe to infer about the parameters and functions. I'm not sure these are the same sorts of things you don't like. > > Hope my answers help! :-) > > Yes, thank you for expounding. -- Dirk
_______________________________________________ webkit-dev mailing list webkit-dev@lists.webkit.org https://lists.webkit.org/mailman/listinfo/webkit-dev
