sanjoy_das

7 ms·

1.
Pyano: A formalization of first-order logic and Peano's axioms in Python(github.com)
1 points by sanjoy_das 3y ago|0 comments
2.
by sanjoy_das 5y ago
> It is interesting to me that right now this is sitting on the HN homepage directly adjacent to: "Tesla to recall vehicles that may disobey stop signs (reuters.com)" Based on https://www.forbes.com/sites/b
3.
by sanjoy_das 5y ago
Another data point: I tend to receive far more recruiter cold calls in an old email address that I no longer use than in my newer more active email address.
4.
Seemingly Impossible Turing Machines(playingwithpointers.com)
2 points by sanjoy_das 7y ago|1 comments
5.
by sanjoy_das 8y ago
Similar: tfcompile AOT compiles TensorFlow models into native code using XLA ( https://www.tensorflow.org/xla/tfcompile ).
6.
Control Flow in TensorFlow and XLA's Auto-Clustering(playingwithpointers.com)
5 points by sanjoy_das 8y ago|0 comments
7.
[video] Falcon a New JIT Compiler in Zing JVM(youtube.com)
1 points by sanjoy_das 9y ago|0 comments
8.
Hyderabad’s Human Library treats humans as books that can be 'borrowed'(scroll.in)
2 points by sanjoy_das 9y ago|0 comments
9.
by sanjoy_das 9y ago
That's an especially interesting possibility since LLVM now has IR support for C++ coroutines.
10.
by sanjoy_das 9y ago
> Recursion and memoization is easy but dynamic programming doesn't really feel as natural. Ways to get better? Just do more? Once you have the recursive solution, the DP solution should be fairly easy. Draw out the recursion tree
11.
by sanjoy_das 9y ago
I can never understand this attitude. Programmers are people -- why is it surprising that some of them are ethically flexible?
12.
by sanjoy_das 9y ago
My guess is that they meant "up" in the sense of "up in post dominator tree".
13.
by sanjoy_das 10y ago
> How did the other thread get the reference to the object? The only possible existing reference is the one we are using to decrement the shared counter. I don't think this affects the point you're trying to make, but I suppose
14.
by sanjoy_das 10y ago
In (other) words, the situation is that you've just decremented the reference count of an object, because you've nulled out the only location in the heap that reached it. The reference count becomes zero after decrementing, so yo
15.
Reference Counting: Harder Than It Sounds(playingwithpointers.com)
53 points by sanjoy_das 10y ago|24 comments
16.
by sanjoy_das 10y ago
Yup. The "obvious" downside to that is that you'll burn CPU cycles and memory by generating and keeping around a slow-but-correct compile for every function.
17.
by sanjoy_das 10y ago
Is this what you're looking for: http://www.playingwithpointers.com/check-widening-in-llvm.ht... ?
18.
by sanjoy_das 10y ago
Yes they're definitely close, but I don't know if there are subtle differences in semantics between what we have in LLVM and what Swift needs (since I'm not familiar with Swift).
19.
Check Widening in LLVM(playingwithpointers.com)
57 points by sanjoy_das 10y ago|10 comments
20.
[pdf] Solving and Verifying the Boolean Pythagorean Triples Problem(arxiv.org)
2 points by sanjoy_das 10y ago|0 comments
21.
by sanjoy_das 11y ago
Interesting observation -- just because I've checked `%i` is within array bounds, doesn't mean `a[%i]` is safe to access, since `%i` could be `undef` and pass the range check spuriously.
22.
by sanjoy_das 11y ago
From the thesis the post linked to: ``` Although limbo lists are accessed using lock-free operations, and garbage collection does not interfere with other mutator processes, this reclamation scheme is not strictly lock-free. For example, a
23.
by sanjoy_das 11y ago
With ARC sharing objects across threads becomes trickier. First of all, in the general case you'll have to do atomic increments and decrements which tend to be fairly expensive, and they'll be sitting right in the middle your cor
24.
by sanjoy_das 11y ago
Another interesting data point is libFirm: http://pp.ipd.kit.edu/firm/ which regalloc's directly over SSA.