alphaconvert.bsky.social
CS PhD student at Penn and NSF GRFP fellow. Types, Programming Languages, and Distance Running.
178 posts
1,094 followers
204 following
Regular Contributor
Active Commenter
comment in response to
post
Loose affiliation of millionaires and billionaires
comment in response to
post
I have occasionally wondered "what would it have been like to have Richard as a high school teacher", and I am not at all surprised that the answer is "very fun"
comment in response to
post
That building was so good! And it had one of the good coffee shops in it
comment in response to
post
I think about this tweet from Siva constantly
comment in response to
post
What does agentic coding mean here?
comment in response to
post
Come watch! It’ll be fun.
comment in response to
post
Scott Aaronson
comment in response to
post
Not yet!
comment in response to
post
This one gets me at least once a week. @yminsky.bsky.social the recent blog post doesn’t mention… was this intentional?
comment in response to
post
Sure, I get that that can be valuable.
But the framing of the whole article is against the backdrop of a constitution that de facto no longer exists. It just completely ignores the facts on the ground.
comment in response to
post
Very good piece. Seeing way too many people that seemingly cannot come to grips with the fact that the constitutional system is over.
It doesn't matter that they "can't" do any of this – they already have.
comment in response to
post
Indeed
comment in response to
post
Putting the lock in caps lock
comment in response to
post
For the record, the OCaml coercion operator should be the other way around.
comment in response to
post
"This isn't important for using UTC, but is very cool"
comment in response to
post
Did you hear specifically that PhD researchers are cut off? This post mentions postdocs, but not PhD students.
(I’m a PhD student funded by the NSF GRFP)
comment in response to
post
Oh, right. So the GC knows where to start scanning, yes?
comment in response to
post
Right, that would make sense. But I can't actually change the type of the field, it needs to remain compatible with someone else's types :(
comment in response to
post
Even if the record field is marked as mutable? I.e. I can swap out the pointer, but I can't touch what it points to?
comment in response to
post
(I've managed to do this with the C FFI... but I'd rather do it pure OCaml)
comment in response to
post
@thenumb.at, any ideas?
comment in response to
post
This is praxis
comment in response to
post
Like, the cool thing about defining the free monad as m = 1 + f + f^2 + ...
Is that it's very clear that it's the least type with injections f -> m and 1 -> m, and a map m^2 -> m.
comment in response to
post
Oh, sure. One can write down the GADT for ASTs of Applicative Expressions. But that feels like cheating :)
comment in response to
post
I keep trying to write one, and each time I keep accidentally writing something that has a Monad instance...
comment in response to
post
No :)
This is the distinction I was trying to draw.
comment in response to
post
I guess I could've just said "search" :)
comment in response to
post
To me, “program synthesis” means there’s some amount of enumerative search going on.
comment in response to
post
When they say "program synthesis"... do they mean the same thing I do when I use those words?
comment in response to
post
What do you mean by “short circuits values”?
comment in response to
post
Thanks!!