cottax.core.maths¶
The mathematics: what a well-formed value is, said without naming a concrete type.
Dependency:
- places frozen/ (places: Place, Label, PlaceToPlace, the prefix order;
|| || frozen/: the frozen values, and what a check yields) ||——-> mints (Mint, a purpose a name is derived for; Minting, how a || || class of names wears one) / /
- definition <-’
||———– / /
- kinds graph (graph: the bindings and the theory over them; no kind named)
|| || / /
- nesting <—-’ (has a graph, and the nesting over it; contract, which builds
a Function per block; ProvedGraph, a proof’s base)
||——-> dispatch (the one Answer for a graph’s places, or its node names) ||——-> valued (GraphWithValues: a proved graph and a value at each input) ||———————— / / /
- plan/ cut_rules executable (plan/: algebra -> primitive -> ops, the edits as
|| records; cut_rules: which couplings a cut opens, || per functional cycle: CutRule and its finals; || executable: the structural proof – cycles, / problems, and every problem’s edges against its cycle)
- steps (SteppedExecutableGraph: the steps, every interior the
same proof; a level below it checks each node)
Subpackages¶
Submodules¶
- cottax.core.maths.cut_rules module
- cottax.core.maths.definition module
- cottax.core.maths.dispatch module
- cottax.core.maths.executable module
body_of()check_no_requirements()check_body_is_dag()check_one_problem_per_level()check_all_conditions_on_cycle()check_other_reads_off_cycle()check_other_owns_off_cycle()ExecutableGraphRequirementUnansweredSeveralOutermostNoProblemStillCyclicOutsideCycleConstantReadInsideCycleOwnReadInsideCycle
- cottax.core.maths.graph module
- cottax.core.maths.kinds module
- cottax.core.maths.mints module
- cottax.core.maths.nesting module
- cottax.core.maths.places module
- cottax.core.maths.steps module
- cottax.core.maths.valued module