Lectures onType Theory
Qualified types, evidence, and ML modules
appendix sectionnotation

Qualified types, evidence, and ML modules

symbol meaning first
symbol meaning first
Kτ unary class predicate at monotype τ section 13.1
Pτ qualified type under finite predicate set P section 13.1
C;P;Γe:τ canonical qualified source typing section 13.2
resolveC,Δ(p)=d deterministic dictionary-evidence construction lemma 11.1
C;PQ class-evidence entailment from canonical assumptions section 13.1
nfC(P) substitution-natural canonicalization result ok(Q,η) or reject(p), with factorizing evidence lemma 11.2
WC(Γ,e) qualified Algorithm W result section 13.2
SΓ canonical action of type substitution S on a qualified typing environment, with evidence transport section 13.2
ΔQeΔP dictionary-evidence transport from the canonical telescope ΔQ to the required interface ΔP section 13.2
As atomic module signature embedding the kind or type A convention 16.13
Su action of type substitution S on evidence-core syntax or an evidence template theorem 11.6
DWe:τu inference-indexed dictionary elaboration theorem 11.6
Ty kind of static constructors in the reduced module calculus section 12.1
B(u::κ;τ) basic module signature definition 12.1
Sigma(X:σ1).σ2 dependent hierarchy signature definition 12.1
Pi(X:σ1).σ2 functor signature definition 12.1
Sing(c) singleton kind recognizing constructor c section 12.1
M.s, M.d static and dynamic projections of a basic module definition 12.2
κ1kκ2 module-calculus subkinding section 12.2
τ1<:τ2 ordinary dynamic-type subtyping section 12.2
σ1sσ2 subsignature matching section 12.2
Pack(σ) target package/product/function type definition 12.5
mcoeD target coercion induced by matching derivation D definition 12.6
Openσ(z,X;q) scoped package opening definition 12.5
TρD(M) derivation-indexed module-to-package translation theorem 12.7
psig(p) principal signature of a closed projectible path definition 12.12

Search the book

Type to search the local edition.