hayley-patton

7 ms·

31.
by hayley-patton 2y ago
I think module-null-sink and module-loopback could be used to create a virtual source which combines multiple sources, though the source/sink thing makes my head spin. Or, more simply, I suppose using the loopback of whatever audio out
32.
by hayley-patton 2y ago
I got lazy, to be fair: MORE book burning -X-> multi location backups -> book burning -> passing down fables -> the ever-finite span of life -> convection and time -> volcano induced winter -> lots of lava -> lots o
33.
by hayley-patton 2y ago
Does it give real citations? I've heard it gives bogus citations, though can't remember how well it went last time.
34.
by hayley-patton 2y ago
Narrator: "The code did not, in fact, auto-vectorise." (There's only addsd/movsd instructions, which are add/move scalar-double; we want addpd/movpd which are add/move packed-double in vectorised code.)
35.
by hayley-patton 2y ago
Dang, it's the shadow stack paper, not the BDW one! Sorry, my comment doesn't apply to shadow stacks and thus doesn't apply to the article.
36.
by hayley-patton 2y ago
We're going to put just a type ID in the word - you could probably get away with much smaller than a 64-bit ID, but padding will round it up to 64 bits in any case. The heap has exactly one tracing function and size function for all ob
37.
by hayley-patton 2y ago
Where do you get 24 bytes of overhead from? A mark-sweep collector only needs a bitmap of 1 bit per alignment granule. edit: oh, that's what the article uses - the tracing function and size function can be per-heap and the forwarding p
38.
by hayley-patton 2y ago
> In a custom language, this can be implemented very easily following the approach outlined in this paper: Accurate garbage collection in an uncooperative environment. Cheney's algorithm and conservative roots don't mix too eas
39.
by hayley-patton 2y ago
Omega combinators would have made for better growth hacking.
40.
by hayley-patton 2y ago
> but the fact that it then supports Scheme macros Good for them. > possibly share code between developing for the PreScheme compiler target and non-PreScheme targets "possibly" is a strong word, seeing that Pre-Scheme is a
41.
by hayley-patton 2y ago
"Unhappy the land that has no heroes!" "No. Unhappy the land that needs heroes."
42.
by hayley-patton 2y ago
The hell of the systems language is the systems, not that it has infix syntax.
43.
by hayley-patton 2y ago
This one? https://gist.github.com/no-defun-allowed/4f0a06e17b3ce74c6ae... It also responds to a few parents up "almost all of the innovations in lisp [...] have been absorbed into more popular languages" - pe
44.
by hayley-patton 2y ago
It has data races. Why would SBCL have a borrow checker?
45.
by hayley-patton 2y ago
> The first observation is that you can't do it at compile time. I've seen at least one blog entry that used a bytecode hack to replace a CALL opcode immediately before a RETURN opcode with a jump to the top of the function bod
46.
by hayley-patton 2y ago
I also suspect the author meant "humongous" in: > Shenandoah is location-based, so there are regions, and region sizes, and therefore _homologous_ allocation is a special case to be handled.
47.
by hayley-patton 2y ago
It's especially hard when you don't have semantics for your language outside of what your interpreter does. Then the semantics of the language in the book are plain bad: there is only dynamic scoping (oh, and the book often has pl
48.
by hayley-patton 2y ago
It is a very bad start and teaches writing an interpreter and not a compiler. https://gist.github.com/no-defun-allowed/7e3e238c959e27d4919...
49.
by hayley-patton 2y ago
I can no longer google "ML Kit" and find the ML compiler, instead I find Google's ML library. You win some, you lose some.
50.
by hayley-patton 2y ago
There's a lot of language semantics which make the REPL convenient to write interesting amounts of code in, Gilad Bracha details some in < https://blog.bracha.org/primordialsoup.html?snapshot=Amplefo... > (with the
51.
by hayley-patton 2y ago
Implementations interpret, languages don't; PyPy compiles and is about half the speed of V8. But one should put micro trust in a micro benchmark in general.
52.
by hayley-patton 2y ago
Compile SBCL with the command ./make.sh --with-mark-region-gc and the resulting build will use the mark-region GC. (Picking the GC at start-time instead of build-time would be very nice, but technically hard to pull off unfortunately.)
53.
Security release: Element X Android (0.4.12) and iOS (1.6.7)(element.io)
5 points by hayley-patton 2y ago|1 comments
54.
by hayley-patton 2y ago
I can view it just fine in Australia. Now I'm going to download a car too before I get caught.
55.
by hayley-patton 2y ago
SBCL cheats and copies starting from the first cons cell that is referenced from outside the list; this tends to be the start of the list, and so traversing just works. The contiguous copying also ends when a cons cell which was already cop
56.
by hayley-patton 2y ago
SBCL tries its hardest to allocate sequentially, then moves lists to be sequential in GC.
57.
by hayley-patton 2y ago
The Smalltalk special of Byte Magazine infamously has a hot air balloon floating away from an island with ivory towers on it. Flying things measure their altitude in feet, but the low level is low. Furthermore, according to Tubeway Army, bo
58.
by hayley-patton 2y ago
This isn't about Lisp in the browser though, it's about high-level low-level programming (to borrow the name from Daniel Frampton < https://www.steveblackburn.org/pubs/theses/frampton-2010.pdf >).
59.
by hayley-patton 2y ago
What was Brendan Eich doing that is covered in this article?
60.
by hayley-patton 2y ago
It's not always faster, so making it the default could cause regressions; it seems pretty stable now but the default (gencgc) had a head-start of a few decades for bug finding (and making).

More ›