Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
kthielen
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
1.
▲
by
kthielen
9mo ago
Ha ha, your short but diplomatic reply is a perfect example of the skill in question. Nicely done.
2.
▲
by
kthielen
11mo ago
You make a very good point, and maybe a problem here is that “human factors studies” are set up like market research rather than anthropology. People who’ve spent a long time programming have spent a long time optimizing everything about th
3.
▲
by
kthielen
1y ago
What do you have to say about Curry-Howard?
4.
▲
by
kthielen
2y ago
*moot (No offense intended.)
5.
▲
by
kthielen
2y ago
Or ANS if you want an equally general packing to AC but you care about performance. ;P
6.
▲
by
kthielen
2y ago
For some reason you're willing to drop the context. He's talking about people coming through the border without being vetted, who are dangerous to the country. Do you think that people should be able to come into the country freel
7.
▲
by
kthielen
2y ago
> If you say "they're eating the dogs, they're eating the cats, we have to clean up our country" then... yeah you're getting pulled into HR. Trump was just repeating the same thing that many other people heard, a
8.
▲
by
kthielen
2y ago
> And sure, it’s weird Hunter was involved but it’s also weird the guy who brags about being rich still won’t show us his tax returns […] You’re so quick to drop the question of the Biden family’s involvement in Ukraine and you pivot to
9.
▲
by
kthielen
2y ago
> [...] the Ukraine call [...] Eh, maybe he shouldn't have been impeached for that call. President Biden's son had a strangely lucrative position, which he appeared not to be qualified for. And Biden was very involved in pres
10.
▲
by
kthielen
2y ago
Is it rare because it’s painful, or painful because it’s rare?
11.
▲
by
kthielen
2y ago
I made something like this for Morgan Stanley some years ago, a structurally typed eager variant of Haskell with static elimination of type class constraints (so no runtime penalty for overloading) and uses LLVM for the back-end: http:
12.
▲
by
kthielen
2y ago
> if you want to claim "forall x in X, P(x) is true" then you need to exhibit a particular element of x for which P holds I don’t mean to be pedantic (although it’s in keeping with constructivism) but in the case you describe,
13.
▲
by
kthielen
2y ago
I’ve always wondered why SQL doesn’t support variant types, and in this case especially. If you’re going to store a sequence of values whose type can change over time, a variant is the obvious encoding choice. As new schemas are introduced
14.
▲
by
kthielen
2y ago
I hear different opinions about whether type checking is "an" instance of abstract interpretation (AI) or "the" instance (which IMHO is a useful question since we might consolidate our efforts on one method if possible).
15.
▲
by
kthielen
2y ago
A career change, or a job change?
16.
▲
by
kthielen
2y ago
Ok but just make sure nobody else has to inherit it, and it’ll be fine.
17.
▲
by
kthielen
2y ago
Yeah, some maintenance projects have been much easier than others. Implicit knowledge that you have to “just” hunt down is generally the cause of difficulty and delay. It has little to do with “purity” and more to do with not wasting my t
18.
▲
by
kthielen
2y ago
> Just do some reasoning about the side effects. "Wat?" Have you ever inherited a 1MLoC codebase that you yourself didn't write from scratch, or worked on a large project with at least one other person? How do you know wh
19.
▲
by
kthielen
3y ago
> Lists and trees can be fully captured by sum and product types, but extending this representation style to DAGs and graphs doesn't work--you either get inefficiency (for DAGs) and then infinite regress (for cyclic graphs) attempti
20.
▲
by
kthielen
3y ago
I don't think they explained how it's different, I did listen to the podcast before posting my comment. It's a pretty basic question that IMHO demands a clear and adequate explanation. If you read the 'abracadabra'
21.
▲
by
kthielen
3y ago
Yeah but, how is an assembly index different than an LZW code?
22.
▲
by
kthielen
3y ago
> Formal verification can work in areas where you have a long time to do > development, or where your problem space is amenable to having a formal > standard (like math problems). In most other cases it just runs completely > op
23.
▲
by
kthielen
3y ago
Why would you post this here instead of the github page?
24.
▲
by
kthielen
3y ago
This piece focuses on complaints about ocaml, and the last half seems to just be syntax complaints (which I mostly ignore just because every language seems to have awkwardness in its syntax -- certainly Haskell, a language otherwise held up
25.
▲
by
kthielen
4y ago
Bulletproof counter argument, you sure showed me.
26.
▲
by
kthielen
4y ago
> Programming is child's play compared to undergraduate mathematics taught in math departments. One thing you might learn in math is to avoid making overgeneralized statements that you can’t support. A valid substitution in your sta
27.
▲
by
kthielen
4y ago
I think this is the goal of proof assistants based on the Curry-Howard isomorphism, which the original author thought to denigrate for some reason.
28.
▲
by
kthielen
4y ago
> But I would advise taking time to consider whether it's actually, within the lens of yesterday (or 2 years ago)... good? Other than to soothe egos, this almost never matters, because the person inheriting someone else’s code doesn
29.
▲
by
kthielen
4y ago
Let me guess, that smug superiority, serious and knowing citations from "The Guardian", you're from the UK right? And you're lecturing us in the states about our naive skepticism of countries with royal families, while
30.
▲
by
kthielen
4y ago
Yes, each thread produced several words.
More ›