Lectures onType Theory
Control operators and classical proofs
appendix sectionnotation

Control operators and classical proofs

symbol meaning first
symbol meaning first
ContA, letcc, throw continuation type, whole-stack capture, and reinstatement 35.1
F,K, Ke, Kv frame, stack, evaluation state, and return state 35.1
ss, ss one stack-machine transition and its finite closure 35.1
cont(K), K:AR internal persistent continuation value and stack typing 35.1
Av, Ac, ec CPS value type, computation type, and term translation 35.7, 35.8
Khk, sh stack-as-function and machine-state CPS translations 35.9
eβδe, eβδe one CPS-target beta-delta step and its finite closure 35.8
dneA, lemA control terms for DNE and excluded middle 35.15, 35.16
T,E,R, ι, ερ PPS kinds, empty ordered row, and row extension 35.18
Δ;Γe:τ/ρ PPS type-and-ordered-effect judgment 35.18
n-free(E) balance of unmatched lifts above the hole; application preserves it, a lift raises it, and the matching delimiter discharges one 35.18
[e], E[e] PPS lift/control mask and metalevel plugging into a one-hole context 35.18
k÷A, k÷N continuation-context entries for value and natural-result continuations 35.41
do, handle,
shift0, control0
deep/shallow operations and delimited capture forms 35.19,
35.20, 35.31
DH(), DD() named PPS syntax translations between shift0 and deep handlers 35.30
SH(), SD() named PPS syntax translations between control0 and shallow handlers 35.40
eie contraction closed by arbitrary one-hole term contexts 35.30
wit, prf, callcck hypothetical CBN strong projections and captured-context form 35.41

Search the book

Type to search the local edition.