vmchale

40 ms·

511.
by vmchale 7y ago
Professor Jeff Jarvis?
512.
by vmchale 7y ago
> We saw how energy companies plowed right through public outcry and resistance in the Dakota Access Pipeline. In the US it got blown into something completely different, about sticking it to the libs or whatnot. So we went ahead and did
513.
by vmchale 7y ago
In American politics you don't even need to deliver on the jobs. You can just make some shit up and blame everybody's problems on something else (e.g. free trade, immigrants) and then whip up a frenzy and never deliver. But even a
514.
by vmchale 7y ago
Sounds kind of Taoist, some parts like Catherine of Siena. Also yoda lol
515.
by vmchale 7y ago
> JS is a great language literally no one believes this
516.
by vmchale 7y ago
> OCaml's module system is very powerful and has no counterpart in Haskell. Is this taking into account backpack?
517.
by vmchale 7y ago
The default String type is a linked list of characters, which means various things are slower than they should be.
518.
by vmchale 7y ago
> Haskell though, I couldn't grok it If you know OCaml it's within reach. The advantage is that you have better lazy data structures with GHC.
519.
by vmchale 7y ago
> a couple less mainstream languages I'm curious: what languages?
520.
by vmchale 7y ago
Also repa and accelerate :) > I much prefer the Go approach, where there is a single canonical concurrency mechanism which is baked right into the language and is extremely well-documented. Haskell doesn't have everything but I&#x
521.
by vmchale 7y ago
I'm curious how discrimination economics affects the relative lack of investment in some of these areas. Particularly for transgender people and immigrants (a larger group). If immigrants/engineers are getting murdered in hate cri
522.
by vmchale 7y ago
I'm pretty sure monadic error handling came from some ML
523.
by vmchale 7y ago
I think monadic do comes from Haskell and its ancestors.
524.
by vmchale 7y ago
> All the intermediary functions will have to return Try. That's the advantage of the monadic/functorial approach: they don't!
525.
by vmchale 7y ago
Is there any writeup of the theory behind this? I'm particularly interested in type inference.
526.
by vmchale 7y ago
The Null II example and the Elvis operator look like special cases of monadic bind/functorial map.
527.
by vmchale 7y ago
I'm kind of surprised. I get that Haskell/ML may not be the best-known, but even an original functional language is better than spamming pragmas on for loops
528.
by vmchale 7y ago
> in somewhat similar use-cases. I.e. if you have an embarrassingly parallel compute-bound algorithm then it might make sense to offload it to FPGAs to gain performance and power efficiency. Also concurrency! GPU is SIMD; FPGA need not b
529.
by vmchale 7y ago
> it's really gonna take xilinx or altera to innovate in this space, but that is unlikely any time soon. I think people already use Clash/Haskell to write HDL.
530.
by vmchale 7y ago
I believe Clash has industrial users as well. There are a few businesses that use Haskell to target FPGAs.
531.
by vmchale 7y ago
> i think a cross with it and an ML language (like F# or OCaml) would be a wonderful fit for programming FPGAs Sounds like Clash! It's pseudo-Haskell that compiles to Verilog or VHDL.
532.
by vmchale 7y ago
Supposedly Fourier had some insight as well.
533.
by vmchale 7y ago
They only mentioned VR for surgeons in passing, but such a development would be interesting.
534.
by vmchale 7y ago
Seems to use the German way to punctuate quotations even though it's an English article :)
535.
by vmchale 7y ago
Haskell was also used for Clash, Futhark, Egison, and the Curry frontend. I think there are others written in OCaml that I may be forgetting.
536.
by vmchale 7y ago
I've used Haskell before, my understanding is that anything outside of the ML family is needlessly shooting yourself in the foot. Why you'd try to write a compiler in a language that deliberately cripples sum types (Go) is beyond
537.
by vmchale 7y ago
> The scumbag would have done better to just shut the hell up. It also would've been better had he not been a pedophile and yet... we are here.
538.
by vmchale 7y ago
Numpy was quite difficult to get working efficiently. J actually outperformed numpy pretty much any way I compiled it: https://github.com/vmchale/matrix-benchmarks , even doing basic stuff like multiplying two matrices.
539.
by vmchale 7y ago
I wrote a blog post about an example that came up for me: http://blog.vmchale.com/article/ats-templates
540.
by vmchale 7y ago
Easy: http://hackage.haskell.org/package/recursion-2.2.4.0/docs/Co... Also: subsets = filterM (pure [True, False])

More ›