Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
siraben
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
22 ms
·
241.
▲
by
siraben
5y ago
> When you do that, do you also need to compile the applications during installation…? (E.g. stuff written in Rust/C/C++) If it's in Nixpkgs and it builds, then you skip the building step entirely and fetch from cache. >
242.
▲
by
siraben
5y ago
Homebrew has been pretty poor IME. It is not possible to pin the homebrew repository per project, dependency confusion happens a lot (try installing different versions of core libraries at the same time), the way it messes with macOS file s
243.
▲
by
siraben
5y ago
Looking at bingo’s features, you already get most of them for free in Nix, such as multiple package versions, isolation and naming binaries to what you want. But the key difference is that Nix’s dependency specification is exact, not nomina
244.
▲
by
siraben
5y ago
I recently packaged fq (written in Go) in Nixpkgs[0] and it was a breeze. You just have to specify the vendor and source hashes (which can be done automatically), and you get reproducibility for free (at least in the build environment.) [0]
245.
▲
by
siraben
5y ago
LaTeX starts being a massive pain once you write tables—to remediate that I use Org mode’s table editor[0]. Combined with the ability to run code blocks and parse data, it makes LaTeX a very flexible document format. For instance I had a
246.
▲
Lmfao (Assembler for Malbolge Unshackled)
(github.com)
1 points
by
siraben
5y ago
|
0 comments
247.
▲
by
siraben
5y ago
What resources are there for learning about how to read die shots? I'm surprised that one is able to glean so much information from it.
248.
▲
Schiehallion Experiment
(en.wikipedia.org)
4 points
by
siraben
5y ago
|
0 comments
249.
▲
by
siraben
5y ago
The latter! If merged the package set that uses uutils for stdenv would be accessible via an overlay (similar to the cross-compilation infra we have), so one could build pkgsUutils.hello to build GNU Hello, for instance.
250.
▲
by
siraben
5y ago
Nixpkgs has a PR for replacing the build environment of packages with uutils-coreutils[0]. From testing by building various packages over a dozen bugs were reported upstream, but a lot of software does build successfully with uutils[1][2],
251.
▲
by
siraben
5y ago
> I would say that Magit and structural editing using Paredit are the two most important technologies that make programming great. I would also add undo-tree to that list, it's like having a lightweight VCS on every file without nee
252.
▲
by
siraben
5y ago
> But still, the hacking scene is far from big. There is no SDK. There is an open source SDK[0] for compiling things to the reMarkable (1 and 2), and it's also a cross-compile target (1 and 2) in Nixpkgs[1][2]. [0] https:/
253.
▲
by
siraben
5y ago
Fractran is a wild ride as far as esolangs go. At first it seems impossible to build any programs in it, then you learn a few tricks like special primes for control flow and abstracting up to an imperative language. Being able to capture th
254.
▲
by
siraben
5y ago
> Just a reminder: Working on the development version of Emacs is easy on most operating systems. With Nix, it's amazing to be able to just run (on macOS/Linux) nix develop nixpkgs#emacs and be on my way to fetch the tar
255.
▲
by
siraben
5y ago
Nixpkgs recently added support for cross-compilation to M68K[0], so if you want to cross-compile programs to run on this emulator such as GNU Hello, for instance, run nix-build '<nixpkgs>' -A pkgsCross.m68k.hello You
256.
▲
by
siraben
5y ago
> What I want to know is, when are automated provers gonna be useful for thickies like me? Note that automated theorem provers is not the same as proof assistant . With ATPs you delegate most of the work to some proof search, whereas
257.
▲
by
siraben
5y ago
The kernel of a proof assistant is one of the most important components because it represents the foundation of reasoning in that logical system. There's a lot of introductory literature now, such as [0][1][2][3]. > What kind of axi
258.
▲
by
siraben
5y ago
git bisect works remarkably well on monorepos like Nixpkgs, where a commit hash lets you build software exactly as it was at a given point in time with complete dependencies. I bisected[0] 15K commits overnight to pinpoint when exactly a Ha
259.
▲
by
siraben
5y ago
That code looks exactly like the LOGO-like language aimed towards children. I wrote during a hackathon[0]. But for compactness I forgo the newlines, so the language looks like this: △ n = [ ↻ 30, ↑ n, ↻ 120, ↑ n, ↻ 120, ↑ n, right ]
260.
▲
by
siraben
5y ago
This isn't true if your language does tail-call optimization[0]. > I consider it to be a security risk. Again, non-issue if your language handles recursion properly (and in some languages like Haskell, "blowing the stack"
261.
▲
by
siraben
5y ago
> So randomness seems like a good fit for "choice" here, no? The axiom of choice is exactly the thing that tells us that we can make "random" choices. The way set theory works is that you have axioms to talk about int
262.
▲
by
siraben
5y ago
Hello! Nice to see another IRCer :)
263.
▲
by
siraben
5y ago
I said that if you don't want to use LEM in constructive maths you must also give up AOC, since AOC -> LEM.
264.
▲
by
siraben
5y ago
> Is picking an element from a single finite set something you can build using ZF? In ZF it's tautological by the axiom of regularity[0]. If you have a non-empty set X, there is an element y such that y ∈ X and X and y are disjoint.
265.
▲
by
siraben
5y ago
Somewhat not well known among all mathematical circles, but Diaconescu's theorem states that the law of the excluded middle follows from the axiom of choice[0]. This means if you wish to work in constructive mathematics (which has grea
266.
▲
by
siraben
5y ago
What language is/where is the title image from?
267.
▲
by
siraben
5y ago
Not covered in this PDF but extremely important is the notion of substitution. This is the only computational operation of the lambda calculus, and is the reason why lambda calculus is Turing-complete. Substitution is also hard to get rig
268.
▲
by
siraben
5y ago
Programming Languages Foundations is an excellent book. Of course it assumes familiarity with Coq (which Logical Foundations covers). Formal proofs about PLs are often boring and tedious to carry out on paper, especially if the property the
269.
▲
by
siraben
5y ago
Do you still use those Chromebooks in high school? Did technically-minded kids eventually find their way around the restrictions such as reinstalling the OS?
270.
▲
by
siraben
5y ago
Gen Z-er here. I really appreciate that the EFF is writing a guide aimed at students. I was in high school only a few years ago, we were provided MacBook Pros (13-inch, mid-2012), which for me also served as my personal laptop (my own MBP h
More ›