concept
active
concept:well-known-key-for-type-classwell-known key τ for type/class
A distinguished key used in α1 to identify an object's type as the starting point for lookup.
Neighborhood — ranked by edge-count
Methods (1)
method
- pre-lookup (α) and post-lookup (β) transformationsassociated_withParameterising r with α_i for key transformation before lookup and β_i for recursive retry on ε.
Concepts (1)
concept
- dynamic binding for class-based inheritance using σ and τassociated_withCombining α1 with τ (type) and β1 with σ (supertype) to model class-based OO with inheritance in the associative model.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- A distinguished key used in β1 to delegate along an object chain (supertype).
- Notion where all interventions on algorithm A are allowed; gives equivalence between algorithm and DNN
- Principle that the instance's meaning follows the meaning's instance; every TCM failure indicates an abstraction leak.
- Central design question of denotational methodology; asks what semantic meaning should precede implementation choice.
- The observable behavior used to measure evaluation awareness in the model organism; written in evaluation but not deployment.
- Using two keys (k1, k2) to identify segmented memory: k1 as object/segment, k2 as slot/field.