Athas

51 ms·

481.
by Athas 10y ago
(Author here.) OCaml would be an even more apt comparison. I find it a bit ironic that of all the related submissions I (and others) have made, it's the one with the bizarre title that hits the front page!
482.
by Athas 10y ago
Any array combinator (most importantly map, scan, reduce, and filter) are executed on the GPU (or whatever parallel execution platform is used).
483.
by Athas 10y ago
Is there an overview of what kind of challenges prevent the inclusion of modules? I don't do much C++ anymore, but I've done a fair bit of work on module systems, and they've never seemed that complicated to me. (I worry th
484.
by Athas 10y ago
I am intrigued by this snippet from the README: type messages 'x = 'x | Fetch pid 'x This appears to define a sum type where one of the variants is left with an implicit constructor. How do you pattern match on that
485.
by Athas 10y ago
Compared to Go, OCaml is unfortunately a rather large language. It has many non-orthogonal features, some of which are not used widely. The impression I get from Go programmers is that the small size of the language is one of the chief at
486.
by Athas 10y ago
Turning the recursive formulation of the Fibonacci function into an iterative loop is not easy for a compiler (unless you just program that specific pattern into it). However, this "benchmark" is totally dominated by function call
487.
by Athas 10y ago
GNU APL is unusually polished considering how obscure it is. When I was first looking for a free APL implementation some years ago, it took me quite a while to find it via search engines. It also doesn't seem like it's very visi
488.
by Athas 10y ago
Apologies for tooting my own horn, but I have made a language that compiles to vectorised code: https://futhark-lang.org You don't really need much in the way of fancy language features. If you take a simplified functional
489.
Patterns – Active Events: One Design Pattern Instead of a Dozen(msdn.microsoft.com)
2 points by Athas 10y ago|0 comments
490.
by Athas 10y ago
Yes, as part of my PhD I have built a parallel functional language that can run on GPUs: https://futhark-lang.org
491.
by Athas 10y ago
This makes no sense if you want the missiles to work as a deterrent. I'm quite sure North Korea isn't actually planning on going to war (and winning it); they just want to give the impression that going to war would be too costly
492.
by Athas 10y ago
Amdahl's Law is easy to misapply on both sides of the fence. If what you care about is mostly weak scaling (using larger machines to solve larger problems), the Law is not as harsh as it appears at first glance, as in many cases the p
493.
by Athas 10y ago
How come reviewers let this stuff pass in papers? While some of the issues are subtle (inventing more work or mangling the algorithm), some of the graph-based tricks are pretty obvious.
494.
Rosetta Code – unlocking the mysteries of programming languages(medium.freecodecamp.com)
2 points by Athas 10y ago|0 comments
495.
Attacking the Windows Nvidia Driver(googleprojectzero.blogspot.com)
2 points by Athas 10y ago|0 comments
496.
by Athas 10y ago
The problem isn't the fact that it's a coprocessor, I think. NVIDIA GPUs are all coprocessors, and they are wildly successful.
497.
by Athas 10y ago
This is exactly why lazy evaluation is often described as control-flow. Lazy evaluation permits efficient composition, without doing extra work (although the constant factors become much larger).
498.
“How” ages faster than “Why”(hackernoon.com)
2 points by Athas 10y ago|0 comments
499.
by Athas 10y ago
Said software can still be run using emulators, can it not? There is lots of (well, some) potentially useful software out there that only runs on machines no longer in production. A good solution is also to make source code freely availab
500.
by Athas 10y ago
> In addition, the last number of the sequence indicates the count of the members. This is only the case for 1..N, not for I..J, when 'I' is not one. In this general case, the number of elements is 'J-I' if using zer
501.
The Futhark Module System(futhark-lang.org)
1 points by Athas 10y ago|0 comments
502.
Testing in the D standard library(dlang.org)
2 points by Athas 10y ago|0 comments
503.
A pure functional language compiling to GPU(futhark-lang.org)
1 points by Athas 10y ago|0 comments
504.
by Athas 10y ago
It's not going to be easy, I agree. Matching hand-optimized hand-written code written by experts is not realistic for single primitives, of course. But getting close may be. It's all about programming at a high enough level tha
505.
by Athas 10y ago
Numerical computing is important for science in general, and really hard. But if you're perfectly fine with the current state of software, then sure, there's no need to change anything. Future CPUs will gain an increasing amount
506.
by Athas 10y ago
Both of those projects look like they are about designing a convenient GPU programming API for Java. Which is fine and useful, but you still have to program with an understanding of the GPU model (notably, massive threading), so it's
507.
by Athas 10y ago
I agree that achieving high performance from high-level languages relies crucially on restricting the expressive power of the language. The more powerful the language, the harder it is for a compiler to analyse the essentials of the comput
508.
by Athas 10y ago
When I think of "innovation in language design", I don't really think of JIT-compiling highly dynamic behaviour. I think of inventing languages with programming models that can be used for programming the heterogeneous hardw
509.
by Athas 10y ago
> many of the implementation owners don't have a huge amount of time, so getting them to also agree to the new features is complicated. That's another thing I noticed - people are not really prototyping the new ideas. I know t
510.
by Athas 10y ago
I work with a bunch of people who were very involved in SML, and I've asked this question many times. They usually say that SML (as a language) stagnated because of personal conflicts in the standardisation committee. A bit of a &quo

More ›