h&u[      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ Safe-Inferred!)*/014 linear-smcEquality-witnessing order type  !$#"%('&)*+,-./0123456789:;<=>?@-,+*)%('&.!$#"/012 3456789:;< =>?@   7(8.820 Safe-Inferred!()*/01245RSTUVWXYZ[\]^_`abcd Safe-Inferred!()*/012!0efghijklmnopqrstuvwxyz{|}~ Safe-Inferred !()*/0148 linear-smcintermediate result linear-smcexpose does two things: 1. push abstract morphisms (E, X) into the already processed part 2. turn f K g into a Merge linear-smcMerge L/R pair linear-smcPerform 1 reduction step, assumes input is already maximally exposed and sorted.  linear-smc:Perform all reduction steps and return intermediate states GHIJKLMNOPQ GKLMHJNIOPQ H       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklm_nopqrY\s^tuvwxyz{|{}`a~bcdefghi'linear-smc-1.0.1-ANMXY1kAaU13bI8M7KNjxtControl.Category.ConstrainedControl.Category.LinearControl.Category.FreeCartesianControl.Category.FreeSMCOrderLTGTEQ HasCompare compareMorphs ComparatorHopf InvertibledualClosedapplycurry CoCartesianinlinrnewjam▿ Cartesianexlexrdisdup▵Monoidal×swapassocassoc'unitorunitor'⊗ProdObjprodobjobjprodobjunitCategoryObjid∘TrivialAllO4O3O2.objProdprodObjunitObj// disDefault exlDefault exrDefault▵!cartesianCrosscartesianUnitorcartesianUnitor' cartesianSwapcartesianAssoccartesianAssoc' jamDefault newDefault▿!transp $fTrivialka $fCategoryFUN$fProdObjTrivial $fMonoidalFUN$fCartesianFUN $fClosedFUNP:::!:encodeunitsplitmergedecodeignorecopydiscard FreeCartesian:▵:EmbedP2P1IE:.:Cat:<::>:showDbgparens mapGenerators assocRight rightView assocLeftleftView evalCartesian SimplifierProtoSimplifierPartialComposerComposer:×:U'UA'ASUnitorIRILURULHasShowtoShowShofromShoXshoConcompareUnitorstrivializeUnitorcommuteUnitorsevalM evalUnitor evalUnitor'monoidalSimplify monoidalRules neverEqual mkSimplifiertoDuptoERexpose reduceStep reductionStepreductionSteps:+