"If the lifetime can be expressed with a state machine then it needn't be garbage collected so long as the language is sufficiently expressive." One programmer

"If the lifetime can be expressed with a state machine then it needn't be garbage collected so long as the language is sufficiently expressive." One programmer here told me he does that in Ada and/or SPARK Ada using enumerated types encoding states. Now there's two of you. Most stuff I see like this are linear/affine/dependent types or separation logic. I rarely see people talking about simple solutions like this. Do you have any links that go in-depth on it with examples? It would be good to have something to pass along to people interested in this.