Viewing profile — higherkinded

Okay but they are formal systems and don't have anything to do with AI either, do they?

Don't.

Suggestion to rely on AI for proof verification is just laughable. Neuron weights instead of formal definitions. So reliable.

Curious! Instantiation by means of the language is actually slower than parsing stuff and instantiating the objects that way. Didn't ever think of that possibility before. Anyway, …

Lasting long against HN-mainpage-level load. That's what's hard.

Wrong Amazon, you again!

Add a to your landing mayhaps? Takes a little while to figure out that I need my JS on for a proper representation.

Effectful sizeof, what a delightful feature ! Though the compile-time magic with structs and functional macros are so tempting that I feel like it's high time to do some C.

Not sure if I'm going to express an unpopular opinion on that matter but I'm pretty sure that ot was already said somewhere in the comments in some different form. Not sure if my o…

"...so again, like I said earlier,.."

For some reason I've thought about the other Amazon. Even São Paulo didn't help the title to ring a bell.

>Youngsters these days What a marvelous start, good luck looking trustworthy. It's straight up the same as it was generations and generations before. I also love the emphasis on vi…

Who would've guessed? Getting a kilometer of solar panels installed as a road (sic!) in a region that has a cloudy skies most of the time. It's borderline genius. How did it get an…

The fact that someone needs to say that for it to be apparent is somewhat unsettling.

>cross the bridge No one really wants that in any use cases of type-level numbers. Type-level numbers are generally used to do just opposite: silently (well, loudly, if you ask the…

>Much like java and javac are different tools, python and pytype/mypy are different tools I get where you're heading. The `java` one is for JVM bytecode interpretation and the `jav…

And how's it helping you verify the correctness of your codebase at compile time (it still compiles the source to byte-code before evaluation)? Last time I checked, it didn't care …

And that's a sad thing to hear. Before my death by thousand downvotes, I'd like to tell you why do I feel that way. Back in the day when I was way more inexperienced than I'm now, …

I'd also like to point out that the majority of software engineers nowadays lacks the mathematical background, so it's probably worth including theoretical books like Abstract Alge…

No it's not, and you still have a burden of a proof on your shoulders. It probably is, indeed, kept up by some degree of anti-competitive practices but it's still not a monopoly bu…

Ok but I'm talking of ones based on composition.

>which makes n-arity functions necessarily first-class Excuse me but tuples. You still have to observe them to evaluate them but that's all you need to simulate n-arity in the way …

That is exactly the thing that baffles me most. Procedural languages that are inherently distanced from math are used for math for whatever reason. That's basically what I've said …

Haskell is its direct descendant, so of course it counts. It has all the traits required to be called that, and I'm implicitly talking towards it in the initial comment while still…

Off the topic but, Why keep reinventing the wheel when there's an ML language family already? Why do people keep giving up these juicy Hindley—Milner-ish type systems and these bri…