Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
siraben
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
21 ms
·
211.
▲
Apple Platform Security: Hardware microphone disconnect
(support.apple.com)
4 points
by
siraben
4y ago
|
0 comments
212.
▲
by
siraben
4y ago
I can confirm that this still works on several US airlines especially if they have a free messaging option.
213.
▲
by
siraben
4y ago
Some time ago I wrote an implementation of Forth that runs on the TI-84+ and TI-83+ calculators directly inspired by Jonesforth.[0] It runs under TI-OS as well, but the amount of available space is somewhat limited. On another implementatio
214.
▲
by
siraben
4y ago
ProofWiki is an amazing resource for someone studying CS and math like myself. Definitions and lemmas are hyperlinked and the proof style is very clear. They even have multiple proofs for the same theorem. For instance[0], and they have a w
215.
▲
by
siraben
4y ago
Note that when you use LSP with Emacs, installing language servers can quickly lead to dependency hell. I use home-manager[0] to specify which language servers I want installed[1] (among other things such as compilers for different languag
216.
▲
by
siraben
5y ago
I’ve been reading CS papers for a few years now (mostly FP or PL related) and wrote some summaries for a selection of them[0]. FP and PL literature is very accessible, many authors have a desire to communicate some aspect of programming la
217.
▲
Zee: A modern text editor for the terminal written in Rust
(github.com)
143 points
by
siraben
5y ago
|
85 comments
218.
▲
by
siraben
5y ago
Using Nix and home-manager I'm able to have this setup with Emacs work across Linux and macOS (x86 and arm64) because it compiles the grammars from Nixpkgs itself (the grammar list can also be augmented declaratively with other grammar
219.
▲
by
siraben
5y ago
Writing grammars presents an interesting set of challenges, especially dealing with ambiguity and precedence as you mention. I find that the `tree-sitter playground` command is convenient for interactively trying out different possibilitie
220.
▲
How to write a linter using tree-sitter in an hour
(siraben.dev)
270 points
by
siraben
5y ago
|
11 comments
221.
▲
by
siraben
5y ago
XOR swap, as others have noted, is another very common way of implementing a swap without temporary variables. It's also a good exercise for formal verification, here's a proof in Coq of XOR swap's correctness in C.[0] [0]
222.
▲
by
siraben
5y ago
This project[0] is a fork of Ben Lynn’s compiler that can be bootstrapped from a binary less than 1 KB in size. The dialect of Haskell it accepts is impressive for its size and GHC-compatible too. [0] https://github.com/oria
223.
▲
by
siraben
5y ago
Yes, this is possible with language injection[0] [0] https://tree-sitter.github.io/tree-sitter/syntax-highlightin...
224.
▲
How to write a tree-sitter grammar in an afternoon
(siraben.dev)
112 points
by
siraben
5y ago
|
9 comments
225.
▲
by
siraben
5y ago
For CS, it was SICP. I read it in high school (accompanied with the lecture series[0]) and it lead to me learning about functional and logic programming, compilation, algorithms and data structures and more. It was more than enough to pre
226.
▲
Dirty Nix flake quality-of-lie hacks
(siraben.dev)
2 points
by
siraben
5y ago
|
0 comments
227.
▲
by
siraben
5y ago
Also, one bitcoin transaction takes as much energy as 1.5 million visa transactions[0]. [0] https://www.statista.com/statistics/881541/bitcoin-energy-co...
228.
▲
by
siraben
5y ago
Is there a public link for your verifier? What style of semantics are you using for it and what sort of programs and features can you reason about?
229.
▲
by
siraben
5y ago
It was actually entirely done through the professor’s notes. I’m not sure what the reference materials were but it seemed pretty standard (group theory up to free groups and relations, ring theory up to principal ideals).
230.
▲
by
siraben
5y ago
I recently took a graduate real analysis course and modern algebra course at the same time, and in the former course, many of the strategies listed in Tao's article came up. However, one important caveat is that several of them are sp
231.
▲
by
siraben
5y ago
There is an issue on Nixpkgs to package this absolute (but beautiful) monster of a package.[0] [0] https://github.com/NixOS/nixpkgs/issues/131492
232.
▲
by
siraben
5y ago
> The difference is significant — the naïve attempt described in the article does not work on the actual problem. Thanks! I'll update the article to say this. > And regarding the title, I am glad you changed it... Hopefully dang
233.
▲
by
siraben
5y ago
Thanks, the title has been changed on HN and the article.
234.
▲
by
siraben
5y ago
IntMaps in Haskell actually have time complexity of O(min(n,W))[0] = O(1) for this problem, for insertion and getting the minimal element where n is the number of entries in the map (which is 9 here) and W is the word size in bits. Another
235.
▲
Speeding up my Advent of Code solution with Dijkstra's Algorithm
(blog.siraben.dev)
94 points
by
siraben
5y ago
|
42 comments
236.
▲
Show HN: A sudoku solver in pure Nix
(github.com)
3 points
by
siraben
5y ago
|
0 comments
237.
▲
Billard-Ball Computer
(en.wikipedia.org)
2 points
by
siraben
5y ago
|
0 comments
238.
▲
by
siraben
5y ago
The reason that motivated me to run a mailserver is best described as an artisanal choice, not a practical one[0]. After all, I'm running this on a constrained system and certainly don't have ambitious to scale this to corporate
239.
▲
by
siraben
5y ago
It’s registered via Google DNS. Looks like terraform can manage the records for it. Thanks!
240.
▲
by
siraben
5y ago
I recently got into running my own mail server on my NixOS instance using[0]. The server has a total of 1.5 GB RAM and 10 GB of disk space, but it was sufficient to get 10/10 on mail tester[1]. Here's my 12 line mailserver confi
More ›