HN user

th0114nd

90 karma
Posts0
Comments29
View on HN
No posts found.

It’s a short circuiting conjunction. Consider `aliceWantsADrink && bobWantsADrink`. If Alice doesn’t want a drink, she knows it’s not the case that both of them want a drink. Since she says “maybe” instead of “no” she signals to Bob that she wants a drink, and so he concludes they both want a drink.

I can’t recall exactly, I want to say 16 vCPUs and 64GB. How well a project can make use of the cores depends on how wide your dependency graph is vs how tall, as the unit of parallelism is a package.

The EC2 instance was on continuously, and I would ssh+tmux in. You could probably replace this with a server plugged in under your desk, depending on how much you trade off operational costs and capital costs.

More often than not I wanted passing tests to send something for review. If I needed an artifact, I would publish a docket image on an internal registry.

Attention to detail and thoughful design is what Chime is all about.

Sorry for the nitpick, but a typo in this particular sentence was too good to pass up.

I don’t think this an entirely fair comparison. STM provides essentially primitive operations, Async just builds a higher level API on top of them for common pattern. Not unlike the relationship between errgroup and go routines.

Strategies solve a different problem, in giving control of evaluation order of pure values. STM is aimed more at traditional multi threading

Git Koans (2013) 10 years ago

I didn't read the hobgoblin the same way as the author being purely critical. I read it as a defense: a similarity between commands would make it easier to choose the wrong one. Removing a branch is a more destructive than deleting a file, so it should be a command chosen with conscious care rather than muscle memory.

I'd say it's good in the sense that it is readable provided you are familiar with the syntax for list comprehensions and appendings, and obviously correct if you know quicksort.

Don't you think an example where the type system has a visible impact would be appropriate? As it is now, none of the examples show anything that doesn't look like vanilla lisp. I think what makes the Haskell type system nice to use is inference along with type assertions. Do you have type assertions, or is the implementation of types behind the scenes until a type mismatch occurs?

I quit 13 years ago

Congratulations on your decision. A lot of the time I feel like I should drop out of school, but don't because status quo just seems easier.

Browser Pong 13 years ago

Cool. But it's pretty easy to cheat, just resize your paddle to take up the entire screen and you auto-win.

If you do like his advice, I would not choose Caltech if the option presents itself. I happen to like it, and I don't know if other students are just "whiny for fun," but I hear a lot of complaints about everything under the sun that is germane to the institute. Moreover, CS is a very theoretical option. I'll be finishing my sophomore year this spring and I don't feel as though I really have the programming chops to really be useful in any sort of internships. My case is a little different though, I didn't think I wanted to option in CS until the beginning of the winter quarter.

I wasn't able to. After a bit of hunting I realized the missing packages were on their site. Some of those make just failed, and on others it would appear as though make install went through but were not afaict installed. I gave up.

Measuring time of computation is counting the number of primitive operations. I'd say a language is a collection of capabilities that play nicely. Given one language, we can create a second that is also RE by taking each instruction in the first and adding a nop, or calculate ack(10,10) and throws it away, or whatever. Any algorithm that the second language computes with at least one step runs in fewer primitive steps in the first language by design.

Beyond a theoretical consideration, in practice there is much more than preference providing the difference between languages. If they were the same, you shouldn't have any trouble implementing combinators in brainfuck.

To say that all languages are equivalent because they are Turing Complete is just not true. That means they can decide the same class of problems, it does not mean they can or do decide them in the same way. In particular some languages are inherently faster than others.