porges

5 ms·

1.
by porges 8y ago
Here's a much better article with a similar title: https://pdfs.semanticscholar.org/c9e7/3fc7ec81458057e6f96de1...
2.
by porges 9y ago
I can recommend SF, I just started it a week ago without prior Coq experience. I'm using the VSCode integration which helps, CoqIDE is a bit clunky.
3.
by porges 9y ago
At that point aren't you just doing normal Racket pattern matching? (match (list (> x y) (stringp foo) (oddp n)) [(list #t _ #t ) (whatever)] [(list _ #t _ ) (other-
4.
by porges 9y ago
Swift C# has the ability to opt-into default checked arithmetic. I don't know of anyone that uses it...
5.
by porges 9y ago
This looks really good, thanks! Nice support for isometry.
6.
by porges 9y ago
That's just Windows. There's no combined codebase akin to Google's.
7.
by porges 9y ago
The difference is that a French text must be finite.
8.
by porges 9y ago
("Free-format") Fortran has a max line length of 132 chars, up from ("fixed-format") 72 chars on punch cards.
9.
by porges 10y ago
Yeah, I originally qualified everything and then figured most readers of the site are USian anyway ;)
10.
by porges 10y ago
FYI: `languæge` and `charæcters` don’t make much sense—‘æ’ and ‘œ’ usually changed to simple ‘e’ in modern English ( Encyclopædia , mediæval ), unless at the start of a word ( æsthetics ). There are variations, ‘œ’ seems to have been more
11.
by porges 10y ago
That's mostly because Encyclopædia Britannica is styled that way.
12.
by porges 10y ago
Also why Menzies is pronounced "mingiz": https://en.m.wikipedia.org/wiki/Menzies
13.
by porges 10y ago
Haskell for one, but lots of others: https://en.wikipedia.org/wiki/Green_threads
14.
by porges 10y ago
Forgive my ignorance, but if you're issuing certificates for internal hostnames that you want to keep private, why would you need a public cert? Wouldn't an internal CA be better?
15.
by porges 10y ago
That page is just an inferior version of the source: https://www.geonet.org.nz/quakes/felt
16.
by porges 10y ago
> After instructions, participants were given printouts of sample code they could refer to while solving tasks. Group Lambda got code of a C++ program using lambda expressions and group Iterator received code of the same program written
17.
by porges 10y ago
The Tài Xuán Jīng symbols are, however. A subset can be used like: 𝌆𝌇𝌉𝌊𝌏𝌐𝌒𝌓𝌡𝌢𝌤𝌥𝌪𝌫𝌭𝌮 So Unicode has Bagua (3 bits), Tài Xuán Jīng (4 trits), and I Ching (6 bits, but incomplete).
18.
by porges 10y ago
I{HEART}COM
19.
by porges 11y ago
> Calculating the size of a static array. std::size is in C++17: http://en.cppreference.com/w/cpp/iterator/size
20.
by porges 11y ago
This is hilarious.
21.
by porges 11y ago
Because that seems to be what the person who came up with the "63 MB" figure has done.
22.
by porges 11y ago
Something does seem funky. The website looked like this in 1997: http://web.archive.org/web/19970418234503id_/http://www.bath... [This page is 3,780 bytes.] In fact, you can find the server stats from ba
23.
by porges 11y ago
These exist in Haskell as "Pattern Synonyms". Here's a partial translation of some of the F# examples on MSDN to Haskell; {-# LANGUAGE PatternSynonyms, ViewPatterns #-} pattern Even <- ((`mod` 2) -> 0) pattern
24.
by porges 11y ago
The point here is not particularly about signedness, it's that UB allows better optimizations to be performed. If overflow is defined to wrap around then it's potentially an infinite loop (take N == MAXVALUE). With overflow define
25.
by porges 11y ago
> It seems the terrible performance of the STL can be explained by std::string: this thing hits the general purpose allocator every time a new string is constructed. In this benchmark, that means every time we insert a string, possibly m
26.
by porges 11y ago
Yi is one editor that does incremental parsing correctly: https://github.com/yi-editor/yi
27.
by porges 11y ago
All major browsers support PNG favicons
28.
by porges 11y ago
Each element of your matrix doesn't really have its own type, each column and row has a type: 1 +--- V | V Pa | Pa V^-1
29.
by porges 11y ago
There are potentially patents on the code, e.g. https://www.google.co.nz/patents/US8515891 which discusses PEX + regex (mentioning SMT solvers).
30.
by porges 12y ago
You have to store the length, C# strings can contain '\0' (although the hashing code doesn't take this into account!)

More ›