~/talk

Programming Languages Must Have Formal Semantics. Period.

Talkat RPLS 2025 · on Tuesday, 2025-06-17· [compilers-and-language-design]
links:none on file
slides:none on file

Argues that every language gets a machine-checkable formal semantics first and that all tools—interpreter, compiler, verifier, model checker—are automatically derived from it using the K framework. Shows an executable semantics for kernel C with about 120 cells and >5,000 semantic rules, and a K implementation of many real languages; K itself is ~500k LOC. Demonstrates modular rewrite rules (contextual cells), tool regeneration by re-running the semantics, translation‑validation proofs and a tiny proof checker to make K trustless, noting runtimes ~one order of magnitude slower.

AI-written summary · about

  1. 0:00Introduction
  2. 1:04Modern software complexity
  3. 3:56Language tool challenges
  4. 8:51Semantics-first design
  5. 14:31K framework cells
  6. 19:54Executable formal semantics
  7. 21:20Trustless K with translation
  8. 24:07Deriving tools from semantics
  9. 30:05Q&A
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.