Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
slavapestov
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
31.
▲
by
slavapestov
3y ago
I enjoyed reading this book a few years ago: https://www.amazon.com/Introduction-Solid-Modeling-Martti-Ma...
32.
▲
by
slavapestov
3y ago
The older Mac versions of Eudora were pretty lightweight. You could even run it on a Mac Plus with MacIP over LocalTalk.
33.
▲
by
slavapestov
3y ago
HP48, of course.
34.
▲
by
slavapestov
3y ago
Yeah, but it’s true in a sense because an element of a finite-dimensional vector space can be thought of as a function from a finite set into a field.
35.
▲
by
slavapestov
3y ago
> Another issue would be a coherent concurrency system. Today we have a mix of gcd and actor system, declarative task, async await, etc which when put together makes me totally unable to understand what's going on in a real world pr
36.
▲
by
slavapestov
3y ago
"The Design and Implementation of the 4.4BSD Operating System" is a classic: https://www.amazon.com/Implementation-Operating-paperback-Ad...
37.
▲
by
slavapestov
3y ago
“Hidden” from whom and how? “Same fields in beginning” doesn’t characterize multiple inheritance. “Tagged structs” are just one implementation strategy for one kind of polymorphism, and “tagged” and “struct” are themselves jargon. Using and
38.
▲
by
slavapestov
3y ago
Stack code can be mapped to register code trivially if you impose some restrictions (each word has a static effect and both branches of a conditional have the same effect). Then lowering to SSA form performs an “abstract interpretation” whe
39.
▲
by
slavapestov
3y ago
I don’t care what anyone says, I’m sticking with Computer Modern.
40.
▲
by
slavapestov
3y ago
The Riemann hypothesis.
41.
▲
by
slavapestov
3y ago
We need to bring back Oberon. Fast compile times, automatic memory management, live environment.
42.
▲
by
slavapestov
3y ago
Elliptic curves over finite fields have immediate applications to cryptography, but elliptic curves over the complex numbers are cool too. Just like the sine and cosine parametrize the circle, elliptic functions parametrize elliptic curves.
43.
▲
by
slavapestov
3y ago
Why do you use Illumos?
44.
▲
by
slavapestov
3y ago
LLVM is not a language, it’s a C++ library. There also happens to be a printer and parser for a textual representation of the IR, but it’s far from complete and doesn’t let you do many things the C++ allows. The downside is that your fronte
45.
▲
by
slavapestov
3y ago
If you can rebrand yourself as an "expert" in some shiny new thing by spending a few weeks at a boot camp, there probably isn't much there and you will be competing for the same jobs against countless others who did the same.
46.
▲
by
slavapestov
3y ago
If you’re into that kind of thing, here is an article about the historical development of the gamma function: http://sgpwe.izt.uam.mx/files/users/uami/jdf/proyectos/Euler...
47.
▲
by
slavapestov
3y ago
> The offices for Google Cloud were described as a "ghost town" by Alphabet and Google CEO Sundar Pichai in March, which he said some employees had complained about. "It's not a nice experience." So the office pe
48.
▲
by
slavapestov
3y ago
I tried out Bard the other day, asking some math and computer science questions, and the answers were mostly bullshit. I find it greatly amusing that people are actually using this as part of their day-to-day work.
49.
▲
by
slavapestov
3y ago
> Having seen a few references on here to Rust kicking the bucket…is that a risk with Rust? IMO Rust is long past the point (in terms of real world usage, commercial backing, etc) where it might “kick the bucket”.
50.
▲
by
slavapestov
3y ago
> Yeah, and by representing the differences this way, Rust allows you to easily decide whether an object is used directly or is wrapped in a rc box when its used, instead of when it's defined, often not by you, and when you change y
51.
▲
by
slavapestov
3y ago
> It's super easy to cause its type check to timeout, which is something I haven't seen when using Rust. Yeah, the operator overloading design makes it too easy to construct an exponential search space. > For instance, Swift
52.
▲
by
slavapestov
3y ago
> What are the increases in power you consider lisp users blind to? Static typing, mutable values with unique ownership.
53.
▲
by
slavapestov
3y ago
Learn math, it will never become obsolete.
54.
▲
by
slavapestov
3y ago
Some of us prefer to read primary sources written by other humans, instead of a hallucinatory regurgitation from a probabilistic token stream model.
55.
▲
by
slavapestov
3y ago
Swift uses the algorithm from this paper: https://os.unil.cloud.switch.ch/tind-customer-epfl/07596cb2-...
56.
▲
by
slavapestov
3y ago
Not the case when you have polymorphic literals, like in Swift or Haskell: let x: Int = 123 let y: Double = 123 But it looks like here the problem was not the type checker anyway.
57.
▲
by
slavapestov
3y ago
Looks like the time was being spent in LLVM, not the type checker as everyone is assuming here: https://forums.swift.org/t/why-is-swift-so-slow-timeout-in-c...
58.
▲
by
slavapestov
3y ago
My point is that the view of a compiler as a series of transformation passes from a source program to machine code, implemented as pure functions, is an entirely appropriate way to describe how they work in a random introductory blog post?
59.
▲
by
slavapestov
3y ago
> Both clang and gcc support `-fprofile-generate`. Beyond that generic infrastructure, in my area (DL compilers) if you're not doing PGO/autotuning you're not serious. How many binaries in a typical Linux distro are built
60.
▲
by
slavapestov
3y ago
> Like I get that the post is trying to paint some beautiful picture about how compiler passes are abstract beautiful transformations of representations of programs but it's not a useful picture at all. It is actually a very useful
More ›