Logotic Programming Module 0.9 is the archive’s first full specification for semantically computable operations. It begins from the Liberatory Operator Set, whose seven registers function as a kernel, and argues that a kernel alone is not yet a language. Version 0.9 adds the types, compositions, granular operations, failure modes, verification criteria, and standard programs required to write and test transformations of meaning-bearing structures.
The base types are Sign, Field, Operator, Channel, Stack, and State. A Sign has surface and function; a transformation is valid when function survives even if surface changes. A Channel has bandwidth, fidelity, latency, and provenance capacity. A Stack records the ordered operators through which a sign passes.
Seven primitive operators form the kernel. D_pres preserves semantic depth; N_c prevents terminal closure; C_ex widens context without losing coherence; N_ext resists extraction from native relations; T_lib allows later texts to reconfigure earlier interpretation; O_leg protects legitimate opacity; and P_coh holds contradictory but coherent signs together. Every operator is specified in three registers: formal engineering, executable praxis, and mythological installation.
The module expands these primitives into sequential, parallel, conditional, asymptotic, and recursive compositions, along with forty-one micro-operations and larger standard programs. It also names failure states such as flattening, crystallization, dispersal, isolation, messianism, obscurantism, and relativism, and proposes thresholds by which conformance may be assessed.
Version 0.9 calls this development the Computable Turn. It is the operation calculus and language design, not yet the complete runtime. Version 1.0 adds enforceable types, small-step semantics, compiler and execution environments, and the eighth Ω_∅ operator. The later versions should not erase v0.9’s identity as the document that first made LOS granular, composable, and testable.
Referenced by 67 other entities in the archive. See the full Knowledge Graph for reference paths, or the primary record for the full deposit with reference details.