I'm alone and don't feel bad at all. Actually, I prefer to be alone. There are so many interesting things to do, so many interesting books to read, etc, I don't understand how someone can be bored. It's really strange…
For those who really want to blow their mind, I suggest learning Coq instead https://softwarefoundations.cis.upenn.edu/
This is great and I love Rust, but > However, when working directly with the hardware, which has no knowledge of Rust’s guarantees, it is necessary to work in Rust’s unsafe mode, which allows some additional behaviors,…
There are also union types. And sum types can be implemented in terms of union types: https://waleedkhan.name/blog/union-vs-sum-types/
What if there is another application (or e.g. a stored procedure) that uses this DB table so you cannot control all saving operations from your application?
> Sure, I didn’t say it does. Sorry, I implied it from your "foo" example. > two phases So maybe we need to change the mantra to “parse, and validate as little as possible”?
> head :: [a] -> a > This function returns the first element from a list. Is it possible to implement? But the type itself doesn't say that it must return the first element. > If you see why parseNonEmpty is preferable,…
Then why do I have the following results? const a = [...Array(1000000).keys()]; const m = 8; let leftAvg = .0; for(let _ of Array(m)) { const t0 = performance.now(); a.map(Math.tan).map(Math.sin); const t1 =…
Then it is 8Gb of pointers. I doubt it's practical to worry about such extreme cases.
> a.map(g).map(f) ≣ a.map(x => f(g(x))) > But the one on the left will be slower and use a lot more memory. Is it really true? I mean, GC will clean the intermediate array, won't it? And the speed won't be significantly…
> If you're in Safari or Edge, this might still look ok! If you're in Firefox or Chrome, it looks awful, like this: https://gankra.github.io/blah/text-hates-you/transparent-cur... It doesn't look awful in Firefox, it…
There was Liskell, but it seems it's dead. https://wiki.haskell.org/Haskell_Lisp
I mostly use Console, Network and Inspector tabs and I rarely debug (in general.) Especially Network tab in Firefox's dev tools is much superior to Chrome's one, IMHO.
Can I say please that it's very annoying that Chrome (and everything Blink based) doesn't let you to open a file in an application you can choose and see the size of the file before downloading it?…
I personally prefer firefox's dev tools to chrome's ones.
https://www.nytimes.com/2019/07/07/world/europe/kosciusko-be... > “Belarus did not even exist when he was born,” said Veslav Wychodzki, a retiree from Poland who traveled to Kosava recently to pay tribute to Kosciuszko.…
I doubt that you doubt it.
Scepticism.
I'm alone and don't feel bad at all. Actually, I prefer to be alone. There are so many interesting things to do, so many interesting books to read, etc, I don't understand how someone can be bored. It's really strange…
For those who really want to blow their mind, I suggest learning Coq instead https://softwarefoundations.cis.upenn.edu/
This is great and I love Rust, but > However, when working directly with the hardware, which has no knowledge of Rust’s guarantees, it is necessary to work in Rust’s unsafe mode, which allows some additional behaviors,…
There are also union types. And sum types can be implemented in terms of union types: https://waleedkhan.name/blog/union-vs-sum-types/
What if there is another application (or e.g. a stored procedure) that uses this DB table so you cannot control all saving operations from your application?
> Sure, I didn’t say it does. Sorry, I implied it from your "foo" example. > two phases So maybe we need to change the mantra to “parse, and validate as little as possible”?
> head :: [a] -> a > This function returns the first element from a list. Is it possible to implement? But the type itself doesn't say that it must return the first element. > If you see why parseNonEmpty is preferable,…
Then why do I have the following results? const a = [...Array(1000000).keys()]; const m = 8; let leftAvg = .0; for(let _ of Array(m)) { const t0 = performance.now(); a.map(Math.tan).map(Math.sin); const t1 =…
Then it is 8Gb of pointers. I doubt it's practical to worry about such extreme cases.
> a.map(g).map(f) ≣ a.map(x => f(g(x))) > But the one on the left will be slower and use a lot more memory. Is it really true? I mean, GC will clean the intermediate array, won't it? And the speed won't be significantly…
> If you're in Safari or Edge, this might still look ok! If you're in Firefox or Chrome, it looks awful, like this: https://gankra.github.io/blah/text-hates-you/transparent-cur... It doesn't look awful in Firefox, it…
There was Liskell, but it seems it's dead. https://wiki.haskell.org/Haskell_Lisp
I mostly use Console, Network and Inspector tabs and I rarely debug (in general.) Especially Network tab in Firefox's dev tools is much superior to Chrome's one, IMHO.
Can I say please that it's very annoying that Chrome (and everything Blink based) doesn't let you to open a file in an application you can choose and see the size of the file before downloading it?…
I personally prefer firefox's dev tools to chrome's ones.
https://www.nytimes.com/2019/07/07/world/europe/kosciusko-be... > “Belarus did not even exist when he was born,” said Veslav Wychodzki, a retiree from Poland who traveled to Kosava recently to pay tribute to Kosciuszko.…
I doubt that you doubt it.
Scepticism.