Notices by Hayley (hayley@social.applied-langua.ge), page 2
-
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Friday, 13-Dec-2024 06:28:57 JST Hayley
@amszmidt if I speak I am in big trouble -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Monday, 09-Dec-2024 09:02:54 JST Hayley
@screwtape lol I see the compost/mulch part, but "people who really think Lisp is the best ..." and so on I don't see?
I don't delete things though -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Monday, 09-Dec-2024 08:40:52 JST Hayley
@screwtape can't say I remember saying this, sorry -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 12-Nov-2024 18:02:58 JST Hayley
@amszmidt may I recommend the eternal textbook -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Saturday, 02-Nov-2024 19:40:31 JST Hayley
@amszmidt well (CADR NIL) => NIL so I need 0 CONS boxes, which is very confusing -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Saturday, 02-Nov-2024 01:39:27 JST Hayley
@amszmidt how many CADRs is one CADR equivalent to -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 22-Oct-2024 16:19:12 JST Hayley
@lispi314 @clacke @wakame the communication grows quadratically when sharding, and shards are the secret ingredient in the webscale sauce or something I forgot the quote -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 22-Oct-2024 16:19:04 JST Hayley
@lispi314 @clacke @wakame it scales because it doesn't use joins -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Thursday, 11-Jul-2024 11:14:05 JST Hayley
@whiteline @feld @sun @lispi314 structured programming is not how computers work, teach the first years goto -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 09-Jul-2024 01:10:08 JST Hayley
"Well, okay, there was the discussion the other day that C compilers can pull out loop invariants and other things. I wonder if we can just do this through codewalkers, macros and Coalton/CLTL2."
holy shit I really hate it in CL implementation can we get On the expressive power of programming languages for optimisations, you absolutely cannot do that through local macros
edit: or I guess you *can* but you need to wrap everything and you're writing a less crap CL source to source compiler, in which case STOP DOING THAT -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 09-Jul-2024 00:41:06 JST Hayley
small price for transactional memory and bandwidth -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Thursday, 21-Mar-2024 08:41:30 JST Hayley
@eris now find one into BDSM and there goes the whole phrase -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Thursday, 07-Mar-2024 09:41:22 JST Hayley
@eris but have you seen people who put a macOS window with padding, drop shadow and extra margins around a screenshot of one line of code -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 06-Feb-2024 22:45:26 JST Hayley
@amszmidt @kentpitman Lisp is unique in that we have Lisp dialects but no one ever says C dialect. (Okay, maybe I have read "Forth dialect" before.) -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 12-Dec-2023 16:13:06 JST Hayley
@icedquinn I thought about it for a bit and I think there is an argument that SATB does literally incrementally compute a snapshot by logging, though it’s more obvious in hybrid coalescing RC/SATB like Levanoni-Petrank and LXR where we’re logging the old values of fields/slots that we update. In pure SATB we only care for the old value to mark it before we update some location, so we mark it right before we update, processing the log entry immediately; coalescing RC needs to know both the old value and what location it came from in order to update refcounts, so we have to actually store the log.
-
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 12-Dec-2023 16:01:50 JST Hayley
@icedquinn there's a lot of incremental/copy-on-write systems which don't copy everything*, but that's possible. Maybe there's some cursed equivalence between SATB and CoW since tricolor and Cheney's algorithm have an equivalence in colours/cursors.
*e.g. persistent data structures, fork(), incremental backups -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 12-Dec-2023 15:47:21 JST Hayley
you mean to tell me that ice cream is not made of ice -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Tuesday, 12-Dec-2023 15:47:18 JST Hayley
just checked with a book written by snooty compsci academics, snapshot at the beginning preserves objects that were live if you took a snapshot at the beginning
("D2/T2 mutations" refers to some examples of breaking concurrent GC earlier in the chapter, it makes sense in context) -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Thursday, 12-Oct-2023 09:18:16 JST Hayley
@icedquinn @iska The IBM Recycler has cycle collection run concurrently. LXR does a concurrent full trace (necessary because it uses two bit saturating refcounts) too. -
Embed this notice
Hayley (hayley@social.applied-langua.ge)'s status on Thursday, 12-Oct-2023 09:17:22 JST Hayley
@icedquinn @iska very well: https://users.cecs.anu.edu.au/~steveb/pubs/papers/lxr-pldi-2022.pdf https://users.cecs.anu.edu.au/~steveb/pubs/papers/rcix-oopsla-2013.pdf