29. tinyvm

This edition does not carry this chapter.

tinyvm is a virtual machine whose heap is a pool of objects reached through generational handles, so that a dangling reference in the guest program becomes a stale handle in the host — a trap with a name instead of an exploit. That is chapter 8’s Pool and handle spent on a real program, and it is the mechanism §29.3 and §29.4 exist for. Neither implementation in this edition can run it: the compiler declines to lower a Pool constructor, and the interpreter declines a field write through a handle. A project chapter ships whole or not at all, so the section numbers are reserved and the pages are not written.

The other five projects are here. Chapter 30 is the concurrent one, and chapter 32 spends the unsafe tier on an allocator, which is the closest this edition comes to a machine of your own.