logicaffeine_compile/tensor_graph/mod.rs
1//! The tensor graph — programs as tensor ops, and the transforms over them.
2//!
3//! [`front`] is the front end every tensor backend enters through: a program's tensor statements lifted, in order,
4//! into typed ops. [`graph`] is the one IR those ops form, each tensor with its facts, and [`eval`] what a graph
5//! computes, equal to the VM. [`symbols`] registers every fusion class, its kind and an exemplar of its pattern.
6//! [`fuse`] is the shared optimizer — one table of rules over the graph, reading [`facts`] and asking each chip's
7//! [`shim`] what it runs whole; [`numerics`] gives each product the quantized activation its chip reads. [`link`]
8//! resolves a graph against a chip's shim before the chip's own link builds it. [`smt`] states what a graph computes as
9//! terms, so a rewrite's meaning is an obligation a solver discharges. [`vjp`] differentiates a tensor program in reverse
10//! mode, writing its backward pass as ordinary LOGOS.
11pub mod eval;
12pub mod facts;
13pub mod front;
14pub mod fuse;
15pub mod graph;
16pub mod link;
17pub mod numerics;
18pub mod shim;
19pub mod smt;
20pub mod symbols;
21pub mod vjp;