Recent submissions

Comment · 1 month ago
hope to get a greg collab on here sometime
Comment · 2 years ago
Comment · 2 years ago
Especially the Field model!
Comment · 2 years ago
given the crackpot proofs received by coq-club, i imagine it would indeed
Comment · 3 years ago
are there any documented cases of this actually happening in the wild?
Comment · 3 years ago
Thank you for the self-promotion, Scheme for Max looks like something I’ve been wishing for for a long time!
Comment · 3 years ago
Use an existential type, usually called Some in Haskell: https://hackage.haskell.org/package/some-1.0.5/docs/Data-Som... The implementation of this type one has in their head (a GADT) adds a boxing overhead, but the actual implementation in this library uses a newtype.

That way if you have a type Expr a, you can have a list type [Some Expr].

Comment · 3 years ago
yes: https://dspace.mit.edu/bitstream/handle/1721.1/130136/The%20...

(sorry for lack of details in my post, on mobile)

Comment · 3 years ago
No, it’s not—-they’re passing in a “node”, not a list, which always contains both a head element and a (nullable) tail pointer. That’s why it can’t separate the head in the case of size one: the node must maintain a non-null head.
Comment · 3 years ago
Comment · 3 years ago
This is absolutely ridiculous. I love it.
Comment · 4 years ago

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton