Library / First Principles Framework (FPF) - Core Conceptual Specification
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 10:39:28 UTC · snapshot created 2026-10-03 10:40:04 UTC · last check 2026-10-03 11:50:05 UTC

E.18.2:4.2 - Expression families

Expression familyUse when it describesRequired boundary
graph, hypergraph, network expression, DSM, DMM, MDM, or matrixdependency, internal transfer, exact cross-member relation, adjacency, interface placement, clustering, or change propagation inside one selected TFS or across one selected TFS networknot the selected TFS or network: apply E.18’s one-TFS identity and selection constraints or E.18.NET’s membership, boundary, and cross-member relation rules to select that ontic subject; E.18.2 defines only this description; not work occurrence, gate passage, or evidence
mathematical path or path slicereachability, carried relation, currentness slice, refresh locality, or crossing-local replaynot a project procedure or performed sequence
tuple, record, slot relation, or typed relation expressionslot positions, relation arity, locus typing, and value placementnot a new U-kind and not a replacement for A.6.5 slot discipline
morphism, composition, category, operad, optic, or wiring expressioncomposition, interface, substitution, transfer law, or decomposition of selected transformationsnot proof that the represented work can be performed or that interfaces are semantically compatible
quotient, fold, coarsening, refinement, or factorizationcoarser/finer partitioning, aggregation, retained/lost structure, and alternative decompositionnot an identity claim without preserved/lost structure and return condition
algebra, semiring, equation system, or constraint systemoperation law, conservation, admissible composition, or constraint propagation over the selected structureApply A.6.0 for a separately needed formal-substrate declaration, A.6.1 for a reusable law-governed operation declaration and its application or realization claims, and the relevant subject and evidence patterns for any empirical-law claim. The mathematical expression alone establishes none of those claims.
learned representation, embedding, simulation object, or differentiable surrogateapproximate structure, optimization, similarity, or predictive proxy over transformation-flow structurenot architecture adequacy, OOD guarantee, causal proof, or release readiness by itself

These families are prompts for recovery, not a taxonomy of new FPF kinds. A local expression may combine several families; the record still names exactly one selected TFS or network subject, one current described part when relevant, and the declared use.