Lectures onType Theory
Lexical handlers and direct compilation
appendix sectionnotation

Lexical handlers and direct compilation

symbol meaning boundary
symbol meaning boundary
L,P Lexa run-time data label and static code label labels from different cards are not identified
M,H,K,E,t Lexa code memory, heap, context, environment, and current term untyped 2024 source
hdl(L,Po,Lenv,[]) Lexa handler frame selected by identity L not name search
Lk,cont(K),ns one-cell resumption label, captured context, and consumed marker dynamically one-shot
MHR Salt code, heap, and register configuration 2024 target only
sp,ip,exch Salt stack pointer, instruction pointer, and exchanger location exchanger alternates saved stack tops
TLexaSalt()Γ 2024 Lexa-to-Salt translation untyped behavior theorem
ΘΔΣΓt:τt 2025 SL typing and SL-to-TL translation separate from Lexa/Salt
i^,i˚, TL label-parameter, capability-parameter, and capture indices components of a clue
H,hopperH call-site provenance metadata and its partial clue rewrite consulted only during search
Λcap typed lexical-handler source translated by CPS to System F neither Lexa nor SL
λ,δ{deep,} row-typed source and its deep/shallow handler tag generalised-continuation card
θ,χret,χops::κ pure frames, return clause, and operation dispatcher atop a continuation untyped CPS target
C[],res,res named higher-order CPS map and distinct deep/shallow resumption forms no target typing theorem

The symbols L and must remain distinct: L is a 2024 run-time identity, while is a 2025 source label variable. Likewise the named Lexa/Salt map and the SL/TL elaboration arrow denote translations with different domains, codomains, and theorem statements.

Search the book

Type to search the local edition.