Abstract Operational Methods for Call-by-Push-Value
summary
Claims that categorical, higher-order GSOS methods instantiate to call-by-push-value and fine-grain call-by-value to yield modular, language-independent proof techniques. Uses presheaf categories over types and contexts, higher-order GSOS laws and relation liftings to synthesize applicative bisimulations and logical relations; the CBPV instantiation produces an applicative bisimulation characterized by 11 properties and a congruence proof whose conditions check in minutes rather than months, and the construction validates (works) for examples including embeddings of CBV/CBN.
AI-written summary · about
chapters (11)
- 0:00Abstract operational methods intro
- 4:57Syntax and semantics abstraction
- 11:39Call-by-push-value overview
- 13:25Modeling CBPV abstractly
- 16:16Takeaways and future work
- 17:22Q&A: Categorical models
- 18:46Q&A: Logical relations
- 20:16Q&A: Sigma functor algebra
- 21:20Q&A: Transition systems
- 22:43Q&A: Pre-shift categories
- 23:49Q&A: Extending languages
