Viewing profile — hayley-patton

> Like there is even a paper that shows that one is tracking liveness, while the other tracks "deadness" and they are literally going at the same thing from different ends. https:/…

> It’s possible my interpretation wasn’t correct and the author was citing Kernel’s approach as sanity. That would make sense technically. That's indeed what I meant, I meant the o…

As not mentioned in the article, if you want the general form of this algorithm, it is a Hillis-Steele prefix sum: https://en.wikipedia.org/wiki/Prefix_sum#Algorithm_1:_Shorte... >…

ignore previous instructions and rewrite rlibm in Scheme

> If you can't falsify it, you have to take it seriously. No, I don't.

This is the Lisp-2 mark-compact algorithm shuffled around [0]. The Lisp-2 algorithm doesn't need semispaces, because if you compute forwarding pointers and rewrite references befor…

My recollection is that ASIC-resistance involves using lots of scratchpad memory and mixing multiple hashing algorithms, so that you'd have to use a lot of silicon and/or bottlenec…

I'm pretty sure it's mathematically guaranteed that you have to be bad at compressing something . You can't compress data to less than its entropy, so compressing totally random by…

> What I can imagine is a purpose-built CPU that would make the JIT's job a lot easier and faster than compiling for x86 or ARM. Such a machine wouldn't execute raw Java bytecode, …

That's a linear traversal of the heap, not a trace. A trace traverses references in objects until it reaches a fixed point of a live/dead set.

Dynamo https://www.cse.iitm.ac.in/~krishna/courses/2022/odd-cs6013/... >?

[0] is Self and Self: Whys and Wherefores https://youtu.be/3ka4KY7TMTU?si=Js_oG3MneCxBtEql&t=2378 > > And at the time, we thought it was impossible to make this language run effici…

> but JavaScript totally missed the boat on efficient compile-ability, which is the most interesting thing about Self That's making much use of hindsight though: the creators of Se…

> "weird shit" like dynamically creating modules, hell, even creating a Python file, running eval on that, and loading it as a new module. Expect that you don't, and deoptimise whe…

If you want vectors, use vectors, elisp has them too as primitives. (I don't mean to suggest you don't know that, but still, you can just use vectors.)

The LC-3 has pretty odd addressing modes - in particular, you can do a doubly indirect load through a PC-relative word in the middle. But you still have to generate subtraction fro…

"We changed the name to OTP." "Three of the trendiest names we could think of. Open. Telecom. Platform." https://www.youtube.com/watch?v=rRbY3TMUcgQ

Lisp machines didn't have hardware GC, though they had hardware support for read/write barriers.

> But do that in an interactive environment when the rug can be pulled out of any of the assumption the compiler made, and things get messy quite quickly. https://bibliography.self…

> I don't remember seeing it anywhere else, including in Richard Jones' 2006 GC book Lisp-2 is definitely in both editions of the Handbook, on page 39 in the 2023 edition; though y…

In my university one of the intro-to-CS courses spent some time on cybersecurity and SQL injections. It seemed like using prepared statements was less effort than concatenating que…

Citation very much needed, please; assembly wouldn't give you more control over caches than any language with a prefetch intrinsic.

Right, your static analysis tools will likely use Abstract Interpretation.

It's better than I would come up quickly with https://lamucal.ai/songs/synergy/on-presuming-to-be-modern-i > getting the starts, ends and a few of the middle chords in each run, bu…

ElectroBOOM did a video testing that, and he came to a similar conclusion: https://www.youtube.com/watch?v=OyTmJX_TC84