Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
amw-zero
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
36 ms
·
391.
▲
by
amw-zero
6y ago
It’s been very difficult for me to devote any time to dependent type theory and it’s associated programming languages. It seems incredibly complicated for fairly little gain, since mis-specifying programs is so common. I’m much more fond of
392.
▲
by
amw-zero
6y ago
Working together in person has to be 10 times more effective. Major doubt that anyone thinks remote working is actually more effective from the companies perspective. The only argument I ever here is that antisocial people prefer not seeing
393.
▲
by
amw-zero
6y ago
See, this one does not bother me. Indistinct chatter / noise does not distract me in the slightest. In fact, that sound is actually a great environment for me to focus - total silence can actually be distracting for me. Music on the ot
394.
▲
by
amw-zero
6y ago
Wait. 1) You don't think people have different learning styles? 2) You don't think that I know what distracts me while I'm working? 3) You don't think that evolution produces _vast_ diversity, and that people have vast d
395.
▲
by
amw-zero
6y ago
This wasn’t what I expected, the bit about formal specification languages was really (pleasantly) surprising. I happen to have been spending a ton of time recently writing TLA+ and Alloy as the author mentioned. It’s completely changed my p
396.
▲
by
amw-zero
6y ago
Dark mode is an eyesore to me. It physically hurts me to look at white text in black backgrounds.
397.
▲
by
amw-zero
6y ago
As it turns out, people have differently structured brains. I cannot write code and listen to music at the same time, for example.
398.
▲
by
amw-zero
6y ago
I would give up my entire salary to be able server render views again. It is more than twice as efficient.
399.
▲
by
amw-zero
6y ago
Honest question - what’s the difference between this and Hotwire?
400.
▲
by
amw-zero
6y ago
My personal criticism of the web FE community is not that the tools haven’t solved problems, it’s that these problems have been solved before and that is not acknowledged. For example, a single-page app is the exact same thing as a native f
401.
▲
by
amw-zero
6y ago
By charging their users money.
402.
▲
by
amw-zero
6y ago
I’m quite happy that they are able to make money off of a game like chess. I don’t see a problem with “cashing in on their domain name.” They provide value to people, and people are willing to pay. You generally have to pay to be a member o
403.
▲
by
amw-zero
6y ago
In poking around, I found this: https://github.com/microsoft/TypeScript/issues/14833 Where someone actually implements a compile-time check for prime numbers. I guess saying that it _can't_ be done is in
404.
▲
by
amw-zero
6y ago
Ada cannot do this at compile time. Predicates with arbitrary logic like that are checked with runtime assertions. There are limits on which static predicates you can write. F* implements refinement and dependent types, which allow true log
405.
▲
by
amw-zero
6y ago
It’s not difficult when you can enumerate every member of a type. Can you write a type for prime numbers this way?
406.
▲
by
amw-zero
6y ago
Please provide a code example.
407.
▲
by
amw-zero
6y ago
I think the problem with what F* is doing is that it’s so foreign to most people that they don’t actually understand it. Typescript cannot do what you’re saying at compile time. F* knows _at compile time_ whether or not a value is within a
408.
▲
by
amw-zero
6y ago
What’s an example of a language with a good syntax?
409.
▲
by
amw-zero
6y ago
Try reading the tutorial. F* uses refinement types, which means that logic is checked before the program is executed, at compile time.
410.
▲
by
amw-zero
6y ago
That's so interesting. It is crazy (and frightening) how quickly we forget. I can't imagine a world without record types. I was thinking about this the other day. When Djikstra was coming up with his graph algorithm, how the heck
411.
▲
by
amw-zero
6y ago
The idea of optimizing a graph layout based on the subject matter that its modeling is a really interesting idea. I'm in the camp of always interested in more visual programming techniques / aids, so it would be really great for u
412.
▲
by
amw-zero
6y ago
I'm not familiar with utf8 decoding, and I focus all of my efforts on thinking about business software. I think it's pretty guaranteed that different representations of anything will make sense for different use cases.
413.
▲
by
amw-zero
6y ago
Redux absolutely implements a state machine. The next state is a function of the current state and an input action. That’s the textbook definition of a state machine.
414.
▲
by
amw-zero
6y ago
Really not sure what you mean. A code example would be helpful.
415.
▲
by
amw-zero
6y ago
> A state diagram is usually richer than a directed graph—usually the edges are labelled. This multiplies the number of possible transitions by the number of possible labels. This is true. The technical term for this is a "multigrap
416.
▲
by
amw-zero
6y ago
See the above reply where I gave an example with both representations. Agreed, the machine representation is independent of the machine itself, it's the same mathematical object. So what I was talking about was how to represent using o
417.
▲
by
amw-zero
6y ago
First of all, that sounded negative and I'm totally not knocking Xstate. I'm pro any library that encourages people to think about state machines :D I'm really speaking tactically about how best to represent the machine, more
418.
▲
by
amw-zero
6y ago
We’ve reinvented the wheel because CS education is really bad at teaching what computation actually is. Then, if you did not study CS (which I did not so I know), you’re really on your own for figuring out what the heck you’re actually doin
419.
▲
by
amw-zero
6y ago
That’s a great question. Combinational logic is an example of something that computes that isn’t a state machine. You can compute Boolean algebra operations with no notion of time, they’re essentially pure functions. That’s where it gets sl
420.
▲
by
amw-zero
6y ago
Absolutely. This is the definition of what computation is. Even in the lambda calculus, where everything is defined with pure functions, we build up state sequentially over time, based on previous values of the state. The fact that there’s
More ›