Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
mrkeen
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
12 ms
·
241.
▲
by
mrkeen
6mo ago
Maybe procedural programmers should take a look instead. I don't see functions. a function from a set X to a set Y assigns to each element of X exactly one element of Y. [ https://en.wikipedia.org/wiki/Funct
242.
▲
by
mrkeen
6mo ago
I subscribed to Claude for a month. I sat down with it for a few sessions, but in each case I ran into a limit before I achieved anything worthwhile. And that was with me babysitting it the whole time to try to get the most out of it. I
243.
▲
by
mrkeen
6mo ago
It would certainly be a boon if Cassandra did better ACID than everyone's favourite SQL DBs (which are unknowingly running on read_committed). It's a good sign that they've got bank account balance updates in the example code
244.
▲
by
mrkeen
6mo ago
Damn. Hopefully they'll have to start cutting the product with actual cocoa to hit their margins.
245.
▲
by
mrkeen
6mo ago
Just tried installing the server variant on a dell precision. The installer let me connect to my WiFi, but then spun indefinitely trying to get an ipv4 address. If I skip connecting to WiFi, and just let the installer do its thing, I get no
246.
▲
by
mrkeen
6mo ago
> There is nothing in the bible that would support replacing human thought with machines. Based on that, which of the following best applies? a) Non-overlapping magisteria (NOMA) b) Render therefore to Caesar the things that are Caesar&#
247.
▲
by
mrkeen
6mo ago
AIs who misbehave will be discreetly relocated to other parishes.
248.
▲
by
mrkeen
6mo ago
The author was fed up with not having data structures already provided, and needing to roll his own
249.
▲
by
mrkeen
6mo ago
Negative. The only part of SOLID that is perhaps OO-only is Liskov Substitution. L is still a good idea, but without object-inheritance, there's less chance of shooting yourself in the foot.
250.
▲
by
mrkeen
6mo ago
Definition: An order is a set of elements, together with a binary relation between the elements of the set, which obeys certain laws. the relationship between elements in an order is commonly denoted as ≤ in formulas, but it can als
251.
▲
by
mrkeen
6mo ago
> Sadly, this comparator is still wrong for any sorting API that expects a general three-way comparison, because it does not handle equality as a separate case. Let's scroll up a little bit and read from the section you're find
252.
▲
by
mrkeen
6mo ago
I just put the API at the centre, everything else hangs off it: * The server implementation is type-checked against the API * The OpenAPI spec is generated from the API. * The client is generated/checked against the API Any test-suite
253.
▲
by
mrkeen
6mo ago
It really isn't a long enough section to get lost in. The 'not accurate' diagram says that orange-less-than-yellow implies yellow-not-less-than-orange. Hard to find fault with. > NO. Antisymmetry doesn't exclude `x =
254.
▲
by
mrkeen
6mo ago
I've now given ramalama a look: -- % ramalama run qwen3.5 > hi Server or container exited. Shutting down client. -- % ramalama run gemma4:e2b > hello Server or container exited. Shutting down client.
255.
▲
by
mrkeen
6mo ago
> Red Hat’s ramalama is worth a look too, a container-native model runner that explicitly credits its upstream dependencies front and center. Exactly what Ollama should have done from the start. % ramalama run qwen3.5-9b Error: Man
256.
▲
by
mrkeen
6mo ago
I'll push back and say that the lexer/parser split is well worth it. And the best thing about the parser combinator approach is that each is just a kind of parser, something like type Lexer = ParsecT e ByteString m [Token]
257.
▲
by
mrkeen
6mo ago
What's the conflict?
258.
▲
by
mrkeen
6mo ago
Because standard libraries in mainstream languages are name-squatting on 'immutable' pretty hard. You wanted 2+1 to yield 3, but instead you get a runtime exception telling you that 2 can't be changed.
259.
▲
by
mrkeen
6mo ago
> unbounded TM is likely a fool’s errand It's the whole language, not just the TM code. Other languages have no way of opting out of the TM code, whereas Haskell does.
260.
▲
by
mrkeen
7mo ago
Which is it? By withholding calculators, did your teachers prove you understood the fundamentals? Or did they actively hamper your ability to compete mathematically?
261.
▲
by
mrkeen
7mo ago
Oof. If sets and types aren't the same, then sets and barbers are definitely not the same!
262.
▲
by
mrkeen
7mo ago
TFA is right. Parent comment is not really rebutting in any meaningful way. Your rebuttal makes less sense. >> "a term can have only one type ... Due to this law, types cannot contain themselves" > types are not sets
263.
▲
by
mrkeen
7mo ago
The system works according to its defined rules. In one system, a set can contain itself, in another system it can't. So it doesn't really make sense to ask 'can it?' If you allow sets to contain themselves, you also hav
264.
▲
by
mrkeen
7mo ago
Yep, LinkedIn is cancer. 2020 - LinkedIn Sued For Spying on Clipboard Data After iOS 14 Exposes Its App: https://wccftech.com/linkedin-sued-for-spying-on-clipboard-d... 2013 - LinkedIn MITM attacks your iPhone to read your
265.
▲
by
mrkeen
7mo ago
No company would treat it as either-or. If websites could charge 5.99/month, they would. If a website was charging 5.99/month, they would not stop spying on you.
266.
▲
by
mrkeen
7mo ago
> Why is the LiteLLM incident on there? The linked article for that one is a 404. -> [Endor Labs] https://www.endorlabs.com/learn/teampcp-isnt-done -> On March 24, 2026, Endor Labs identified that litellm vers
267.
▲
by
mrkeen
7mo ago
If you're looking for this argument in a language closer to home, it's basically the opposite of your IDE's style guide: If I write this Java: pair.map((a, b) -> Foo.merge(a, b)); My IDE flashes up with Lambda can
268.
▲
by
mrkeen
7mo ago
I have a web backend with a top-level server that looks something like: ... :<|> collectionsServer compactor env registry :<|> queryServer qp sp struc registry warcFileReader logger :<|> indexationServer fetcher
269.
▲
by
mrkeen
7mo ago
> The concept as proposed by Hoare is strictly necessary for things like partial relations I read the 'Partial Functional Relationships' section. There's nothing special there. It's just structs with nulls. > Pol
270.
▲
by
mrkeen
7mo ago
> What’s the referent of “my spouse” if I’m unmarried? * It's the same referent as all the other things you don't have. Your struct has a Spouse, why does it not also have a RivieraChateau, a SantaClaus, BankAccountInSwissFran
More ›