First Class Implementations: Climbing up the Semantic Tower
summary
Claims that a runtime protocol—extracted via Curry‑Howard and expressed with category theory using partial functors—lets one swap implementations upward in a semantic tower by relying on generalized safe points that make concrete states interpretable at higher abstractions. It demonstrates how observability plus completeness composes across compilation stages and enables live migration, time‑travel debugging and orthogonal persistence at predictable cost, with a proof‑of‑concept in Scheme that shows the idea works but is research code, not production ready.
AI-written summary · about
chapters (10)
- 0:00Start
- 0:56Runtime Reflection and Static Semantics
- 5:32Category Theory
- 13:29Properties of Implementation
- 16:23Advance Preservation
- 22:25Operational Semantics
- 29:50Compilation
- 31:34Semantic Tower
- 32:29Observability
- 35:08Refactoring
related talks
33mObservability Pipeline Query Languages: Present and the Future
18mTracing OCaml Programs
37mObservability-Driven Development
25mNo Return: Moving beyond transactions in software and in life
10mLightning Talk: Semantics Matter! Lessons From Stabilizing OpenTelemetry’s System Conv...
46mObservability in an Asynchronous World
05mIgnite: Magic of Application Modeling
55mThe Incredible Efficiency of Log Unification!