1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
//! # DSFB Structural Semiotics Calculus (`dsfb-semiotics-calculus`)
//!
//! **Invariant Forge LLC** — April 2026 — Version 0.1.0
//!
//! This crate is the Rust type-level realization of the *DSFB Structural Semiotics Calculus*
//! (DSSC), a typed algebraic framework for deterministic, non-interfering, auditable
//! structural interpretation of residual trajectories.
//!
//! ## What this crate provides
//!
//! The crate encodes the core DSSC types and traits exactly as they appear in the companion
//! paper *"DSFB Structural Semiotics Calculus: Formal Syntax, Composition Rules, and Provable
//! Properties of Endoductive Inference over Residual Trajectories"* (Invariant Forge LLC,
//! DOI: 10.5281/zenodo.19446580). The type system enforces at compile time:
//!
//! - **Non-interference** (SC-2): `Observer` is a pure function over `Trajectory`; it holds
//! no mutable references to the observed system.
//! - **Totality** (SC-1): `Enduce::enduce` returns `Episode` for every input, never panics,
//! never returns `None`. An empty heuristics bank yields `Motif::Unknown`.
//! - **Auditability** (SC-3): Every `Episode` carries a `ProvenanceTag` recording the full
//! `(sign_sequence, grammar_path, add_descriptor)` derivation.
//!
//! ## IP Notice
//!
//! The Apache 2.0 license applies to this software artifact as an executable and distributable
//! work. It does not constitute a license to the underlying theoretical framework, mathematical
//! architecture, formal constructions, or supervisory methods described in the companion paper,
//! which constitute proprietary Background IP of Invariant Forge LLC (Delaware LLC No. 10529072).
//! Commercial deployment requires a separate written license. Inquiries: licensing@invariantforge.net
// Re-export the primary public API
pub use ResidualSign;
pub use ;
pub use ;
pub use Motif;
pub use ProvenanceTag;
pub use Episode;
pub use Enduce;
pub use ;
pub use Observer;