Athas

53 ms·

511.
by Athas 10y ago
I know of a company (Simcorp) that uses APL extensively. It is probably pretty rare that they hire someone who is already a proficient APL programmer, and most of their hires probably don't know it at all. So they train them. It&#x2
512.
by Athas 10y ago
Thank you, that is a very nice implementation! I think the key is that the vector library is very well designed - it has certainly been the cause of the majority of my Haskell performance successes. I'll say that your implementation
513.
by Athas 10y ago
I can't find a quicksort implementation on the other side of that link.
514.
by Athas 10y ago
> It's also mostly straightforward to implement a fast Quicksort using mutable arrays in Haskell. Do you know of one? All the fast array-based quicksorts I have seen in Haskell have been very awkward compared to implementations in
515.
by Athas 10y ago
Sadly, the translation from SPIR-V to system-dependent machine code can still be buggy. Although hopefully most of the optimisation will take place at the SPIR-V level, which, as I understand it, is pretty similar to LLVM. That should ena
516.
by Athas 10y ago
In my experience, the situation is a little better for AMD and NVIDIA GPUs - likely because they have already seen (relatively) heavy use for OpenCL and CUDA. The drivers are still pretty bad altogether, with some of intermittent faults an
517.
Single-Assignment C (parallel programming language) just got a new website(sac-home.org)
22 points by Athas 10y ago|0 comments
518.
A Crash Course on ML Modules(jozefg.bitbucket.org)
5 points by Athas 10y ago|0 comments
519.
Debugging with Humility(amir.rachum.com)
2 points by Athas 10y ago|0 comments
520.
by Athas 10y ago
> reads like an ode to Haskell/ML. It may seem like that from the intro, and from how the text is frequently summarised, but a closer reading shows that what Backus proposes is almost as different from modern functional programming
521.
by Athas 10y ago
Concurrency using event loops is still concurrency. Older cooperative concurrent systems used to work that way.
522.
by Athas 10y ago
> As for performance and memory usage: it is always a property of the architecture or system, not of the programming language. Dropping to a low-level language, such as C, usually doesn't buy you too much these days. What is more im
523.
A falling sand game in a pure functional language on a GPU(futhark-lang.org)
3 points by Athas 10y ago|0 comments
524.
by Athas 10y ago
I agree with what you are saying, but there is never a reason not to be a pedant: The Second Industrial Revolution already came and went about a century ago. The one we are currently in would be the third. It's unusual in that it see
525.
Lift – Performance Portable Functional GPU Programming(github.com)
2 points by Athas 10y ago|0 comments
526.
by Athas 10y ago
Functional array programming on GPUs works pretty well, and is an immutable programming style. Your object granularity tends to be pretty big (entire arrays), so the low-level shared memory concerns that inevitably arise at some point in t
527.
NESL – A Parallel Programming Language(cs.cmu.edu)
3 points by Athas 10y ago|0 comments
528.
Bob Harper – Parallelism Is Not Concurrency(existentialtype.wordpress.com)
3 points by Athas 10y ago|0 comments
529.
Futhark – a data-parallel functional programming language targeting GPUs(github.com)
2 points by Athas 10y ago|0 comments
530.
Elm is Wrong(reasonablypolymorphic.com)
8 points by Athas 10y ago|2 comments
531.
by Athas 10y ago
I guess it depends on your expectations. I'm working on a ~38000 SLOC Haskell program (an optimising compiler: http://futhark-lang.org ), and with GHC 8.0.1, a full build takes about 7 minutes. I can cut off a minute or tw
532.
by Athas 10y ago
Have you tried writing a compiler in another language? In my experience, functional languages are a very nice fit.
533.
by Athas 10y ago
Is that not why you have stderr?
534.
by Athas 10y ago
I find the implementation very compelling too - it uses kernel support. That really simplifies an otherwise very complicated and security-sensitive code path.
535.
by Athas 10y ago
While the conclusions of the paper ("compare optimised GPU code to optimised CPU code") is good, I'm curious about whether the difference has increased since 2010. GPUs are architecturally easier to scale up than CPUs, after
536.
by Athas 10y ago
I have exactly that example here: https://github.com/HIPERFIT/futhark-benchmarks/tree/master/a... All simulation and rendering is done in Futhark, with Python+Pygame for gluing things together. All the
537.
by Athas 10y ago
Not yet. But you can already write code that shares memory with objects that you also access from hand-written OpenCL code, and since OpenCL can interop with OpenGL, what you are asking for should eventually be possible.
538.
by Athas 10y ago
What about something like Futhar[0] (which I am working on)? It also has Python interop[1], although not quite as elegant as Lift. [0]: http://futhark-lang.org [1]: http://futhark-lang.org/blog/2016-04-15-f
539.
by Athas 10y ago
Can someone show how the generated code for matrix multiply looks?
540.
Futhark – Designing a Functional Language for GPU Execution(futhark-lang.org)
3 points by Athas 10y ago|0 comments

More ›