Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
emillon
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
Tomy Turnin' Turbo Dashboard Outrun Arcade (2017)
(circuitbeard.co.uk)
3 points
by
emillon
9y ago
|
0 comments
2.
▲
Curl 7.51.0 Released
(curl.haxx.se)
181 points
by
emillon
10y ago
|
32 comments
3.
▲
Remove ARM NOREAD Section Support from GAS
(sourceware.org)
6 points
by
emillon
10y ago
|
0 comments
4.
▲
by
emillon
10y ago
When I used pwsafe and keepassx they had this option.
5.
▲
by
emillon
10y ago
You might want to filter local and unroutable URLs, for example entering 127.0.0.1 renders a MAMP Pro page.
6.
▲
by
emillon
10y ago
It's a common feature of password managers.
7.
▲
How to deploy OCaml on Heroku
(medium.com)
3 points
by
emillon
10y ago
|
0 comments
8.
▲
Cultivating a Code Review Culture
(blog.fogcreek.com)
9 points
by
emillon
10y ago
|
0 comments
9.
▲
by
emillon
10y ago
There are no semantic problems with this, but typing will get in the way: you can express it fairly easily if all the functions have the same type (such as Int -> Int): actually it's just 'foldr ($)'. But it is difficult t
10.
▲
by
emillon
10y ago
It's more like the pipe operator in ocaml ( http://blog.shaynefletcher.org/2013/12/pipelining-with-opera... ). The lisp version has the extra advantage that you don't have to repeat it between all the inte
11.
▲
by
emillon
10y ago
I'm hoping to make them fashionable again! http://webring.club/ :)
12.
▲
CVE-2016-2178: OpenSSL DSA follows a non-constant time codepath
(openwall.com)
5 points
by
emillon
10y ago
|
0 comments
13.
▲
by
emillon
11y ago
This kind of proofs usually are separated in two steps: - correction: define a loop invariant. Assuming the loop terminates , it will hold when the program exits the loop. - termination: define a loop variant , something that changes at e
14.
▲
by
emillon
11y ago
This is correct, I missed this!
15.
▲
by
emillon
11y ago
That's assuming that this particular string was already present somewhere in the binary. Since it is only present as a reference, you would not see the string in a binary patch.
16.
▲
by
emillon
11y ago
That is my opinion too, but I would go even further and say that this change could have been made on the compiled binary. This kind of statement must take 10-15 bytes max to patch and the build boxes are typically less safe than source cont
17.
▲
by
emillon
11y ago
The letters in this password spell "sun su".
18.
▲
by
emillon
11y ago
Thanks for the heads-up! For some reason mailchimp was returning 403s from heroku, this must be related to this morning's outage. This is fixed and I added the emails that failed.
19.
▲
by
emillon
11y ago
(shameless plug) I totally agree, that was awesome to discover random websites. I think that there's still a place for webrings these days, so I'm creating the webring club. Feel free to subscribe on http://webring.club
20.
▲
Designing an Intel 80386SX development board
(blog.lse.epita.fr)
4 points
by
emillon
11y ago
|
0 comments
21.
▲
A lens-based ST20 emulator
(blog.emillon.org)
3 points
by
emillon
11y ago
|
0 comments
22.
▲
MetaFun: Compile Haskell-like code to C++ template metaprograms
(gergo.erdi.hu)
2 points
by
emillon
11y ago
|
0 comments
23.
▲
by
emillon
11y ago
This kind of compiler has already be done: http://gergo.erdi.hu/projects/metafun/
24.
▲
by
emillon
11y ago
Yes, it's not very formal and as others said it would need some definitions to make a useful result. But actually I don't think that this duality is related to types: in a static language, the types of captured variables does not
25.
▲
by
emillon
11y ago
I like to see this as a sort of duality: closures are objects that have a single method (call) and objects are made of functions that can only capture one variable (this).
26.
▲
I am sorry, but this looks insane
(blind.guru)
2 points
by
emillon
11y ago
|
0 comments
27.
▲
by
emillon
11y ago
Yes, exactly. ADTs are entirely known statically so there's no vtable etc.
28.
▲
by
emillon
11y ago
At runtime, GADTs are actually represented the same way as plain ADTs (that is, a tagged union). The tighter types make it possible to remove some unused branches in pattern matching, so you may remove a few tests, but memory-wise it should
29.
▲
by
emillon
12y ago
> OCaml classes allow row polymorphism, but disallow immutable updates (immutable updates meaning create a new object with everything the same, but one element different.) There's a functional update construct for objects: http:&#x
30.
▲
by
emillon
12y ago
> Also, when your programs use abstract data types you lose the benefits of pattern matching. In some cases you can also use "private ADTs". Modules seeing such a type can use pattern matching on them but can not apply the cons
More ›