What is PL Research?
summary
PL research centers on ways to get programming stuff for free: given X (syntax, specs) produce Y (IDE, compiler, proof) automatically. Concrete chain: a language workbench generates IDEs from grammar and type rules; a declarative name‑binding DSL yields incremental name analysis and generated algorithms; scope graphs unify binding across static analyses, runtime frames and type‑safety proofs; constraint-based resolution stitches name and type analysis together and enables mechanically checked safety via intrinsically typed definitional interpreters.
AI-written summary · about
chapters (18)
- 0:00Introduction
- 3:16PL search
- 4:21PL for free
- 5:05Automatic programming
- 5:44Programming languages
- 6:20Ideas
- 7:35Context
- 9:42Design
- 10:10Implementation
- 10:25Feedback Cycle
- 11:14Reading
- 23:27Scope Graphs
- 25:00Type Checkers
- 30:34Scope Graph
- 32:25Type Safety
- 34:24Type Safety Theorem
- 34:52How PLL Research Works
- 35:44Question
related talks
01h 02mProgramming Language Research for Technical and Social Good: What PL Can Do for Good?
25mFree without Pure: eDSL framework Plutarch
40mProduction Prolog
20mBeePL: Correct-by-compilation kernel extensions
35mDesigning Domain-Specific Languages: A Comparison of Three Approaches by Example
53mSemantics-based program manipulation in the age of LLMs
01h 07mInvited Talk - Guy Steele
15mLanguage-Parametric Reference Synthesis