quchen

17 ms·

181.
by quchen 6y ago
In particle physics a barn is a huge area though, so the joke kind of makes sense there.
182.
by quchen 6y ago
On-disk filenames should be hashes, much like .git contains lots of hash-named files. My Restic backup folders don’t show much beyond that they are Resic backup folders (if even?).
183.
by quchen 6y ago
I’ve looked at Backblaze and Wasabi for my personal off-site backups, and sided with Wasabi. Can’t complain so far.
184.
by quchen 6y ago
> while two light beams do not [interact] Photons do interact! There is no two-photon vertex, that’s true, since there is no fundamental interaction between two photons. But put four photon/charged particle vertices together and y
185.
by quchen 6y ago
| So, let's just legalize them all and hope that people will use them responsibly. Like for alcohol, I doubt that would work. Some substances are simply hard to use responsibly, some offer unique ways of escapism (especially during a l
186.
by quchen 6y ago
:: IO ()
187.
by quchen 6y ago
Marcel has another video with a deterministic and much longer than Mr Bones' Wild Ride duration. Highly recommended! https://m.youtube.com/watch?v=QotjNlDr0WU
188.
by quchen 6y ago
Is there a non-paywalled link?
189.
by quchen 6y ago
It's the battle chant of Rutgers University :-)
190.
by quchen 7y ago
I'm pretty sure this (evolving) article has been around well before VSCode's initial release.
191.
by quchen 9y ago
Time, in particular. When you’re new, you think all those »more addictive than crack« comments are jokes. They are not. Factorio has a lot in common with writing a fun new language that you don’t know how to abstract things in, figuring out
192.
by quchen 9y ago
I don’t think so. - IO can be seen as a tag added to a type that brings »the outside« into scope: the console, the network, current time, the harddrive. In Rust, these are always available, regardless of the type of the expression at hand.
193.
by quchen 9y ago
Haskell has the ST type for this, which is a stripped version of IO in which we can still make proper mutable inplace updates like in other languages, but there is a »runner« function called »runST«, which guarantees that the computation it
194.
by quchen 9y ago
> writing a fresh map function for each data type You have to do that in Haskell as well (where »you« can be you or the compiler via DeriveFunctor); the key difference is at the use site: there is one map function (called fmap) that do
195.
by quchen 9y ago
What’s /r/the_donald, and how did it »then happen«?
196.
by quchen 9y ago
Keep in mind that reference counting, which Rust supports in its standard library, is a also form of garbage collection. It may not be part of the core language, but then again neither are RAII in C++, monads in Haskell, and getters/se
197.
by quchen 9y ago
I recommend the much smaller project by Merijn, lambda-except [1]. I learned Trifecta from it, and it’s really not all that difficult, just embarassingly poorly documented. I then wrote the parser for my STGi project based on Trifecta, so t
198.
by quchen 9y ago
ELI5: A blockchain is an »I told you so« store. Future statements/promises are linked to past ones so you can’t mess one without having to mess with all the others. It’s like a black board you can’t wipe clean again, adding more text
199.
by quchen 9y ago
Even without knowing about monads, you can simply implement »bindIO« and »pureIO«. That’s what most other languages do – they have bindMaybe, bindList, bindAsync, …
200.
by quchen 9y ago
The key insight is that all languages have monads, but very few have monad. It’s up to the programmer to see the pattern in e.g. Javascript. But other than having higher kinds there’s not much that keeps most languages from having them the
201.
by quchen 9y ago
Monads aren’t as special as macros though, all you need is functions and higher-kinded types. The rest is carefully crafting a lawful monadic API, which is something you could probably do in most languages (but none of the standard ones hav
202.
by quchen 10y ago
For me it’s quite the opposite: Haskell allows me to have local hacky sections that I can then hide in a module that exposes a safe API. Since refactoring is fairly easy with compiler assistance, I don’t even have to break up my 100-line-lo
203.
by quchen 10y ago
Sometimes I’m not even sure how I developed Haskell pre-GHC-7.8.1 (when typed holes were introduced).
204.
by quchen 10y ago
If anyone wants in, here are 5 invite links. [Edit: all used up.] Each works for only one signup, so hurry up :-) By the way, most users get around 20 free invites shortly after signing up. If one of the links above opened your account, why
205.
by quchen 10y ago
As much as I love Slowsort, it is an inefficient mergesort, so you could argue that it does indeed waste time on a sub-routine. On the other hand, the tree numbering cannot be made more efficient by replacing a part of the algorithm with
206.
by quchen 10y ago
I recently read his (first) paper [1] on the Spineless Tagless Graph Redunction Machine (STG), which forms one of the lower-level backends of the main Haskell compiler GHC. After understanding the paper well enough to implement it from scra
207.
by quchen 11y ago
Cached version: http://webcache.googleusercontent.com/search?q=cache:UB-yaeW...
208.
by quchen 11y ago
SPJ about Comic Sans: > This is a very funny question, "Why use Comic Sans?" So, all my talks use Comic Sans and I frequently see remarks like 'Simon Peyton-Jones, great talk about Haskell but why did he use Comic Sans?&#x
209.
by quchen 11y ago
The point of typing is that types are tests: they ensure logical consistency of your program, and they are checked by the compiler. This has a number of consequences. - Some error conditions are inexpressible in your program. You cannot w
210.
by quchen 11y ago
The stones people throw are at a part of Terry that may be a side effect of the same thing that made him build his temple, but from what I've seen his digital work is universally praised in isolation.

More ›