hayley-patton

15 ms·

61.
by hayley-patton 2y ago
But Multics was written in PL/I (and the Burroughs B5000 system in Algol before) so Unix doesn't have an advantage there.
62.
by hayley-patton 2y ago
Sledgehammering a little TV was done in the video for Gary Numan - We Are Glass which predates the 1984 ad, which supposedly led to the video being banned from Top of the Pops: https://www.youtube.com/watch?v=KWR8vitO6wQ&amp
63.
by hayley-patton 2y ago
The typical consumer isn't empowered to modify or write a program, so why would they entertain the idea?
64.
by hayley-patton 2y ago
> It can be optimized away by a compiler to just fixed integers, sometimes Yep, SBCL does range analysis and can do inline fixnum or unboxed arithmetic.
65.
by hayley-patton 2y ago
SBCL eval interprets until you hit a lambda form, at which point it will compile (last I checked). But you are much more correct than who you replied to :)
66.
by hayley-patton 3y ago
RISC more accurately stands for "load-store architecture", which is very odd because RISC has four letters and there are only three words in load-store architecture.
67.
by hayley-patton 3y ago
There's work on porting MMTk to Julia, which will provide some well written GCs: https://github.com/mmtk/mmtk-julia
68.
by hayley-patton 3y ago
Smalltalk was named such as Alan Kay ( https://wiki.squeak.org/squeak/50 ) > had mentioned to someone that the "prose" of then current programming languages was lower than a cocktail party conversation, and
69.
by hayley-patton 3y ago
> but I find it hard to understand how Common Lisp compilers work – what with their readtables and read macros and normal macros Read tables and reader macros are used in the reader, which is separate from the compiler. The compiler macr
70.
by hayley-patton 3y ago
The compiler deals with code in S-expression form, represented as lists and atoms. Reader macros produce Common Lisp objects.
71.
by hayley-patton 3y ago
> To optimize this further, you need implementation dependent code and replace abstractions of S-expressions with native machine code This can be done by a program called a compiler. There are many compilers for Lisp. (In other words, th
72.
by hayley-patton 3y ago
One is parallel, using multiple cores to make collection happen faster, which increases GC throughput and shortens GC pauses. The other is concurrent and avoids pauses entirely, though it requires more bookkeeping from the application and m
73.
by hayley-patton 3y ago
> One of them is a parallel collector written by a university student (!!) which blows my mind. I didn't let schooling interfere with my education.
74.
by hayley-patton 3y ago
> So some languages/VMs apparently are more amenable than others. I thought Self was supposed to be harder to optimise due to using prototypes, accessor methods rather than distinguishing instance variable access, and generally fewe
75.
by hayley-patton 3y ago
I'm not very good at maths so I let Z3 work out some convenient seeds for me, leading to import java.util.Random; public class Hayley { public static void main(String... args) { byte[] b1 = new byte[4],
76.
by hayley-patton 3y ago
Self wasn't sufficiently fast? Craig Chambers's compiler [0] had to be careful around recursive inlining* but it's not that bad, and the compiler definitely came around in less than 30 years of Self or Smalltalk existing (eve
77.
by hayley-patton 3y ago
It's a Smalltalk implementation written in Smalltalk, which is designed to survive its internals modified at runtime, which is the "live" part. The paper exhibits conventionally tricky bits to modify like the garbage collecto
78.
by hayley-patton 3y ago
Are they trying to bring back SIMD-within-a-register? Though that only gives you ~one order of magnitude doing packed 4-bit stuff with 64-bit GPRs. And perhaps fixed-point, sign-exponent and posits are unregulated.
79.
by hayley-patton 3y ago
What's odd about using vector intrinsics with GC and/or JIT? I did my capstone project for university with intrinsics for SBCL - testing hand-vectorised code at the REPL is rather funny (as it's an interactive environment for
80.
by hayley-patton 3y ago
C11 has atomics and CAS, is C11 okay?
81.
by hayley-patton 3y ago
Looks like it's 10.7 kLOC whereas mimalloc is 8.8 kLOC, so it's not much more complex at that...amount of engineering, I guess. Also spotted that the mimalloc README says > Free-ing from another thread can now be a single CAS w
82.
by hayley-patton 3y ago
snmalloc batches up cross-thread frees, though generally any thread-local stuff is better than none.
83.
by hayley-patton 3y ago
> The standard library allocator keeps its state in global variables. This makes for a simple interface, but comes with significant performance and complexity costs Thread local allocation buffers?
84.
by hayley-patton 3y ago
> Given that branches are, well, just branches in any language, what makes OO so special? In principle you have calls to whatever method associated with a given object, which are indirect as there is not one statically-known target of th
85.
by hayley-patton 3y ago
If the allocator can't keep up with the code, then maybe the allocator simply is bad?
86.
by hayley-patton 3y ago
Rosetta on the M1 enables the total store ordering from x86, which has a stronger memory model than that of ARM. It also can compute the parity flag in hardware < https://bytecellar.com/2022/11/16/a-secret-a
87.
by hayley-patton 3y ago
You have lighter context switches [0] and finer-grained security domains; consider e.g. passing a pointer versus de/serialising across process boundaries. (The former benefits the latter too, since there's less of a performance co
88.
by hayley-patton 3y ago
WASIX?
89.
by hayley-patton 3y ago
Properties assigned to things which cannot have those properties. "Colourless green ideas sleep furiously" has many such errors for example.
90.
by hayley-patton 3y ago
If you insist.

More ›