Distinction Ontology: A Sketch of Computational Formalization — Transformational Form Calculus (TFC)

Abstract

Transformational Form Calculus (TFC) is an executable formalization of a line developed in Distinction Ontology. Rather than starting from objects, fixed operations, or network primitives, it begins from distinction as the retained content of a distinguishing movement. A form is treated as an organized trace of such movement, and computation as the modification of a form’s admissible transformation space under the action of emergent distinctions. The construction unfolds parameterized transformation families and distinction-directed narrowing; projection and materialization as asymmetric transformations; and identity, generation, repair, verification, revision, locality, escalation, and synthesis as stable configurations rather than independent primitives. Compositional forms and many-to-many transformations yield restricted network-like semantics and concurrency, while group actions, factorization, symbolic matching, continuous parameter families, and numeric lowering provide different structures and solution methods for the same general movement. A reference implementation tests whether these regimes require an extension of a minimal kernel consisting of Form, Delta, TransformationFamily, CandidateSpace, and Executor. The experiments reproduce multistep graph construction, projection and materialization, token-network-like computation, conflict and independence, locality and escalation, continuous parameter estimation, and GPU-backed candidate evaluation without adding domain-specific kernel entities. These results provide computational evidence rather than a proof of generality or formal equivalence with the compared formalisms. They support a narrower claim: diverse computational organizations can be expressed through a shared contour in which distinction narrows possible movement, a transformation is selected and executed, and the resulting form gives rise to a new distinction.