Unboxing Virgil ADTs for Fun and Profit · HackerPapers discussions

Unboxing Virgil ADTs for Fun and Profit — mentioned by titzer

Sun, 25 Jan 2026 01:00:15 GMT

The description is in the paper, but not all of it is implemented. https://arxiv.org/abs/2410.11094 Bradley implemented a prototype of the packing solver, but it doesn't do the full generality of what is proposed in the paper.

Paper and discussion history. A mention is not an endorsement.

Unboxing Virgil ADTs for Fun and Profit — mentioned by titzer

Sun, 25 Jan 2026 00:58:56 GMT

You might want to have a look at the unboxing and packing annotations that are proposed for Virgil. The unboxing mechanism is implemented and there was a prototype of the packing mechanism implemented by Bradley for his thesis. I am working on making a more robust implementation that I can land. https://arxiv.org/abs/2410.11094 I'm not sure I understand your example; if I am looking at it right, it has overlapping bitfields. But supposing you didn't want overlapping fields, you could write: type Dang(tom: u11, baz: u16, bar: u5, foo: u5) #packed; And the compiler would smash the bits together…

Paper and discussion history. A mention is not an endorsement.

Unboxing Virgil ADTs for Fun and Profit — HN submission

Thu, 17 Oct 2024 03:02:52 GMT

Unboxing Virgil ADTs for Fun and Profit

2 points; 2 discussion replies on HN. Paper and source history. A submission is not an endorsement.