remexre

29 ms·

361.
by remexre 5y ago
I think the typical argument goes something along the lines of, "it uses []{} and doesn't make cons the default data structure, abandoning some simplicity-of-language."
362.
by remexre 5y ago
Having the -gnu part is newer than it being called a triple.
363.
by remexre 5y ago
UTF-32 isn't really a solution either, unless you consider a scalar value to be a character; I bet almost nobody wants U+0308 to be "a character"...
364.
by remexre 5y ago
Don't you run into issues with strict aliasing? Same deal as it being impossible to implement BSD sockets in ISO C because of the sockaddr funny business.
365.
by remexre 5y ago
Is that some sort of allocation elision where it's actually on the stack? Or more to the point, what are those two instructions?
366.
by remexre 5y ago
The incredible moddability of their RPGs, at least, is in large part to the flexibility of their engine. How many other games have active modding communities 12 years after launch as large as New Vegas'?
367.
by remexre 5y ago
My understanding is that the general problem description for "this Unix program is really really slow when recompiled for Windows" is generally either "lots of small files is good style on Unix, but expensive on Windows,&quot
368.
by remexre 5y ago
idk, as a part-time Haskeller, I think Nix-the-language kinda sucks (tho not enough for me to not use nix). IMO the big huge thing is really inconsistent nixpkgs docs; compare linkFarm and symlinkJoin's docs, for example. I wish there
369.
by remexre 5y ago
There's large class of exploits that appear despite the implementation having identical input-output behavior to a correct one -- a side-channel-free software implementation of AES is quite non-intuitive (bitslicing), and not the sort
370.
by remexre 5y ago
> experimental Haven't flakes been non-experimental since 2.4?
371.
by remexre 5y ago
Common Lisp takes expressions for default arguments, and has the "fixed" behavior; when one wants a persistent value, they do either: (let ((my-list '(1 2 3))) (defun foo (&optional (l my-list)) (setf
372.
by remexre 5y ago
Though, they ended up writing a whole new Ruby JIT to deal with Ruby's performance, so clearly at some point the trade-off changes from "no systems programming, a highly dynamic language instead" to "hardcore systems pro
373.
by remexre 5y ago
"asdf-devel" is just what this post is calling "releases newer than the ones implementations ship," which not only feels like an _incredibly_ slippery definition, but by definition, no, once an implementation starts ship
374.
by remexre 5y ago
Well, I have to manually update SBCL's ASDF because otherwise package-local-nicknames aren't supported by uiop:define-package, and the new-uiop-loading needs to be done before my systems load for package-inferred-system to not cho
375.
by remexre 5y ago
How does that make graph transformations easier and avoid issues with memory management related to those? I tried looking in the docs at your link to see (because it looks a lot more like a syntax extension for an assembler than anything th
376.
by remexre 5y ago
Church constructions? - Dependent sum Sigma A (\x -> B) = (C : *) -> ((x : A) -> B x -> C) -> C - Cartesian product Pair A B = (i : Bool) -> (if i then B else A) - Disjoint union Sum A B = (C : *) -
377.
by remexre 5y ago
Does the kernel currently use precompiled headers? Anyone know how much they ought to help with this sorta scenario? (Like, presumably their gains would be lessened by this patchset, but could they have gotten halfway there on performance o
378.
by remexre 5y ago
https://www.hillelwayne.com/post/divide-by-zero/
379.
by remexre 5y ago
HN shows it before de-punycoding (punydecoding?), which if you're not familiar with Punycode, does indeed look a bit "spooky."
380.
by remexre 5y ago
malloc isn't typically O(n) though, so I don't think that's reasonable math?
381.
by remexre 5y ago
Though I think Clojure has a linear datastructure that's O(log32(n)) for all the common ops. (This is the one with all the memeing because someone called it "practically O(1)".)
382.
by remexre 5y ago
> But don’t expect to take over the world. "Avoid success at all costs" is the Haskell motto, so... > Bring all the modern stuff people expect into the standard library. GHC already ships with lots of these, they're jus
383.
by remexre 5y ago
WebAssembly is notably a pathological case for _any_ stack-scanning GC, since the stack isn't addressable.
384.
by remexre 5y ago
I think GP is suggesting... well, dependent types, but in a restricted enough way that I don't believe it adds additional complexity over DataKinds. At least, I read > Instead of MaxHeap(T), make it MaxHeap(T, Ord:(T,T)->bool) as
385.
by remexre 5y ago
Does it break anything to allow datatypes to be parametric over instances? eg instance absOrd : Ord Int where -- ... union :: (ord : Ord a) => MaxHeap a ord -> MaxHeap a ord -> MaxHeap a ord If it's still
386.
by remexre 5y ago
My 2c is that it makes a lot of sense to have a single unnamed instance of a typeclass, and have that follow the orphan rules, but to allow other _named_ ones that don't follow those rules. Then, add syntax (possibly reuse TypeApplicat
387.
by remexre 5y ago
My eReader is the only tablet I own; the big plus of it for me is that it gets about a week of battery per charge, so I don't have an extra device to remember to charge every night, put back in my backpack, etc. Don't really have
388.
by remexre 5y ago
For me at least, screen size! You really want to be able to fit any diagram on the whole screen at once.
389.
by remexre 5y ago
didn't china already ban mining lmao
390.
by remexre 5y ago
Filecoin is only for paying others to host your content; you can host it yourself (as I do) or on a VPS and ignore Filecoin, and IPFS still works great.

More ›