Type Universes as Kripke Worlds
summary
Paper claims that stratifying allocated types into a type universe hierarchy (each universe ↔ a semantic Kripke world per universe) removes the usual type–world circularity for a large class of mutable references, letting the semantics distinguish past-quantifying (predicative) from future-quantifying (impredicative/higher-order) allocations. It gives a syntax with kinding, a semantics that resembles regions, implements leveled possible-world relations, proves termination for the fragment, and characterizes which cyclic references are disallowed.
AI-written summary · about
chapters (17)
- 0:00Higher order mutable state
- 2:31Possible worlds for mutable refs
- 4:58Functions in possible worlds
- 7:05Higher order state circularity
- 9:55Type universes for allocations
- 13:27Type universe hierarchy
- 15:35Semantic equations
- 16:38Recap: type universes & termination
- 17:21Q&A: disallowed programs
- 18:24Termination proof
- 19:08Closure conversion relation
- 20:34Termination with higher order refs
- 21:15Separation logic comparison
- 21:57Step indexing vs type universes
- 23:21Propositions hierarchy & related work
- 24:02Branching timelines & type levels
- 25:27Polymorphism & future work
