Athas

22 ms·

181.
by Athas 6y ago
It's not the same when you support slicing. foo[x:y][z] is not the same as foo[x:y,z]. I'm not sure anyone is proposing slicing to be supported with the indexing operator in C++, though, so it might not matter.
182.
by Athas 6y ago
/r/programminglanguages has good content. Most of the contributors are hobbyists, and some are just starting out, but there are always good discussions to be had.
183.
Will Futhark Work on Apple Silicon?(futhark-lang.org)
6 points by Athas 6y ago|0 comments
184.
by Athas 6y ago
While I'm always down with research into applied restricted languages, I'm not sure this is the path to mainstream parallel programming. It's one thing to identify that parallel execution is safe, and it's quite another
185.
by Athas 6y ago
GNU Awk has lots of extensions and is a relatively big language, but I definitely think you can learn most of the original Awk in two weeks - and you can certainly learn enough to be useful in two hours. It's been a decade now, but my
186.
by Athas 6y ago
I'd rather just have the configuration file be simple and well documented and let me make the decision. My monitor running at maximum resolution is about 163 DPI, so an automated system could guess both ways. 200% scaling works well
187.
by Athas 6y ago
How would it know what scaling factor you want?
188.
by Athas 6y ago
How do you terminate the CUDA kernel when a bounds violation is encountered by a single thread? I don't think the CUDA API exposes a mechanism to do that safely.
189.
by Athas 6y ago
I'm not sure I understand the bounds checking example. Can someone shed some light on how CUDA.jl does bounds checking? It's not entirely straightforward to do on a GPU.
190.
by Athas 6y ago
Strong sequential consistency is a big one. Most architectures that have tried to diverge from this for performance reasons run into trouble with the way people like to write C code (but will not have trouble with languages actually built
191.
by Athas 6y ago
This surprises me. With Monte Carlo methods, wouldn't you rather want quasi-random numbers[0], because they allow the simulation to converge asymptotically faster? Those are certainly not anything like crypto-strength. [0]: https:&#
192.
by Athas 6y ago
Any vectorised operation in Numpy is an example of this. The pure subset of Numpy can be used to write useful programs, but the Numpy functions/methods are mostly implemented in impure C. Another example is completely pure array progr
193.
by Athas 6y ago
I'm not going to claim that mutability is never useful for performance, but many large scale simulations can be expressed quite elegantly using bulk operations on arrays or other structures, with no mutability in sight. Both particle
194.
by Athas 6y ago
Almost all languages above the C level has nice abstractions for this, but you still sometimes need to do it for various reasons. Basically, whenever the indexes don't matter, then 1-indexing and 0-indexing are equivalently good, bu
195.
by Athas 6y ago
It matters when doing multidimensional index arithmetic. The formulae for ranking and unranking multi-dimensional to flat indexes are neater with 0-indexing than with 1-indexing.
196.
Futhark 0.18.1 released, breaking all your code(futhark-lang.org)
3 points by Athas 6y ago|0 comments
197.
by Athas 6y ago
Japan is notoriously mineral-poor, so they had to put in extra effort that is not necessary with better raw materials. Further, I suppose this scarcity means that swords become more of a prestige item, meaning that you can put in more effo
198.
by Athas 6y ago
I also read it as there simply being some domains where Haskell is not well suited. I like using Haskell for writing compilers, but I would probably not like to use it for numerics code. While I could replace Haskell with Idris, I'm s
199.
by Athas 6y ago
> Also DDJ, Byte (before got too commercial, aka ads over 70% of content) Wasn't this just how even good magazines were back then? I frequently read old scans of Byte magazine (they're all on archive.org), and while the techni
200.
Homebrew 2.5.0(brew.sh)
2 points by Athas 6y ago|0 comments
201.
by Athas 6y ago
There is no guarantee that the hardware supports 8-bit numbers natively, and emulating them might be expensive. For embedded programming, it is sometimes useful to ask for a type that is at least 8 bits, but may be bigger.
202.
by Athas 6y ago
Yes, ATS can guarantee all those things and more. In particular, ATS allows you to write "unsafe" code, which you then prove safe with a mechanically verified proof. This is in contrast to unsafe Rust, which depends on programme
203.
by Athas 6y ago
I have been running open source AMD drivers on my desktop since I got it (early 2018, Vega 64 GPU). They work well, and after so many years, it felt like a revelation to have problem-free high-performance 3D acceleration after a fresh inst
204.
by Athas 6y ago
I don't think this Haskell implementation is heavily optimised per se. The only places where readability is sacrificed for performance is the use of INLINE and the custom tail-recursive function, which is not where most of the perfo
205.
by Athas 6y ago
Were issues also archived? This badge is specifically an indicator of whether code you committed made it into the vault, not whether you contributed to a project in some other way, or a for other reasons a nice person. I'm still cynic
206.
Futhark implements bounds checking on the GPU(futhark-lang.org)
2 points by Athas 6y ago|0 comments
207.
by Athas 6y ago
> So, the question is, do functional languages automatically have the ability to take this instruction, and spread the data over multiple cores, or multiple processors, in order to return the final answer, in a faster or more efficient p
208.
Is Futhark getting faster or slower?(futhark-lang.org)
2 points by Athas 6y ago|0 comments
209.
by Athas 6y ago
Some months ago, I used my lockdown time to make a repository containing implementations of a (bad) ray tracer in various parallel functional programming languages[0]. I was quite happy that someone contributed a multicore OCaml implementa
210.
by Athas 6y ago
One of my teachers liked to use the term value-oriented programming for the FP subset that does not make use of functions for data representations, or even first class functions beyond combinators like 'map'. I've always li

More ›