diff --git a/Complexitylib/Asymptotics/PolynomialComposition.lean b/Complexitylib/Asymptotics/PolynomialComposition.lean index 061b3d05..194107f3 100644 --- a/Complexitylib/Asymptotics/PolynomialComposition.lean +++ b/Complexitylib/Asymptotics/PolynomialComposition.lean @@ -21,7 +21,7 @@ deterministic function computations are connected sequentially. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/BooleanAnalysis/FourierExpansion.lean b/Complexitylib/BooleanAnalysis/FourierExpansion.lean index 08fe20f8..f5b265c1 100644 --- a/Complexitylib/BooleanAnalysis/FourierExpansion.lean +++ b/Complexitylib/BooleanAnalysis/FourierExpansion.lean @@ -20,7 +20,7 @@ Functions" by Ryan O'Donnell. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/BooleanAnalysis/FourierExpansion/Internal.lean b/Complexitylib/BooleanAnalysis/FourierExpansion/Internal.lean index 185a3db1..88e00a6f 100644 --- a/Complexitylib/BooleanAnalysis/FourierExpansion/Internal.lean +++ b/Complexitylib/BooleanAnalysis/FourierExpansion/Internal.lean @@ -18,7 +18,7 @@ direct use by downstream code. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/Iteration.lean b/Complexitylib/Circuits/AC0/Iteration.lean index 447f664e..aebf08ab 100644 --- a/Complexitylib/Circuits/AC0/Iteration.lean +++ b/Complexitylib/Circuits/AC0/Iteration.lean @@ -21,7 +21,7 @@ of restrictions. No uniformity or circuit-generator assumption is present. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/Iteration/Internal.lean b/Complexitylib/Circuits/AC0/Iteration/Internal.lean index d3961a83..4794a978 100644 --- a/Complexitylib/Circuits/AC0/Iteration/Internal.lean +++ b/Complexitylib/Circuits/AC0/Iteration/Internal.lean @@ -17,7 +17,7 @@ public import Complexitylib.Circuits.AC0.NormalForm.Internal -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/NormalForm.lean b/Complexitylib/Circuits/AC0/NormalForm.lean index 01f0aba2..ab65056e 100644 --- a/Complexitylib/Circuits/AC0/NormalForm.lean +++ b/Complexitylib/Circuits/AC0/NormalForm.lean @@ -17,7 +17,7 @@ restriction arguments. -/ -@[expose] public section +public section namespace Complexity namespace AC0Formula diff --git a/Complexitylib/Circuits/AC0/NormalForm/Internal.lean b/Complexitylib/Circuits/AC0/NormalForm/Internal.lean index 022a9abd..f3ec79a3 100644 --- a/Complexitylib/Circuits/AC0/NormalForm/Internal.lean +++ b/Complexitylib/Circuits/AC0/NormalForm/Internal.lean @@ -12,7 +12,7 @@ public import Complexitylib.Circuits.AC0.NormalForm.Defs -/ -@[expose] public section +public section namespace Complexity namespace AC0Formula diff --git a/Complexitylib/Circuits/AC0/Normalization.lean b/Complexitylib/Circuits/AC0/Normalization.lean index 76e0c8ce..738d950b 100644 --- a/Complexitylib/Circuits/AC0/Normalization.lean +++ b/Complexitylib/Circuits/AC0/Normalization.lean @@ -23,7 +23,7 @@ No uniformity assumption is used. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/Normalization/Internal.lean b/Complexitylib/Circuits/AC0/Normalization/Internal.lean index 9e46c207..2731d131 100644 --- a/Complexitylib/Circuits/AC0/Normalization/Internal.lean +++ b/Complexitylib/Circuits/AC0/Normalization/Internal.lean @@ -30,7 +30,7 @@ public import Mathlib.Tactic.ReduceModChar -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/Parity.lean b/Complexitylib/Circuits/AC0/Parity.lean index b7ace146..5c1bee8a 100644 --- a/Complexitylib/Circuits/AC0/Parity.lean +++ b/Complexitylib/Circuits/AC0/Parity.lean @@ -25,7 +25,7 @@ bound and a fixed depth. -/ -@[expose] public section +public section namespace Complexity namespace AC0Formula diff --git a/Complexitylib/Circuits/AC0/Parity/Internal.lean b/Complexitylib/Circuits/AC0/Parity/Internal.lean index 11383521..dc48fd3a 100644 --- a/Complexitylib/Circuits/AC0/Parity/Internal.lean +++ b/Complexitylib/Circuits/AC0/Parity/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Circuits.XOR.Restriction.Internal -/ -@[expose] public section +public section namespace Complexity namespace AC0Formula diff --git a/Complexitylib/Circuits/AC0/Restriction.lean b/Complexitylib/Circuits/AC0/Restriction.lean index 8b2d2de7..005b9670 100644 --- a/Complexitylib/Circuits/AC0/Restriction.lean +++ b/Complexitylib/Circuits/AC0/Restriction.lean @@ -18,7 +18,7 @@ filtered to the free variables. -/ -@[expose] public section +public section namespace Complexity namespace AC0Formula diff --git a/Complexitylib/Circuits/AC0/Switching.lean b/Complexitylib/Circuits/AC0/Switching.lean index d370723d..12a8235e 100644 --- a/Complexitylib/Circuits/AC0/Switching.lean +++ b/Complexitylib/Circuits/AC0/Switching.lean @@ -19,7 +19,7 @@ bounded literal positions, branch bits, and phase markers. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/Switching/Collection.lean b/Complexitylib/Circuits/AC0/Switching/Collection.lean index 7e32c990..2674b180 100644 --- a/Complexitylib/Circuits/AC0/Switching/Collection.lean +++ b/Complexitylib/Circuits/AC0/Switching/Collection.lean @@ -18,7 +18,7 @@ assumption is involved. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/Switching/Collection/Internal.lean b/Complexitylib/Circuits/AC0/Switching/Collection/Internal.lean index e388c3eb..a7e83c54 100644 --- a/Complexitylib/Circuits/AC0/Switching/Collection/Internal.lean +++ b/Complexitylib/Circuits/AC0/Switching/Collection/Internal.lean @@ -15,7 +15,7 @@ public import Mathlib.Algebra.Order.BigOperators.Group.Finset -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/Switching/Internal.lean b/Complexitylib/Circuits/AC0/Switching/Internal.lean index 68d69e7a..3476e052 100644 --- a/Complexitylib/Circuits/AC0/Switching/Internal.lean +++ b/Complexitylib/Circuits/AC0/Switching/Internal.lean @@ -16,7 +16,7 @@ public import Complexitylib.Circuits.DecisionTree.Path.Internal -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/Switching/Parity.lean b/Complexitylib/Circuits/AC0/Switching/Parity.lean index 66d11cbf..8afa379b 100644 --- a/Complexitylib/Circuits/AC0/Switching/Parity.lean +++ b/Complexitylib/Circuits/AC0/Switching/Parity.lean @@ -21,7 +21,7 @@ without changing semantics or increasing width. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AC0/Switching/Parity/Internal.lean b/Complexitylib/Circuits/AC0/Switching/Parity/Internal.lean index aded5128..622b73ba 100644 --- a/Complexitylib/Circuits/AC0/Switching/Parity/Internal.lean +++ b/Complexitylib/Circuits/AC0/Switching/Parity/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Circuits.XOR.Restriction.Internal -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/AndOrNot.lean b/Complexitylib/Circuits/AndOrNot.lean index 6d679627..8257aa7d 100644 --- a/Complexitylib/Circuits/AndOrNot.lean +++ b/Complexitylib/Circuits/AndOrNot.lean @@ -29,7 +29,7 @@ This module provides the AND/OR basis definitions and completeness results. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/BarringtonBridge.lean b/Complexitylib/Circuits/BarringtonBridge.lean index 10a3c327..0e2e2928 100644 --- a/Complexitylib/Circuits/BarringtonBridge.lean +++ b/Complexitylib/Circuits/BarringtonBridge.lean @@ -33,7 +33,7 @@ actually consumes — where the *target* representing cycle is an arbitrary -/ -@[expose] public section +public section open scoped commutatorElement open Equiv diff --git a/Complexitylib/Circuits/BarringtonCodeGenerator.lean b/Complexitylib/Circuits/BarringtonCodeGenerator.lean index 560099ac..5c1720c9 100644 --- a/Complexitylib/Circuits/BarringtonCodeGenerator.lean +++ b/Complexitylib/Circuits/BarringtonCodeGenerator.lean @@ -30,7 +30,7 @@ evaluation matches the source formula, and its instruction count is at most -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/BarringtonCodeGenerator/Internal.lean b/Complexitylib/Circuits/BarringtonCodeGenerator/Internal.lean index b4f0ecc4..31039db0 100644 --- a/Complexitylib/Circuits/BarringtonCodeGenerator/Internal.lean +++ b/Complexitylib/Circuits/BarringtonCodeGenerator/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Circuits.FormulaEncoding -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/BarringtonCompiler.lean b/Complexitylib/Circuits/BarringtonCompiler.lean index b6febc46..83eabae8 100644 --- a/Complexitylib/Circuits/BarringtonCompiler.lean +++ b/Complexitylib/Circuits/BarringtonCompiler.lean @@ -36,7 +36,7 @@ proof, not extraction of program data from an existential theorem. -/ -@[expose] public section +public section open scoped commutatorElement open Equiv diff --git a/Complexitylib/Circuits/BarringtonCompiler/Internal.lean b/Complexitylib/Circuits/BarringtonCompiler/Internal.lean index ace6ff1e..bd19c036 100644 --- a/Complexitylib/Circuits/BarringtonCompiler/Internal.lean +++ b/Complexitylib/Circuits/BarringtonCompiler/Internal.lean @@ -14,7 +14,7 @@ public import Std.Tactic.BVDecide.Normalize.BitVec -/ -@[expose] public section +public section open scoped commutatorElement open Equiv diff --git a/Complexitylib/Circuits/BarringtonConverse.lean b/Complexitylib/Circuits/BarringtonConverse.lean index 7e0e7bc5..e62a322f 100644 --- a/Complexitylib/Circuits/BarringtonConverse.lean +++ b/Complexitylib/Circuits/BarringtonConverse.lean @@ -29,7 +29,7 @@ equivalence under the library's total-assignment family convention. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/BarringtonConverse/Internal.lean b/Complexitylib/Circuits/BarringtonConverse/Internal.lean index 2f7d7c8b..770b8ef8 100644 --- a/Complexitylib/Circuits/BarringtonConverse/Internal.lean +++ b/Complexitylib/Circuits/BarringtonConverse/Internal.lean @@ -15,7 +15,7 @@ evaluation, then lifts that construction to polynomial-length families. -/ -@[expose] public section +public section open Equiv diff --git a/Complexitylib/Circuits/BarringtonLength.lean b/Complexitylib/Circuits/BarringtonLength.lean index 110f1550..ed14f941 100644 --- a/Complexitylib/Circuits/BarringtonLength.lean +++ b/Complexitylib/Circuits/BarringtonLength.lean @@ -39,7 +39,7 @@ the classical `4 ^ depth` bound. -/ -@[expose] public section +public section open scoped commutatorElement open Equiv diff --git a/Complexitylib/Circuits/BarringtonRepr.lean b/Complexitylib/Circuits/BarringtonRepr.lean index 73b14356..9ed97cb5 100644 --- a/Complexitylib/Circuits/BarringtonRepr.lean +++ b/Complexitylib/Circuits/BarringtonRepr.lean @@ -43,7 +43,7 @@ converse live in `BarringtonFamily.lean` and `BarringtonConverse.lean`. -/ -@[expose] public section +public section open scoped commutatorElement open Equiv diff --git a/Complexitylib/Circuits/BarringtonS5.lean b/Complexitylib/Circuits/BarringtonS5.lean index 825690ba..d67e8341 100644 --- a/Complexitylib/Circuits/BarringtonS5.lean +++ b/Complexitylib/Circuits/BarringtonS5.lean @@ -44,7 +44,7 @@ output cycle. -/ -@[expose] public section +public section open scoped commutatorElement open Equiv diff --git a/Complexitylib/Circuits/BarringtonTyped.lean b/Complexitylib/Circuits/BarringtonTyped.lean index 6582948d..51d3c96d 100644 --- a/Complexitylib/Circuits/BarringtonTyped.lean +++ b/Complexitylib/Circuits/BarringtonTyped.lean @@ -25,7 +25,7 @@ model stores the unique zero-input answer separately. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/BarringtonTyped/Internal.lean b/Complexitylib/Circuits/BarringtonTyped/Internal.lean index 9694c0b6..7b95aa6b 100644 --- a/Complexitylib/Circuits/BarringtonTyped/Internal.lean +++ b/Complexitylib/Circuits/BarringtonTyped/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Circuits.BarringtonTyped.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/BasisHom.lean b/Complexitylib/Circuits/BasisHom.lean index d06e92e1..ac88e9da 100644 --- a/Complexitylib/Circuits/BasisHom.lean +++ b/Complexitylib/Circuits/BasisHom.lean @@ -17,7 +17,7 @@ gate count, wiring, and depth exactly. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/BasisHom/Internal.lean b/Complexitylib/Circuits/BasisHom/Internal.lean index 6d67382a..685ee665 100644 --- a/Complexitylib/Circuits/BasisHom/Internal.lean +++ b/Complexitylib/Circuits/BasisHom/Internal.lean @@ -12,7 +12,7 @@ public import Complexitylib.Circuits.BasisHom.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/BranchingProgramEncoding.lean b/Complexitylib/Circuits/BranchingProgramEncoding.lean index 172dda8a..cee71152 100644 --- a/Complexitylib/Circuits/BranchingProgramEncoding.lean +++ b/Complexitylib/Circuits/BranchingProgramEncoding.lean @@ -31,7 +31,7 @@ finite permutation proofs on the machine tape. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/BranchingProgramEncoding/Internal.lean b/Complexitylib/Circuits/BranchingProgramEncoding/Internal.lean index b06b2348..16c17373 100644 --- a/Complexitylib/Circuits/BranchingProgramEncoding/Internal.lean +++ b/Complexitylib/Circuits/BranchingProgramEncoding/Internal.lean @@ -34,7 +34,7 @@ Public statements are re-exported by -/ -@[expose] public section +public section set_option maxRecDepth 100000 diff --git a/Complexitylib/Circuits/CircuitFormula.lean b/Complexitylib/Circuits/CircuitFormula.lean index c8cc8b91..cb843863 100644 --- a/Complexitylib/Circuits/CircuitFormula.lean +++ b/Complexitylib/Circuits/CircuitFormula.lean @@ -33,7 +33,7 @@ size claim. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/CircuitFormula/Defs.lean b/Complexitylib/Circuits/CircuitFormula/Defs.lean index dca60322..738e5e40 100644 --- a/Complexitylib/Circuits/CircuitFormula/Defs.lean +++ b/Complexitylib/Circuits/CircuitFormula/Defs.lean @@ -17,7 +17,7 @@ formula tree; no formula-size claim is implicit in this bridge. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/CircuitFormula/Family.lean b/Complexitylib/Circuits/CircuitFormula/Family.lean index 602c1c91..fbb0013f 100644 --- a/Complexitylib/Circuits/CircuitFormula/Family.lean +++ b/Complexitylib/Circuits/CircuitFormula/Family.lean @@ -27,7 +27,7 @@ translation controls directly. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/CircuitFormula/Family/Internal.lean b/Complexitylib/Circuits/CircuitFormula/Family/Internal.lean index d523da27..9c661973 100644 --- a/Complexitylib/Circuits/CircuitFormula/Family/Internal.lean +++ b/Complexitylib/Circuits/CircuitFormula/Family/Internal.lean @@ -15,7 +15,7 @@ public import Complexitylib.Circuits.BarringtonConverse.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/CircuitFormula/Internal.lean b/Complexitylib/Circuits/CircuitFormula/Internal.lean index 9515413a..2fd60ed0 100644 --- a/Complexitylib/Circuits/CircuitFormula/Internal.lean +++ b/Complexitylib/Circuits/CircuitFormula/Internal.lean @@ -13,7 +13,7 @@ import all Complexitylib.Circuits.CircuitFormula.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Composition.lean b/Complexitylib/Circuits/Composition.lean index 6d276068..2ea69be3 100644 --- a/Complexitylib/Circuits/Composition.lean +++ b/Complexitylib/Circuits/Composition.lean @@ -23,7 +23,7 @@ size, rather than duplicating the inner circuit once per outer use. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Composition/Internal.lean b/Complexitylib/Circuits/Composition/Internal.lean index 86444375..8e270527 100644 --- a/Complexitylib/Circuits/Composition/Internal.lean +++ b/Complexitylib/Circuits/Composition/Internal.lean @@ -12,7 +12,7 @@ public import Complexitylib.Circuits.Composition.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/DecisionTree/Block.lean b/Complexitylib/Circuits/DecisionTree/Block.lean index 94369a16..3f2ab730 100644 --- a/Complexitylib/Circuits/DecisionTree/Block.lean +++ b/Complexitylib/Circuits/DecisionTree/Block.lean @@ -17,7 +17,7 @@ restriction. -/ -@[expose] public section +public section namespace Complexity namespace DecisionTree.On diff --git a/Complexitylib/Circuits/DecisionTree/Block/Internal.lean b/Complexitylib/Circuits/DecisionTree/Block/Internal.lean index 1ff11df5..bdebba62 100644 --- a/Complexitylib/Circuits/DecisionTree/Block/Internal.lean +++ b/Complexitylib/Circuits/DecisionTree/Block/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Circuits.DecisionTree.Path.Defs -/ -@[expose] public section +public section namespace Complexity namespace DecisionTree.On diff --git a/Complexitylib/Circuits/DecisionTree/Finite.lean b/Complexitylib/Circuits/DecisionTree/Finite.lean index e2132d4b..eef16414 100644 --- a/Complexitylib/Circuits/DecisionTree/Finite.lean +++ b/Complexitylib/Circuits/DecisionTree/Finite.lean @@ -17,7 +17,7 @@ arguments; no query can silently fall outside the sampled variable set. -/ -@[expose] public section +public section namespace Complexity namespace DecisionTree.On diff --git a/Complexitylib/Circuits/DecisionTree/Finite/Internal.lean b/Complexitylib/Circuits/DecisionTree/Finite/Internal.lean index 980845d5..7853c489 100644 --- a/Complexitylib/Circuits/DecisionTree/Finite/Internal.lean +++ b/Complexitylib/Circuits/DecisionTree/Finite/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Circuits.BitString -/ -@[expose] public section +public section namespace Complexity namespace DecisionTree.On diff --git a/Complexitylib/Circuits/DecisionTree/NormalForm.lean b/Complexitylib/Circuits/DecisionTree/NormalForm.lean index f05cf822..c164601d 100644 --- a/Complexitylib/Circuits/DecisionTree/NormalForm.lean +++ b/Complexitylib/Circuits/DecisionTree/NormalForm.lean @@ -18,7 +18,7 @@ therefore have at most `2 ^ d` terms or clauses. -/ -@[expose] public section +public section namespace Complexity namespace DecisionTree.On diff --git a/Complexitylib/Circuits/DecisionTree/NormalForm/Internal.lean b/Complexitylib/Circuits/DecisionTree/NormalForm/Internal.lean index 00428152..2cd93674 100644 --- a/Complexitylib/Circuits/DecisionTree/NormalForm/Internal.lean +++ b/Complexitylib/Circuits/DecisionTree/NormalForm/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Circuits.NormalForm.Operations.Internal -/ -@[expose] public section +public section namespace Complexity namespace DecisionTree.On diff --git a/Complexitylib/Circuits/DecisionTree/Path.lean b/Complexitylib/Circuits/DecisionTree/Path.lean index 738aa457..d29cfcad 100644 --- a/Complexitylib/Circuits/DecisionTree/Path.lean +++ b/Complexitylib/Circuits/DecisionTree/Path.lean @@ -17,7 +17,7 @@ that path is an embedding into the input coordinates. -/ -@[expose] public section +public section namespace Complexity namespace DecisionTree.On diff --git a/Complexitylib/Circuits/DecisionTree/Restriction.lean b/Complexitylib/Circuits/DecisionTree/Restriction.lean index 7be25cf5..fa02feaf 100644 --- a/Complexitylib/Circuits/DecisionTree/Restriction.lean +++ b/Complexitylib/Circuits/DecisionTree/Restriction.lean @@ -26,7 +26,7 @@ simplification used when switching-lemma arguments measure decision-tree depth. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Dependency.lean b/Complexitylib/Circuits/Dependency.lean index f2b31b28..8202a483 100644 --- a/Complexitylib/Circuits/Dependency.lean +++ b/Complexitylib/Circuits/Dependency.lean @@ -25,7 +25,7 @@ referenced wire to the gate that reads it. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Dependency/Internal.lean b/Complexitylib/Circuits/Dependency/Internal.lean index 40a78131..9ca9b43d 100644 --- a/Complexitylib/Circuits/Dependency/Internal.lean +++ b/Complexitylib/Circuits/Dependency/Internal.lean @@ -14,7 +14,7 @@ public import Mathlib.Data.Fintype.BigOperators -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/DepthClasses.lean b/Complexitylib/Circuits/DepthClasses.lean index 996abb7d..d4c206c1 100644 --- a/Complexitylib/Circuits/DepthClasses.lean +++ b/Complexitylib/Circuits/DepthClasses.lean @@ -27,7 +27,7 @@ additional predicate and is not implicit in the names `NC`, `AC`, or `TC`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/DepthClasses/Internal.lean b/Complexitylib/Circuits/DepthClasses/Internal.lean index 38e0f883..703b9387 100644 --- a/Complexitylib/Circuits/DepthClasses/Internal.lean +++ b/Complexitylib/Circuits/DepthClasses/Internal.lean @@ -15,7 +15,7 @@ public import Complexitylib.Circuits.Threshold -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding.lean b/Complexitylib/Circuits/Encoding.lean index a015e752..c15e877f 100644 --- a/Complexitylib/Circuits/Encoding.lean +++ b/Complexitylib/Circuits/Encoding.lean @@ -55,7 +55,7 @@ This module exposes the machine-facing representation of -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Formula.lean b/Complexitylib/Circuits/Encoding/Formula.lean index b4b4d286..103405e0 100644 --- a/Complexitylib/Circuits/Encoding/Formula.lean +++ b/Complexitylib/Circuits/Encoding/Formula.lean @@ -29,7 +29,7 @@ circuits; circuit families handle their zero-input member separately. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Formula/Batch.lean b/Complexitylib/Circuits/Encoding/Formula/Batch.lean index f73c75a8..7dbe119d 100644 --- a/Complexitylib/Circuits/Encoding/Formula/Batch.lean +++ b/Complexitylib/Circuits/Encoding/Formula/Batch.lean @@ -26,7 +26,7 @@ all results in one contiguous block starting at `rawBatchOutputBase`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Formula/Batch/Internal.lean b/Complexitylib/Circuits/Encoding/Formula/Batch/Internal.lean index 5a76e193..3affdc7d 100644 --- a/Complexitylib/Circuits/Encoding/Formula/Batch/Internal.lean +++ b/Complexitylib/Circuits/Encoding/Formula/Batch/Internal.lean @@ -18,7 +18,7 @@ for `BoolFormula.compileRawBatch`. Public statements are re-exported by -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Formula/Internal.lean b/Complexitylib/Circuits/Encoding/Formula/Internal.lean index ddf2569f..547cb847 100644 --- a/Complexitylib/Circuits/Encoding/Formula/Internal.lean +++ b/Complexitylib/Circuits/Encoding/Formula/Internal.lean @@ -17,7 +17,7 @@ formula compiler. Public statements are re-exported by -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Formula/Stream.lean b/Complexitylib/Circuits/Encoding/Formula/Stream.lean index 6bf9eecf..1dea7340 100644 --- a/Complexitylib/Circuits/Encoding/Formula/Stream.lean +++ b/Complexitylib/Circuits/Encoding/Formula/Stream.lean @@ -29,7 +29,7 @@ recomputation; no executable cursor is claimed here. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Formula/Stream/Internal.lean b/Complexitylib/Circuits/Encoding/Formula/Stream/Internal.lean index 9f8c5d4f..34b17529 100644 --- a/Complexitylib/Circuits/Encoding/Formula/Stream/Internal.lean +++ b/Complexitylib/Circuits/Encoding/Formula/Stream/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Circuits.Encoding.Formula.Stream.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Fragment.lean b/Complexitylib/Circuits/Encoding/Fragment.lean index 784ecac7..ab6823cb 100644 --- a/Complexitylib/Circuits/Encoding/Fragment.lean +++ b/Complexitylib/Circuits/Encoding/Fragment.lean @@ -17,7 +17,7 @@ evaluation preserves every previously available wire. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Internal/Codec.lean b/Complexitylib/Circuits/Encoding/Internal/Codec.lean index a724e0c4..074fcbc7 100644 --- a/Complexitylib/Circuits/Encoding/Internal/Codec.lean +++ b/Complexitylib/Circuits/Encoding/Internal/Codec.lean @@ -18,7 +18,7 @@ kept in a separate proof layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Internal/Fragment.lean b/Complexitylib/Circuits/Encoding/Internal/Fragment.lean index 4a8c3da8..e0175aed 100644 --- a/Complexitylib/Circuits/Encoding/Internal/Fragment.lean +++ b/Complexitylib/Circuits/Encoding/Internal/Fragment.lean @@ -17,7 +17,7 @@ iterative raw-circuit evaluator. The statements are exposed by -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Internal/Semantics.lean b/Complexitylib/Circuits/Encoding/Internal/Semantics.lean index 3397e634..b4b7b7dc 100644 --- a/Complexitylib/Circuits/Encoding/Internal/Semantics.lean +++ b/Complexitylib/Circuits/Encoding/Internal/Semantics.lean @@ -20,7 +20,7 @@ descriptor wires `0, ..., N + k - 1`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Internal/ToCircuit.lean b/Complexitylib/Circuits/Encoding/Internal/ToCircuit.lean index 1dbeeafe..a5217409 100644 --- a/Complexitylib/Circuits/Encoding/Internal/ToCircuit.lean +++ b/Complexitylib/Circuits/Encoding/Internal/ToCircuit.lean @@ -17,7 +17,7 @@ from the existing typed-to-raw evaluator theorem rather than reproved. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine.lean b/Complexitylib/Circuits/Encoding/Machine.lean index 2e86f405..06c9bf6e 100644 --- a/Complexitylib/Circuits/Encoding/Machine.lean +++ b/Complexitylib/Circuits/Encoding/Machine.lean @@ -40,7 +40,7 @@ its final verdict. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core.lean b/Complexitylib/Circuits/Encoding/Machine/Core.lean index ed49f88a..26b1d6cc 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core.lean @@ -29,7 +29,7 @@ concrete quadratic bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Action.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Action.lean index a20eaed5..ec5dec1c 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Action.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Action.lean @@ -16,7 +16,7 @@ one-step proofs independent of the implementation's nested index tests. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Evaluator.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Evaluator.lean index 40f26d1d..de207902 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Evaluator.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Evaluator.lean @@ -19,7 +19,7 @@ quadratic running-time bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/EmptyReject.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/EmptyReject.lean index 2f8da2f9..1df2500d 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/EmptyReject.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/EmptyReject.lean @@ -18,7 +18,7 @@ in three. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Family.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Family.lean index a6382aa8..03141241 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Family.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Family.lean @@ -5,9 +5,9 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Circuits.Encoding.Machine.Core.Internal.Execution.EmptyReject +import Complexitylib.Circuits.Encoding.Machine.Core.Internal.Execution.EmptyReject public import Complexitylib.Circuits.Encoding.Machine.Core.Internal.Execution.PositiveLoopReject -public import Complexitylib.Circuits.Encoding.Machine.Core.Internal.Execution.PositiveReject +import Complexitylib.Circuits.Encoding.Machine.Core.Internal.Execution.PositiveReject /-! # Total tagged-family core execution @@ -18,7 +18,7 @@ successful Boolean results are preserved and every malformed stream writes zero. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate.lean index 6949182c..9951f8bc 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate.lean @@ -22,7 +22,7 @@ within this controller. They are the reusable proof-engineering seam between -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/Attempt.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/Attempt.lean index f1383e16..61fe26d7 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/Attempt.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/Attempt.lean @@ -18,7 +18,7 @@ uniform linear bound in the current wire-memo length. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/LoopReject.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/LoopReject.lean index 6bd47b68..bfd862cd 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/LoopReject.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/LoopReject.lean @@ -6,7 +6,7 @@ Authors: Samuel Schlesinger module public import Complexitylib.Circuits.Encoding.Machine.Core.Internal.Execution.Gate.Loop -public import Complexitylib.Circuits.Encoding.Machine.Core.Internal.Execution.Gate.Reject +import Complexitylib.Circuits.Encoding.Machine.Core.Internal.Execution.Gate.Reject /-! # Rejecting gate-stream execution @@ -18,7 +18,7 @@ recording the machine's zero verdict. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/Reject.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/Reject.lean index 693da4e5..796a2923 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/Reject.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/Gate/Reject.lean @@ -18,7 +18,7 @@ then halts with an explicit zero write. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/PositiveLoopReject.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/PositiveLoopReject.lean index c51e3872..f1a0ca00 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/PositiveLoopReject.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/PositiveLoopReject.lean @@ -16,7 +16,7 @@ retaining a well-formed counter remainder and an explicit zero verdict. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/PositiveReject.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/PositiveReject.lean index 6e77bf00..343168df 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/PositiveReject.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Execution/PositiveReject.lean @@ -17,7 +17,7 @@ frontier-level wrappers also cover a positive tag paired with the empty input. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Hoare.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Hoare.lean index ce3819d1..42350669 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Hoare.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Hoare.lean @@ -15,7 +15,7 @@ staged-tape precondition and defaulted-verdict postcondition. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Stage.lean b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Stage.lean index aa454ec7..901665c8 100644 --- a/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Stage.lean +++ b/Complexitylib/Circuits/Encoding/Machine/Core/Internal/Stage.lean @@ -16,7 +16,7 @@ core's precondition across the standard sequential-composition tape transition. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/GateStream.lean b/Complexitylib/Circuits/Encoding/Machine/GateStream.lean index 0e972bd9..3fea1f8c 100644 --- a/Complexitylib/Circuits/Encoding/Machine/GateStream.lean +++ b/Complexitylib/Circuits/Encoding/Machine/GateStream.lean @@ -24,7 +24,7 @@ restored to zero and every other tape is preserved literally. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/GateStream/Internal.lean b/Complexitylib/Circuits/Encoding/Machine/GateStream/Internal.lean index dcb72da9..11688164 100644 --- a/Complexitylib/Circuits/Encoding/Machine/GateStream/Internal.lean +++ b/Complexitylib/Circuits/Encoding/Machine/GateStream/Internal.lean @@ -18,7 +18,7 @@ update. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/NatCode.lean b/Complexitylib/Circuits/Encoding/Machine/NatCode.lean index 411d0230..95b58059 100644 --- a/Complexitylib/Circuits/Encoding/Machine/NatCode.lean +++ b/Complexitylib/Circuits/Encoding/Machine/NatCode.lean @@ -30,7 +30,7 @@ satisfies the one-way-output transducer discipline. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/NatCode/Internal.lean b/Complexitylib/Circuits/Encoding/Machine/NatCode/Internal.lean index 1998ae9a..1220add0 100644 --- a/Complexitylib/Circuits/Encoding/Machine/NatCode/Internal.lean +++ b/Complexitylib/Circuits/Encoding/Machine/NatCode/Internal.lean @@ -20,7 +20,7 @@ index, then composes scratch clearing and the terminating zero-bit emitter. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/RawGate.lean b/Complexitylib/Circuits/Encoding/Machine/RawGate.lean index cd337000..d6d1a9df 100644 --- a/Complexitylib/Circuits/Encoding/Machine/RawGate.lean +++ b/Complexitylib/Circuits/Encoding/Machine/RawGate.lean @@ -24,7 +24,7 @@ and the reusable zero scratch are restored literally. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Machine/RawGate/Internal.lean b/Complexitylib/Circuits/Encoding/Machine/RawGate/Internal.lean index ee8f4bdb..b0c2fa07 100644 --- a/Complexitylib/Circuits/Encoding/Machine/RawGate/Internal.lean +++ b/Complexitylib/Circuits/Encoding/Machine/RawGate/Internal.lean @@ -17,7 +17,7 @@ restored literally at the endpoint. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Threshold.lean b/Complexitylib/Circuits/Encoding/Threshold.lean index bef0cb1b..a6b91a64 100644 --- a/Complexitylib/Circuits/Encoding/Threshold.lean +++ b/Complexitylib/Circuits/Encoding/Threshold.lean @@ -31,7 +31,7 @@ higher layer where both APIs are already available. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Threshold/Internal.lean b/Complexitylib/Circuits/Encoding/Threshold/Internal.lean index d9185780..a09527c6 100644 --- a/Complexitylib/Circuits/Encoding/Threshold/Internal.lean +++ b/Complexitylib/Circuits/Encoding/Threshold/Internal.lean @@ -18,7 +18,7 @@ statements are re-exported by `Complexitylib.Circuits.Encoding.Threshold`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/ToCircuit.lean b/Complexitylib/Circuits/Encoding/ToCircuit.lean index 27d7e62c..5e30aaf8 100644 --- a/Complexitylib/Circuits/Encoding/ToCircuit.lean +++ b/Complexitylib/Circuits/Encoding/ToCircuit.lean @@ -30,7 +30,7 @@ Boolean evaluation, and exact gate count. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Encoding/Validation.lean b/Complexitylib/Circuits/Encoding/Validation.lean index b9cb6486..2395bded 100644 --- a/Complexitylib/Circuits/Encoding/Validation.lean +++ b/Complexitylib/Circuits/Encoding/Validation.lean @@ -23,7 +23,7 @@ This module is not part of the public import graph. Build it explicitly with -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Family.lean b/Complexitylib/Circuits/Family.lean index 4b418621..d4d8de9e 100644 --- a/Complexitylib/Circuits/Family.lean +++ b/Complexitylib/Circuits/Family.lean @@ -18,7 +18,7 @@ the power big-O convention used by complexity classes. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/FormulaEncoding.lean b/Complexitylib/Circuits/FormulaEncoding.lean index c12234ee..8e38e4dd 100644 --- a/Complexitylib/Circuits/FormulaEncoding.lean +++ b/Complexitylib/Circuits/FormulaEncoding.lean @@ -29,7 +29,7 @@ serialization is injective, and the code-length equation records every bit. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/FormulaEncoding/Internal.lean b/Complexitylib/Circuits/FormulaEncoding/Internal.lean index e97d8354..94e3f8f3 100644 --- a/Complexitylib/Circuits/FormulaEncoding/Internal.lean +++ b/Complexitylib/Circuits/FormulaEncoding/Internal.lean @@ -33,7 +33,7 @@ properties of the canonical postfix formula encoding. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Hardwiring.lean b/Complexitylib/Circuits/Hardwiring.lean index 05906154..531897b4 100644 --- a/Complexitylib/Circuits/Hardwiring.lean +++ b/Complexitylib/Circuits/Hardwiring.lean @@ -29,7 +29,7 @@ Circuit families represent the zero-input member separately with `emptyOutput`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Internal/AndOrNot.lean b/Complexitylib/Circuits/Internal/AndOrNot.lean index e9aa3ffe..5c343786 100644 --- a/Complexitylib/Circuits/Internal/AndOrNot.lean +++ b/Complexitylib/Circuits/Internal/AndOrNot.lean @@ -18,7 +18,7 @@ in `Complexitylib.Circuits.AndOrNot.Defs`; this module is re-exported through -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Internal/LowerBound.lean b/Complexitylib/Circuits/Internal/LowerBound.lean index 1bd3660e..bb15f2ae 100644 --- a/Complexitylib/Circuits/Internal/LowerBound.lean +++ b/Complexitylib/Circuits/Internal/LowerBound.lean @@ -26,7 +26,7 @@ are stated in -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Internal/Nondeterminism.lean b/Complexitylib/Circuits/Internal/Nondeterminism.lean index 0d61e608..6bd237af 100644 --- a/Complexitylib/Circuits/Internal/Nondeterminism.lean +++ b/Complexitylib/Circuits/Internal/Nondeterminism.lean @@ -56,7 +56,7 @@ plus one; no OR-specific construction is defined here. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Internal/NormalForm.lean b/Complexitylib/Circuits/Internal/NormalForm.lean index 0fc7b5de..04f5dc17 100644 --- a/Complexitylib/Circuits/Internal/NormalForm.lean +++ b/Complexitylib/Circuits/Internal/NormalForm.lean @@ -26,7 +26,7 @@ The public interface re-exports the main theorems from `Complexitylib.Circuits.N -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Internal/Schnorr.lean b/Complexitylib/Circuits/Internal/Schnorr.lean index 6f759d57..f35ff0b5 100644 --- a/Complexitylib/Circuits/Internal/Schnorr.lean +++ b/Complexitylib/Circuits/Internal/Schnorr.lean @@ -8,7 +8,7 @@ module public import Complexitylib.Circuits.XOR public import Complexitylib.Circuits.Internal.CircuitDescriptor -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Internal/SchnorrBridge.lean b/Complexitylib/Circuits/Internal/SchnorrBridge.lean index 3996a54c..5d3710cd 100644 --- a/Complexitylib/Circuits/Internal/SchnorrBridge.lean +++ b/Complexitylib/Circuits/Internal/SchnorrBridge.lean @@ -16,7 +16,7 @@ typed fan-in-two circuit model. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Internal/ShannonBridge.lean b/Complexitylib/Circuits/Internal/ShannonBridge.lean index ae27bd2f..e862d582 100644 --- a/Complexitylib/Circuits/Internal/ShannonBridge.lean +++ b/Complexitylib/Circuits/Internal/ShannonBridge.lean @@ -17,7 +17,7 @@ bound back to `Circuit`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Internal/ShannonUpper.lean b/Complexitylib/Circuits/Internal/ShannonUpper.lean index 5dd37c66..d3fa580c 100644 --- a/Complexitylib/Circuits/Internal/ShannonUpper.lean +++ b/Complexitylib/Circuits/Internal/ShannonUpper.lean @@ -49,7 +49,7 @@ gates for `N ≥ 16`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Internal/Spira.lean b/Complexitylib/Circuits/Internal/Spira.lean index 1e46f005..8649fd73 100644 --- a/Complexitylib/Circuits/Internal/Spira.lean +++ b/Complexitylib/Circuits/Internal/Spira.lean @@ -34,7 +34,7 @@ states only the existence of an equivalent shallow, polynomial-size formula. -/ -@[expose] public section +public section namespace Complexity namespace BoolFormula diff --git a/Complexitylib/Circuits/KarchmerWigderson.lean b/Complexitylib/Circuits/KarchmerWigderson.lean index 8d18d4fd..8b255075 100644 --- a/Complexitylib/Circuits/KarchmerWigderson.lean +++ b/Complexitylib/Circuits/KarchmerWigderson.lean @@ -26,7 +26,7 @@ No uniformity condition is present. -/ -@[expose] public section +public section namespace Complexity namespace KarchmerWigderson diff --git a/Complexitylib/Circuits/KarchmerWigderson/Internal.lean b/Complexitylib/Circuits/KarchmerWigderson/Internal.lean index b511b33d..cea067c6 100644 --- a/Complexitylib/Circuits/KarchmerWigderson/Internal.lean +++ b/Complexitylib/Circuits/KarchmerWigderson/Internal.lean @@ -12,7 +12,7 @@ public import Complexitylib.Circuits.KarchmerWigderson.Defs -/ -@[expose] public section +public section namespace Complexity namespace KarchmerWigderson diff --git a/Complexitylib/Circuits/LowerBound.lean b/Complexitylib/Circuits/LowerBound.lean index abbaa3d4..9bb9979b 100644 --- a/Complexitylib/Circuits/LowerBound.lean +++ b/Complexitylib/Circuits/LowerBound.lean @@ -47,7 +47,7 @@ And its corollary for functions that depend on all inputs: -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Monotone.lean b/Complexitylib/Circuits/Monotone.lean index dd95ef0d..825421c3 100644 --- a/Complexitylib/Circuits/Monotone.lean +++ b/Complexitylib/Circuits/Monotone.lean @@ -21,7 +21,7 @@ and essential variables are both bounded by the number of formula leaves. -/ -@[expose] public section +public section namespace Complexity namespace MonotoneFormula diff --git a/Complexitylib/Circuits/Monotone/Internal.lean b/Complexitylib/Circuits/Monotone/Internal.lean index 502def86..e7ddb648 100644 --- a/Complexitylib/Circuits/Monotone/Internal.lean +++ b/Complexitylib/Circuits/Monotone/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Circuits.BitString -/ -@[expose] public section +public section namespace Complexity namespace MonotoneFormula diff --git a/Complexitylib/Circuits/MultilinearExtension.lean b/Complexitylib/Circuits/MultilinearExtension.lean index 611e8d80..1b28187b 100644 --- a/Complexitylib/Circuits/MultilinearExtension.lean +++ b/Complexitylib/Circuits/MultilinearExtension.lean @@ -26,7 +26,7 @@ arithmetized formulas agree with their Boolean originals on the cube. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Nondeterminism.lean b/Complexitylib/Circuits/Nondeterminism.lean index f5cf3f68..cdc65675 100644 --- a/Complexitylib/Circuits/Nondeterminism.lean +++ b/Complexitylib/Circuits/Nondeterminism.lean @@ -50,7 +50,7 @@ the Shannon bound wins when `k` is large, regardless of `f`'s complexity. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/NormalForm.lean b/Complexitylib/Circuits/NormalForm.lean index 2729919d..1ffa3921 100644 --- a/Complexitylib/Circuits/NormalForm.lean +++ b/Complexitylib/Circuits/NormalForm.lean @@ -34,7 +34,7 @@ De Morgan duality (`CNF.neg`). -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/NormalForm/Operations.lean b/Complexitylib/Circuits/NormalForm/Operations.lean index f80a43ec..265d9c3f 100644 --- a/Complexitylib/Circuits/NormalForm/Operations.lean +++ b/Complexitylib/Circuits/NormalForm/Operations.lean @@ -18,7 +18,7 @@ distributive expansion. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/NormalForm/Operations/Internal.lean b/Complexitylib/Circuits/NormalForm/Operations/Internal.lean index 4026536d..416f7997 100644 --- a/Complexitylib/Circuits/NormalForm/Operations/Internal.lean +++ b/Complexitylib/Circuits/NormalForm/Operations/Internal.lean @@ -12,7 +12,7 @@ public import Complexitylib.Circuits.NormalForm.Operations.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/RandomRestriction.lean b/Complexitylib/Circuits/RandomRestriction.lean index 1ce31ba0..f2a83218 100644 --- a/Complexitylib/Circuits/RandomRestriction.lean +++ b/Complexitylib/Circuits/RandomRestriction.lean @@ -24,7 +24,7 @@ rounding or division conventions. -/ -@[expose] public section +public section namespace Complexity namespace RandomRestriction diff --git a/Complexitylib/Circuits/RandomRestriction/Internal.lean b/Complexitylib/Circuits/RandomRestriction/Internal.lean index 14bcdfa9..e3f4f3d4 100644 --- a/Complexitylib/Circuits/RandomRestriction/Internal.lean +++ b/Complexitylib/Circuits/RandomRestriction/Internal.lean @@ -13,7 +13,7 @@ public import Mathlib.Data.Fintype.BigOperators -/ -@[expose] public section +public section namespace Complexity namespace RandomRestriction diff --git a/Complexitylib/Circuits/Schnorr.lean b/Complexitylib/Circuits/Schnorr.lean index fed73221..377206f0 100644 --- a/Complexitylib/Circuits/Schnorr.lean +++ b/Complexitylib/Circuits/Schnorr.lean @@ -41,7 +41,7 @@ When `Basis.andOr2` is known to be complete, this yields a -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Shannon.lean b/Complexitylib/Circuits/Shannon.lean index 075bb074..2c66969a 100644 --- a/Complexitylib/Circuits/Shannon.lean +++ b/Complexitylib/Circuits/Shannon.lean @@ -40,7 +40,7 @@ Together these establish that worst-case circuit complexity is `Θ(2^N / N)`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Spira.lean b/Complexitylib/Circuits/Spira.lean index e0b86a53..6c65eab8 100644 --- a/Complexitylib/Circuits/Spira.lean +++ b/Complexitylib/Circuits/Spira.lean @@ -27,7 +27,7 @@ transformation. -/ -@[expose] public section +public section namespace Complexity namespace BoolFormula diff --git a/Complexitylib/Circuits/Threshold.lean b/Complexitylib/Circuits/Threshold.lean index 236d8116..11ff2292 100644 --- a/Complexitylib/Circuits/Threshold.lean +++ b/Complexitylib/Circuits/Threshold.lean @@ -21,7 +21,7 @@ depth, negation flags, or semantics. -/ -@[expose] public section +public section namespace Complexity namespace ThresholdOp diff --git a/Complexitylib/Circuits/Threshold/Internal.lean b/Complexitylib/Circuits/Threshold/Internal.lean index ebe6c6ab..86e8f3f8 100644 --- a/Complexitylib/Circuits/Threshold/Internal.lean +++ b/Complexitylib/Circuits/Threshold/Internal.lean @@ -16,7 +16,7 @@ public import Std.Tactic.BVDecide.Normalize.Prop -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling.lean b/Complexitylib/Circuits/Unrolling.lean index 250eb259..17ba3c5b 100644 --- a/Complexitylib/Circuits/Unrolling.lean +++ b/Complexitylib/Circuits/Unrolling.lean @@ -28,7 +28,7 @@ threshold with an explicit polynomial gate bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Acceptance/Hardwiring.lean b/Complexitylib/Circuits/Unrolling/Acceptance/Hardwiring.lean index 96e7fda5..a9b85c98 100644 --- a/Complexitylib/Circuits/Unrolling/Acceptance/Hardwiring.lean +++ b/Complexitylib/Circuits/Unrolling/Acceptance/Hardwiring.lean @@ -24,7 +24,7 @@ single-run analogue of amplified-seed hardwiring. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Acceptance/Internal/Evaluation.lean b/Complexitylib/Circuits/Unrolling/Acceptance/Internal/Evaluation.lean index 264e26ae..1b4b1a3f 100644 --- a/Complexitylib/Circuits/Unrolling/Acceptance/Internal/Evaluation.lean +++ b/Complexitylib/Circuits/Unrolling/Acceptance/Internal/Evaluation.lean @@ -18,7 +18,7 @@ Boolean acceptance predicate used by `NTM.acceptCount`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Acceptance/Internal/Structure.lean b/Complexitylib/Circuits/Unrolling/Acceptance/Internal/Structure.lean index 06997fe8..6c3a5e37 100644 --- a/Complexitylib/Circuits/Unrolling/Acceptance/Internal/Structure.lean +++ b/Complexitylib/Circuits/Unrolling/Acceptance/Internal/Structure.lean @@ -17,7 +17,7 @@ machine-dependent size bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Amplification.lean b/Complexitylib/Circuits/Unrolling/Amplification.lean index 60081f85..031b30f9 100644 --- a/Complexitylib/Circuits/Unrolling/Amplification.lean +++ b/Complexitylib/Circuits/Unrolling/Amplification.lean @@ -35,7 +35,7 @@ the randomized layer's `blockMajority` is supplied by -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Amplification/Internal/Evaluation.lean b/Complexitylib/Circuits/Unrolling/Amplification/Internal/Evaluation.lean index 301f1375..722d30d9 100644 --- a/Complexitylib/Circuits/Unrolling/Amplification/Internal/Evaluation.lean +++ b/Complexitylib/Circuits/Unrolling/Amplification/Internal/Evaluation.lean @@ -23,7 +23,7 @@ circuit layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Amplification/Internal/Structure.lean b/Complexitylib/Circuits/Unrolling/Amplification/Internal/Structure.lean index 41268666..cd0e1780 100644 --- a/Complexitylib/Circuits/Unrolling/Amplification/Internal/Structure.lean +++ b/Complexitylib/Circuits/Unrolling/Amplification/Internal/Structure.lean @@ -20,7 +20,7 @@ circuit by one cubic unrolling per run plus a quadratic majority threshold. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Amplification/Internal/Topology.lean b/Complexitylib/Circuits/Unrolling/Amplification/Internal/Topology.lean index 75d8bc51..ba69758d 100644 --- a/Complexitylib/Circuits/Unrolling/Amplification/Internal/Topology.lean +++ b/Complexitylib/Circuits/Unrolling/Amplification/Internal/Topology.lean @@ -17,7 +17,7 @@ ordered and that the final nonempty raw circuit is well formed. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Internal/Initialization.lean b/Complexitylib/Circuits/Unrolling/Internal/Initialization.lean index 5eb5bc0c..2da98310 100644 --- a/Complexitylib/Circuits/Unrolling/Internal/Initialization.lean +++ b/Complexitylib/Circuits/Unrolling/Internal/Initialization.lean @@ -18,7 +18,7 @@ semantics of the one-gate-per-atom initialization fragment. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Trace.lean b/Complexitylib/Circuits/Unrolling/Trace.lean index 5c698ced..5f8fc185 100644 --- a/Complexitylib/Circuits/Unrolling/Trace.lean +++ b/Complexitylib/Circuits/Unrolling/Trace.lean @@ -30,7 +30,7 @@ arity and has machine-dependent cubic size in the trace horizon. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Trace/Internal/Evaluation.lean b/Complexitylib/Circuits/Unrolling/Trace/Internal/Evaluation.lean index 3dc48089..a98d2e54 100644 --- a/Complexitylib/Circuits/Unrolling/Trace/Internal/Evaluation.lean +++ b/Complexitylib/Circuits/Unrolling/Trace/Internal/Evaluation.lean @@ -20,7 +20,7 @@ prefix. The complete-trace theorem is the horizon specialization. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Trace/Internal/HeadBounds.lean b/Complexitylib/Circuits/Unrolling/Trace/Internal/HeadBounds.lean index 1bf05df0..91a6b605 100644 --- a/Complexitylib/Circuits/Unrolling/Trace/Internal/HeadBounds.lean +++ b/Complexitylib/Circuits/Unrolling/Trace/Internal/HeadBounds.lean @@ -19,7 +19,7 @@ below `T`. It also identifies one `choiceStep` from prefix `i` with prefix -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Trace/Internal/Structure.lean b/Complexitylib/Circuits/Unrolling/Trace/Internal/Structure.lean index 02ae6589..cccd210b 100644 --- a/Complexitylib/Circuits/Unrolling/Trace/Internal/Structure.lean +++ b/Complexitylib/Circuits/Unrolling/Trace/Internal/Structure.lean @@ -17,7 +17,7 @@ configuration block and derives a machine-dependent cubic size bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Trace/Internal/Topology.lean b/Complexitylib/Circuits/Unrolling/Trace/Internal/Topology.lean index cda92b32..b3462168 100644 --- a/Complexitylib/Circuits/Unrolling/Trace/Internal/Topology.lean +++ b/Complexitylib/Circuits/Unrolling/Trace/Internal/Topology.lean @@ -18,7 +18,7 @@ configuration block supplied by the trace-structure layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Transition.lean b/Complexitylib/Circuits/Unrolling/Transition.lean index 5ff232bb..7de62233 100644 --- a/Complexitylib/Circuits/Unrolling/Transition.lean +++ b/Complexitylib/Circuits/Unrolling/Transition.lean @@ -26,7 +26,7 @@ successor machine step. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Transition/Fragment.lean b/Complexitylib/Circuits/Unrolling/Transition/Fragment.lean index 7a421c6d..5cf18fc0 100644 --- a/Complexitylib/Circuits/Unrolling/Transition/Fragment.lean +++ b/Complexitylib/Circuits/Unrolling/Transition/Fragment.lean @@ -29,7 +29,7 @@ machine-dependent quadratic size in the trace horizon. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/ArrayEvaluation.lean b/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/ArrayEvaluation.lean index ed289e34..37b9395a 100644 --- a/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/ArrayEvaluation.lean +++ b/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/ArrayEvaluation.lean @@ -17,7 +17,7 @@ choice wire, without separately constructing a total Boolean assignment. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Evaluation.lean b/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Evaluation.lean index afe34a54..225c1032 100644 --- a/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Evaluation.lean +++ b/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Evaluation.lean @@ -19,7 +19,7 @@ configuration block for the halted-or-successor machine configuration. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Structure.lean b/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Structure.lean index b5ecaa22..c0f11817 100644 --- a/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Structure.lean +++ b/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Structure.lean @@ -18,7 +18,7 @@ formula lookup order, and arithmetic addresses of packed successor atoms. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Topology.lean b/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Topology.lean index 4ccffdc2..add379c2 100644 --- a/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Topology.lean +++ b/Complexitylib/Circuits/Unrolling/Transition/Fragment/Internal/Topology.lean @@ -18,7 +18,7 @@ block lie in the existing circuit prefix. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Transition/Internal/Semantics.lean b/Complexitylib/Circuits/Unrolling/Transition/Internal/Semantics.lean index e4a40800..42087eb5 100644 --- a/Complexitylib/Circuits/Unrolling/Transition/Internal/Semantics.lean +++ b/Complexitylib/Circuits/Unrolling/Transition/Internal/Semantics.lean @@ -18,7 +18,7 @@ the head-movement and tape-write formulas atom by atom. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Unrolling/Transition/Internal/Support.lean b/Complexitylib/Circuits/Unrolling/Transition/Internal/Support.lean index 942c9506..e69b7901 100644 --- a/Complexitylib/Circuits/Unrolling/Transition/Internal/Support.lean +++ b/Complexitylib/Circuits/Unrolling/Transition/Internal/Support.lean @@ -17,7 +17,7 @@ packed Boolean-formula compiler. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/Valiant.lean b/Complexitylib/Circuits/Valiant.lean index 346e7d6a..36bea3d2 100644 --- a/Complexitylib/Circuits/Valiant.lean +++ b/Complexitylib/Circuits/Valiant.lean @@ -30,7 +30,7 @@ bound — lives in `Complexitylib.Circuits.Internal.Valiant`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Circuits/XOR/Restriction.lean b/Complexitylib/Circuits/XOR/Restriction.lean index 3b286bb2..fc97f752 100644 --- a/Complexitylib/Circuits/XOR/Restriction.lean +++ b/Complexitylib/Circuits/XOR/Restriction.lean @@ -21,7 +21,7 @@ contradiction needed after a switching argument leaves many variables free. -/ -@[expose] public section +public section namespace Complexity namespace Schnorr diff --git a/Complexitylib/Circuits/XOR/Restriction/Internal.lean b/Complexitylib/Circuits/XOR/Restriction/Internal.lean index 6fd9804a..1ab22cb5 100644 --- a/Complexitylib/Circuits/XOR/Restriction/Internal.lean +++ b/Complexitylib/Circuits/XOR/Restriction/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Circuits.XOR -/ -@[expose] public section +public section namespace Complexity namespace Schnorr diff --git a/Complexitylib/Classes/Containments.lean b/Complexitylib/Classes/Containments.lean index 8103651f..2c1188a0 100644 --- a/Complexitylib/Classes/Containments.lean +++ b/Complexitylib/Classes/Containments.lean @@ -49,7 +49,7 @@ This file collects the standard containment results between complexity classes. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/DTISP.lean b/Complexitylib/Classes/DTISP.lean index 917647ce..72ccd9d6 100644 --- a/Complexitylib/Classes/DTISP.lean +++ b/Complexitylib/Classes/DTISP.lean @@ -19,7 +19,7 @@ The key distinction from intersecting separate time and space classes is that -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/FNP.lean b/Complexitylib/Classes/FNP.lean index 6ecf71bc..ce4ebb98 100644 --- a/Complexitylib/Classes/FNP.lean +++ b/Complexitylib/Classes/FNP.lean @@ -18,7 +18,7 @@ certificate-finding problem is in TFNP (Megiddo–Papadimitriou 1991). -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/FNP/Internal.lean b/Complexitylib/Classes/FNP/Internal.lean index 5fc17277..3f24e148 100644 --- a/Complexitylib/Classes/FNP/Internal.lean +++ b/Complexitylib/Classes/FNP/Internal.lean @@ -16,7 +16,7 @@ Helper lemmas for `OrRelation` used by the surface-layer theorem -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/Hierarchy.lean b/Complexitylib/Classes/Hierarchy.lean index 5aff0376..6110897e 100644 --- a/Complexitylib/Classes/Hierarchy.lean +++ b/Complexitylib/Classes/Hierarchy.lean @@ -42,7 +42,7 @@ The witness is the diagonal language `diagLang clk` of the diagonalizer -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/L/PolynomialTime.lean b/Complexitylib/Classes/L/PolynomialTime.lean index 9d08699b..812113db 100644 --- a/Complexitylib/Classes/L/PolynomialTime.lean +++ b/Complexitylib/Classes/L/PolynomialTime.lean @@ -23,7 +23,7 @@ bound. Consequently `L ⊆ P` and `FL ⊆ FP`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/L/PolynomialTime/Internal.lean b/Complexitylib/Classes/L/PolynomialTime/Internal.lean index 1cedbeb4..84e6ea72 100644 --- a/Complexitylib/Classes/L/PolynomialTime/Internal.lean +++ b/Complexitylib/Classes/L/PolynomialTime/Internal.lean @@ -18,7 +18,7 @@ The public results are in `Complexitylib.Classes.L.PolynomialTime`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/NP/Witness.lean b/Complexitylib/Classes/NP/Witness.lean index 0e856c66..313c7ece 100644 --- a/Complexitylib/Classes/NP/Witness.lean +++ b/Complexitylib/Classes/NP/Witness.lean @@ -53,7 +53,7 @@ verifier being in P) rest only on that single lemma. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/Negligible.lean b/Complexitylib/Classes/Negligible.lean index 47644501..221f39de 100644 --- a/Complexitylib/Classes/Negligible.lean +++ b/Complexitylib/Classes/Negligible.lean @@ -15,7 +15,7 @@ polynomial. This is the standard notion used in cryptographic definitions. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P.lean b/Complexitylib/Classes/P.lean index b27cf6ae..679add44 100644 --- a/Complexitylib/Classes/P.lean +++ b/Complexitylib/Classes/P.lean @@ -39,7 +39,7 @@ This file aggregates the definitions and theorems for P, FP, and PSPACE. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/Composition.lean b/Complexitylib/Classes/P/Composition.lean index ff13cd14..a285b2c1 100644 --- a/Complexitylib/Classes/P/Composition.lean +++ b/Complexitylib/Classes/P/Composition.lean @@ -16,7 +16,7 @@ public import Complexitylib.Classes.P.Internal.Composition -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/FinsetDomain.lean b/Complexitylib/Classes/P/FinsetDomain.lean index 48712472..2cbf7148 100644 --- a/Complexitylib/Classes/P/FinsetDomain.lean +++ b/Complexitylib/Classes/P/FinsetDomain.lean @@ -26,7 +26,7 @@ regardless of how the values `g s` are chosen. - `ite_mem_finset_mem_FP` — `fun s => if s ∈ S then g s else []` belongs to `FP` -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/FinsetDomain/Internal.lean b/Complexitylib/Classes/P/FinsetDomain/Internal.lean index f718c37d..52d947e6 100644 --- a/Complexitylib/Classes/P/FinsetDomain/Internal.lean +++ b/Complexitylib/Classes/P/FinsetDomain/Internal.lean @@ -40,7 +40,7 @@ The public statement (`ite_mem_finset_mem_FP`) lives in `Complexitylib.Classes.P.FinsetDomain`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/Internal.lean b/Complexitylib/Classes/P/Internal.lean index 5d02d162..db7c6ce5 100644 --- a/Complexitylib/Classes/P/Internal.lean +++ b/Complexitylib/Classes/P/Internal.lean @@ -19,7 +19,7 @@ composite machine from `TM.unionTM` correctly decides `L₁ ∪ L₂`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/Internal/Composition.lean b/Complexitylib/Classes/P/Internal/Composition.lean index 851524aa..60f288ca 100644 --- a/Complexitylib/Classes/P/Internal/Composition.lean +++ b/Complexitylib/Classes/P/Internal/Composition.lean @@ -18,7 +18,7 @@ normal forms for its two component computations. The public theorem is in -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/Internal/NormalForm.lean b/Complexitylib/Classes/P/Internal/NormalForm.lean index 417a3142..3cbbd343 100644 --- a/Complexitylib/Classes/P/Internal/NormalForm.lean +++ b/Complexitylib/Classes/P/Internal/NormalForm.lean @@ -18,7 +18,7 @@ The public theorem is in `Complexitylib.Classes.P.NormalForm`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/Internal/Preimage.lean b/Complexitylib/Classes/P/Internal/Preimage.lean index a83f339b..cd09df60 100644 --- a/Complexitylib/Classes/P/Internal/Preimage.lean +++ b/Complexitylib/Classes/P/Internal/Preimage.lean @@ -18,7 +18,7 @@ those bounds. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/NormalForm.lean b/Complexitylib/Classes/P/NormalForm.lean index 89e3d56e..eaac3552 100644 --- a/Complexitylib/Classes/P/NormalForm.lean +++ b/Complexitylib/Classes/P/NormalForm.lean @@ -22,7 +22,7 @@ normalized bounds are valid on every input length and are monotone. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/PairWithInput.lean b/Complexitylib/Classes/P/PairWithInput.lean index 95c22b05..b167d13c 100644 --- a/Complexitylib/Classes/P/PairWithInput.lean +++ b/Complexitylib/Classes/P/PairWithInput.lean @@ -16,7 +16,7 @@ public import Complexitylib.Classes.P.PairWithInput.Internal -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/PairWithInput/Internal.lean b/Complexitylib/Classes/P/PairWithInput/Internal.lean index 176aeaef..d71804c0 100644 --- a/Complexitylib/Classes/P/PairWithInput/Internal.lean +++ b/Complexitylib/Classes/P/PairWithInput/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.TuringMachine.Composition.PairWithInput -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/Preimage.lean b/Complexitylib/Classes/P/Preimage.lean index 779e316b..915fc5cd 100644 --- a/Complexitylib/Classes/P/Preimage.lean +++ b/Complexitylib/Classes/P/Preimage.lean @@ -16,7 +16,7 @@ public import Complexitylib.Classes.P.Internal.Preimage -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/UnaryLength.lean b/Complexitylib/Classes/P/UnaryLength.lean index 3d321027..1afbde23 100644 --- a/Complexitylib/Classes/P/UnaryLength.lean +++ b/Complexitylib/Classes/P/UnaryLength.lean @@ -16,7 +16,7 @@ public import Complexitylib.Classes.P.UnaryLength.Internal -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/P/UnaryLength/Internal.lean b/Complexitylib/Classes/P/UnaryLength/Internal.lean index fec5ce63..2c56cc2f 100644 --- a/Complexitylib/Classes/P/UnaryLength/Internal.lean +++ b/Complexitylib/Classes/P/UnaryLength/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.UnaryLength -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly.lean b/Complexitylib/Classes/PPoly.lean index 421d633a..78ca2f3d 100644 --- a/Complexitylib/Classes/PPoly.lean +++ b/Complexitylib/Classes/PPoly.lean @@ -17,7 +17,7 @@ convention used elsewhere in the library. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Advice.lean b/Complexitylib/Classes/PPoly/Advice.lean index d9d3c2ae..812ed586 100644 --- a/Complexitylib/Classes/PPoly/Advice.lean +++ b/Complexitylib/Classes/PPoly/Advice.lean @@ -30,7 +30,7 @@ evaluator. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Advice/Internal.lean b/Complexitylib/Classes/PPoly/Advice/Internal.lean index 8f3ad348..26627623 100644 --- a/Complexitylib/Classes/PPoly/Advice/Internal.lean +++ b/Complexitylib/Classes/PPoly/Advice/Internal.lean @@ -18,7 +18,7 @@ for advised-computation circuit families. Public statements are exposed by -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Advice/Reverse.lean b/Complexitylib/Classes/PPoly/Advice/Reverse.lean index 67cbca48..9c9ae59a 100644 --- a/Complexitylib/Classes/PPoly/Advice/Reverse.lean +++ b/Complexitylib/Classes/PPoly/Advice/Reverse.lean @@ -27,7 +27,7 @@ length-dependent advice for the verified circuit evaluator. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Advice/Reverse/Internal.lean b/Complexitylib/Classes/PPoly/Advice/Reverse/Internal.lean index ed25b360..f177becd 100644 --- a/Complexitylib/Classes/PPoly/Advice/Reverse/Internal.lean +++ b/Complexitylib/Classes/PPoly/Advice/Reverse/Internal.lean @@ -21,7 +21,7 @@ length. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Containment.lean b/Complexitylib/Classes/PPoly/Uniform/Containment.lean index 6e3ad5bc..c5e88425 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Containment.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Containment.lean @@ -21,7 +21,7 @@ polynomial time. A generic fanout combinator then constructs the serialized -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Containment/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Containment/Internal.lean index ce61f574..ea2c0a08 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Containment/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Containment/Internal.lean @@ -17,7 +17,7 @@ public import Complexitylib.Classes.PPoly -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Preprocessing.lean b/Complexitylib/Classes/PPoly/Uniform/Preprocessing.lean index 69e2803e..5deeca4d 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Preprocessing.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Preprocessing.lean @@ -17,7 +17,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Preprocessing.Internal -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Preprocessing/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Preprocessing/Internal.lean index e3c6d040..61f67333 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Preprocessing/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Preprocessing/Internal.lean @@ -16,7 +16,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Preprocessing.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling.lean index 3346e9e1..3a657030 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling.lean @@ -28,7 +28,7 @@ uniformity emitter. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Containment.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Containment.lean index c068a9f1..75c3155c 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Containment.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Containment.lean @@ -27,7 +27,7 @@ discharges them unconditionally. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Containment/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Containment/Internal.lean index 6f70dd4f..9862f900 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Containment/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Containment/Internal.lean @@ -20,7 +20,7 @@ serializer, yielding the unconditional machines-to-circuits containment. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Finalization.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Finalization.lean index 28bb42d9..e5dac608 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Finalization.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Finalization.lean @@ -18,7 +18,7 @@ uses logarithmic-width work values and performs no preliminary counting pass. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Finalization/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Finalization/Internal.lean index 3f58f1d4..0d5b29c4 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Finalization/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Finalization/Internal.lean @@ -6,9 +6,9 @@ Authors: Samuel Schlesinger module public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Finalization.Defs -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Arithmetic -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Control -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.List +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Arithmetic +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Control +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.List public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.SpaceBounds.Internal /-! @@ -16,7 +16,7 @@ public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Spac -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Initialization.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Initialization.lean index 86413d57..f3913a3b 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Initialization.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Initialization.lean @@ -17,7 +17,7 @@ the direct initialization phase. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Initialization/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Initialization/Internal.lean index 9cb972f4..ce77df59 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Initialization/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Initialization/Internal.lean @@ -7,20 +7,20 @@ Authors: Samuel Schlesinger module public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Initialization.Defs public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Bounds -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Arithmetic -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Control -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.List +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Arithmetic +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Control +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.List public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.SpaceBounds public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Initialization.Defs public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.InputLength.Defs -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryLength +import Complexitylib.Models.TuringMachine.Subroutines.BinaryLength /-! # Direct-unrolling initialization generator -- proof internals -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Offset.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Offset.lean index a1315354..e5681a96 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Offset.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Offset.lean @@ -16,7 +16,7 @@ raw gate with one dynamic and one fixed recent-wire reference. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Offset/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Offset/Internal.lean index bd47d26d..c7a9657d 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Offset/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Offset/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Cont -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/PolynomialOffset.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/PolynomialOffset.lean index b9c1c61e..1e0b8954 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/PolynomialOffset.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/PolynomialOffset.lean @@ -16,7 +16,7 @@ are fixed polynomials in the run-time tableau horizon. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/PolynomialOffset/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/PolynomialOffset/Internal.lean index a2011e08..7566f3d9 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/PolynomialOffset/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/PolynomialOffset/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Polynomial -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Primitive.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Primitive.lean index 4be392d7..44e870c6 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Primitive.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Primitive.lean @@ -16,7 +16,7 @@ head, and cell configuration-wire references. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Primitive/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Primitive/Internal.lean index cc3bade7..367b953d 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Primitive/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Primitive/Internal.lean @@ -10,15 +10,15 @@ public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Arit public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.List public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.SpaceBounds public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.Case.Defs -public import Mathlib.Tactic.ENatToNat -public import Mathlib.Tactic.ReduceModChar +import Mathlib.Tactic.ENatToNat +import Mathlib.Tactic.ReduceModChar /-! # Direct-unrolling generator primitives -- proof internals -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Program.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Program.lean index 69fadee4..f3a027b1 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Program.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Program.lean @@ -17,7 +17,7 @@ tableau body and discharges its value-level entry condition. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Program/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Program/Internal.lean index 302ed9f2..8a32481e 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Program/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Program/Internal.lean @@ -6,21 +6,21 @@ Authors: Samuel Schlesinger module public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Program.Defs -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Arithmetic -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Control -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.List +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Arithmetic +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Control +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.List public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.SpaceBounds public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.InputLength.Defs -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryLength -public import Mathlib.Tactic.ENatToNat -public import Mathlib.Tactic.ReduceModChar +import Complexitylib.Models.TuringMachine.Subroutines.BinaryLength +import Mathlib.Tactic.ENatToNat +import Mathlib.Tactic.ReduceModChar /-! # Direct-unrolling generator program -- proof internals -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Tableau.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Tableau.lean index f6b24262..c46032ea 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Tableau.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Tableau.lean @@ -18,7 +18,7 @@ member), and has a verified logarithmic all-prefix auxiliary-space bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Tableau/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Tableau/Internal.lean index bc2d50ca..216b0a82 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Tableau/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Tableau/Internal.lean @@ -5,13 +5,13 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Finalization -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Program +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Finalization +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Program public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Tableau.Defs public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Step public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Padded -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Finalization -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.InputLength +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Finalization +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.InputLength /-! # Complete direct-unrolling generator -- proof internals @@ -22,7 +22,7 @@ the dedicated layer counter exactly once per emitted packed step. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Case.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Case.lean index 89b9ba1d..c551605f 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Case.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Case.lean @@ -16,7 +16,7 @@ with soundness of the complete case-formula emitter. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Case/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Case/Internal.lean index 1facd31f..c7504940 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Case/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Case/Internal.lean @@ -9,7 +9,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Initializa public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Offset public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Case.Defs public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Read -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Initialization +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Initialization /-! # Direct-unrolling transition-case generator -- proof internals diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Effect.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Effect.lean index ec8cbeaa..238ce013 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Effect.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Effect.lean @@ -16,7 +16,7 @@ transition table. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Effect/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Effect/Internal.lean index 09481faa..50755dba 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Effect/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Effect/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/MovedHead.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/MovedHead.lean index 325f588a..c66ed2da 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/MovedHead.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/MovedHead.lean @@ -17,7 +17,7 @@ numeric schedule. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/MovedHead/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/MovedHead/Internal.lean index d5af1b54..88b9e6db 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/MovedHead/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/MovedHead/Internal.lean @@ -6,9 +6,9 @@ Authors: Samuel Schlesinger module public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.PolynomialOffset -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Effect +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Effect public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.MovedHead.Defs -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Predecessor +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Predecessor public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.Polynomial /-! @@ -16,7 +16,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transitio -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Next.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Next.lean index 51f5a593..8094cb43 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Next.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Next.lean @@ -20,7 +20,7 @@ canonical raw schedules are literally identical. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Next/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Next/Internal.lean index 95aebf2e..79da6c7c 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Next/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Next/Internal.lean @@ -6,17 +6,17 @@ Authors: Samuel Schlesinger module public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Next.Defs -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.MovedHead +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.MovedHead public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.WrittenCell -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.MovedHead -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.WrittenCell +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.MovedHead +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.WrittenCell /-! # Direct-unrolling next-atom generator -- proof internals -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/PackedCopy.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/PackedCopy.lean index a741d6f8..c067ee46 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/PackedCopy.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/PackedCopy.lean @@ -16,7 +16,7 @@ cursor and emits the corresponding packed-output copy gate. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/PackedCopy/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/PackedCopy/Internal.lean index 4b24564b..0b3be4e4 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/PackedCopy/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/PackedCopy/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Predecessor.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Predecessor.lean index 0aad7fd9..48f84780 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Predecessor.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Predecessor.lean @@ -19,7 +19,7 @@ mean stay, matching `movedHeadPositionCode`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Predecessor/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Predecessor/Internal.lean index a6f02a54..5bc45689 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Predecessor/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Predecessor/Internal.lean @@ -5,11 +5,11 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Initialization +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Initialization public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Offset public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Predecessor.Defs -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Initialization +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Initialization public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.MovedHead.Defs /-! @@ -17,7 +17,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transitio -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Read.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Read.lean index 74658741..4132eef0 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Read.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Read.lean @@ -16,7 +16,7 @@ for reading one symbol from a bounded encoded configuration. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Read/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Read/Internal.lean index b86797d8..bbffb411 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Read/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Read/Internal.lean @@ -8,14 +8,14 @@ module public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Primitive public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Read.Defs public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition -public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Control +import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Control /-! # Direct-unrolling read-formula generator -- proof internals -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step.lean index d598a432..c6aa3023 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step.lean @@ -19,7 +19,7 @@ packed transition fragment. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal.lean index 1e5049d0..845d4c37 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal.lean @@ -23,7 +23,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/FormulaSpace.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/FormulaSpace.lean index 6143a3e0..a028dca6 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/FormulaSpace.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/FormulaSpace.lean @@ -16,7 +16,7 @@ certifies every nested routine against the shared packed-step width envelope. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Packed.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Packed.lean index d7269c80..93aa4ffe 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Packed.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Packed.lean @@ -17,7 +17,7 @@ are intentionally handled by separate modules. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Requires.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Requires.lean index e9c8412b..842a02c3 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Requires.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Requires.lean @@ -5,8 +5,8 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Next -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.PackedCopy +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Next +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.PackedCopy public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Step.Defs /-! @@ -17,7 +17,7 @@ formula and delayed-copy phases of one packed transition step. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Sound.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Sound.lean index a75821a5..ff73fff4 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Sound.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Sound.lean @@ -5,8 +5,8 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Next -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.PackedCopy +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Next +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.PackedCopy public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Step.Defs /-! @@ -17,7 +17,7 @@ by one direct-unrolling transition step. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space.lean index 37ff9c73..3ec77aa6 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space.lean @@ -5,8 +5,7 @@ Authors: Samuel Schlesinger -/ module -public import - Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Step.Internal.FormulaSpace +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Step.Internal.FormulaSpace public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Generator.Transition.Step.Internal.Space.Packed @@ -18,7 +17,7 @@ seven exact register phases of `emitStep`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space/Common.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space/Common.lean index 36b20600..9f578184 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space/Common.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space/Common.lean @@ -16,7 +16,7 @@ used to assemble the auxiliary-space proof for direct packed-step generation. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space/Packed.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space/Packed.lean index fbed2149..67869cd3 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space/Packed.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Space/Packed.lean @@ -18,7 +18,7 @@ width envelope. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Top.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Top.lean index bc0f15ab..7c5296e0 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Top.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/Step/Internal/Top.lean @@ -16,7 +16,7 @@ for the complete formula phase, packed-copy phase, and deterministic step. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/WrittenCell.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/WrittenCell.lean index cc27a26d..326e8fc1 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/WrittenCell.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/WrittenCell.lean @@ -18,7 +18,7 @@ schedule. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/WrittenCell/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/WrittenCell/Internal.lean index a9ade416..7859e8b7 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/WrittenCell/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Generator/Transition/WrittenCell/Internal.lean @@ -18,7 +18,7 @@ intentionally deferred until that generator's public contracts are available. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Internal.lean index b593f240..2c202f0c 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Internal.lean @@ -18,7 +18,7 @@ exact positive-length serialization theorem. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Padded/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Padded/Internal.lean index 24a2b910..ce2d552d 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Padded/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Padded/Internal.lean @@ -16,7 +16,7 @@ the terminal copy reads the original acceptance wire through the dead padding. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer.lean index 68965615..17647530 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer.lean @@ -37,7 +37,7 @@ They isolate the exact arithmetic that the later finite controller must realize. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds.lean index 59db93a4..0fdd96ff 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds.lean @@ -26,7 +26,7 @@ padding frontier without first counting the emitted raw gates. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds/Defs.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds/Defs.lean index 6b4599d6..c6623c64 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds/Defs.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds/Defs.lean @@ -6,19 +6,19 @@ Authors: Samuel Schlesinger module public import Complexitylib.Circuits.Unrolling.Acceptance.Defs -public import Mathlib.Analysis.SpecialFunctions.Pow.NNReal -public import Mathlib.Tactic.Measurability.Init -public import Mathlib.Tactic.NormNum.BigOperators -public import Mathlib.Tactic.NormNum.Irrational -public import Mathlib.Tactic.NormNum.IsCoprime -public import Mathlib.Tactic.NormNum.IsSquare +import Mathlib.Analysis.SpecialFunctions.Pow.NNReal +import Mathlib.Tactic.Measurability.Init +import Mathlib.Tactic.NormNum.BigOperators +import Mathlib.Tactic.NormNum.Irrational +import Mathlib.Tactic.NormNum.IsCoprime +import Mathlib.Tactic.NormNum.IsSquare public import Mathlib.Tactic.NormNum.LegendreSymbol -public import Mathlib.Tactic.NormNum.ModEq -public import Mathlib.Tactic.NormNum.NatFactorial -public import Mathlib.Tactic.NormNum.NatFib -public import Mathlib.Tactic.NormNum.NatLog -public import Mathlib.Tactic.NormNum.NatSqrt -public import Mathlib.Tactic.NormNum.Ordinal +import Mathlib.Tactic.NormNum.ModEq +import Mathlib.Tactic.NormNum.NatFactorial +import Mathlib.Tactic.NormNum.NatFib +import Mathlib.Tactic.NormNum.NatLog +import Mathlib.Tactic.NormNum.NatSqrt +import Mathlib.Tactic.NormNum.Ordinal public import Mathlib.Tactic.NormNum.Parity public import Mathlib.Tactic.NormNum.Prime public import Mathlib.Tactic.NormNum.RealSqrt diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds/Internal.lean index f8faa409..b5daf5a6 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Bounds/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Padded.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Finalization.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Finalization.lean index 154b3580..3b987396 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Finalization.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Finalization.lean @@ -26,7 +26,7 @@ specifies the raw gate stream without run-time configuration atoms or formulas. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Finalization/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Finalization/Internal.lean index 7d9c7b86..0c5f86cf 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Finalization/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Finalization/Internal.lean @@ -15,7 +15,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Padded.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Initialization.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Initialization.lean index 5a7fa178..2e8f2319 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Initialization.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Initialization.lean @@ -28,7 +28,7 @@ does not yet construct a Turing machine that emits those gates. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Initialization/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Initialization/Internal.lean index 7c4afcec..f5ed1f27 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Initialization/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Initialization/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Internal.lean index f0e4991f..63b0637e 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Circuits.Encoding.Formula.Stream -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition.lean index acfc507a..2e1dcd3a 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition.lean @@ -26,7 +26,7 @@ proof adapters. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Atomic.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Atomic.lean index 8929fb2d..939635ac 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Atomic.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Atomic.lean @@ -16,7 +16,7 @@ postorder halted-or wrapper used by state, head, and writable-cell successors. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Atomic/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Atomic/Internal.lean index d1aeec92..9755bab1 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Atomic/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Atomic/Internal.lean @@ -6,7 +6,7 @@ Authors: Samuel Schlesinger module public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.Atomic.Defs -public import Complexitylib.Circuits.Encoding.Formula +import Complexitylib.Circuits.Encoding.Formula public import Complexitylib.Circuits.Unrolling.Transition.Defs /-! @@ -14,7 +14,7 @@ public import Complexitylib.Circuits.Unrolling.Transition.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Case.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Case.lean index 039e9374..1e8ee5d2 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Case.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Case.lean @@ -24,7 +24,7 @@ only in the final compilation adapter. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Case/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Case/Internal.lean index 26b2f5f8..59e750c7 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Case/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Case/Internal.lean @@ -18,7 +18,7 @@ indices before identifying the emitted stream with the definitions layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Effect.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Effect.lean index 8cf89c5d..69dfca86 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Effect.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Effect.lean @@ -26,7 +26,7 @@ the disjunction. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Effect/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Effect/Internal.lean index 62665a3b..833712e8 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Effect/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Effect/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transitio -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Internal.lean index 8960185a..847bf46f 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Internal.lean @@ -19,7 +19,7 @@ theorems. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/MovedHead.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/MovedHead.lean index 441c8461..c0c48858 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/MovedHead.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/MovedHead.lean @@ -24,7 +24,7 @@ reverse disjunction connectors complete the stream. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/MovedHead/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/MovedHead/Internal.lean index c4154c40..e1620a3f 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/MovedHead/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/MovedHead/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transitio -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Next.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Next.lean index 755a4e32..918fd964 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Next.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Next.lean @@ -27,7 +27,7 @@ public transition schedule. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Next/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Next/Internal.lean index 17c3c4f1..29df2b4c 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Next/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Next/Internal.lean @@ -5,7 +5,7 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.MovedHead +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.MovedHead public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.Next.Defs public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.WrittenCell @@ -14,7 +14,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transitio -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Polynomial.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Polynomial.lean index bfc93fdd..bea13ff0 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Polynomial.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Polynomial.lean @@ -17,7 +17,7 @@ measure nested transition schedules as functions of the tableau horizon. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Polynomial/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Polynomial/Internal.lean index 4fde4ed0..ed2e8f63 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Polynomial/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Polynomial/Internal.lean @@ -5,7 +5,7 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.Polynomial.Defs /-! @@ -13,7 +13,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transitio -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Step.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Step.lean index f2372e2f..ef3a638b 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Step.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Step.lean @@ -29,7 +29,7 @@ one packed-output copy per atom in that same order. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Step/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Step/Internal.lean index bc385cc5..7faf2439 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Step/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/Step/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transitio -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/WrittenCell.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/WrittenCell.lean index 398790f6..ad0953e6 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/WrittenCell.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/WrittenCell.lean @@ -25,7 +25,7 @@ six-gate suffix combines the selected write with the old cell value. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/WrittenCell/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/WrittenCell/Internal.lean index 2e21b5c1..37b5fcd9 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/WrittenCell/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Serializer/Transition/WrittenCell/Internal.lean @@ -5,7 +5,7 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Initialization +import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Initialization public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.Atomic public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.Effect public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transition.WrittenCell.Defs @@ -15,7 +15,7 @@ public import Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Transitio -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Stream.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Stream.lean index bb6d3f90..f78537a5 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Stream.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Stream.lean @@ -33,7 +33,7 @@ that serializer reproduce the recursive `TraceBuild` arithmetic at run time. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Stream/Internal.lean b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Stream/Internal.lean index ae27498f..bd60470d 100644 --- a/Complexitylib/Classes/PPoly/Uniform/Unrolling/Stream/Internal.lean +++ b/Complexitylib/Classes/PPoly/Uniform/Unrolling/Stream/Internal.lean @@ -16,7 +16,7 @@ resulting constant packed-layer size. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Unrolling.lean b/Complexitylib/Classes/PPoly/Unrolling.lean index c4a15d96..334915e4 100644 --- a/Complexitylib/Classes/PPoly/Unrolling.lean +++ b/Complexitylib/Classes/PPoly/Unrolling.lean @@ -26,7 +26,7 @@ and concludes `P ⊆ P/poly` directly from the unrolling construction. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PPoly/Unrolling/Internal.lean b/Complexitylib/Classes/PPoly/Unrolling/Internal.lean index 7e506b10..0db8e5b1 100644 --- a/Complexitylib/Classes/PPoly/Unrolling/Internal.lean +++ b/Complexitylib/Classes/PPoly/Unrolling/Internal.lean @@ -19,7 +19,7 @@ by unrolling a deterministic machine. Public statements are exposed by -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/PropertyDensity.lean b/Complexitylib/Classes/PropertyDensity.lean index 52fe23cb..f20923db 100644 --- a/Complexitylib/Classes/PropertyDensity.lean +++ b/Complexitylib/Classes/PropertyDensity.lean @@ -24,7 +24,7 @@ random-bit `eventProb` layer but over the sample space of all Boolean functions. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/Randomized/CircuitAmplification.lean b/Complexitylib/Classes/Randomized/CircuitAmplification.lean index 5d6694ef..7100c332 100644 --- a/Complexitylib/Classes/Randomized/CircuitAmplification.lean +++ b/Complexitylib/Classes/Randomized/CircuitAmplification.lean @@ -21,7 +21,7 @@ the positive-length data suffix live. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/Randomized/PPoly.lean b/Complexitylib/Classes/Randomized/PPoly.lean index b6523f79..eba8d8aa 100644 --- a/Complexitylib/Classes/Randomized/PPoly.lean +++ b/Complexitylib/Classes/Randomized/PPoly.lean @@ -29,7 +29,7 @@ decider. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/Randomized/PPoly/Internal.lean b/Complexitylib/Classes/Randomized/PPoly/Internal.lean index 1eace0bd..2bc91d07 100644 --- a/Complexitylib/Classes/Randomized/PPoly/Internal.lean +++ b/Complexitylib/Classes/Randomized/PPoly/Internal.lean @@ -18,7 +18,7 @@ statements are exposed by `Complexitylib.Classes.Randomized.PPoly`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Classes/SharpP.lean b/Complexitylib/Classes/SharpP.lean index 508408ef..e7a840a6 100644 --- a/Complexitylib/Classes/SharpP.lean +++ b/Complexitylib/Classes/SharpP.lean @@ -26,7 +26,7 @@ existing `NTM.acceptCount` path semantics (roadmap track L5). -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/DescriptiveComplexity/Definable.lean b/Complexitylib/DescriptiveComplexity/Definable.lean index c145fde2..a94aae90 100644 --- a/Complexitylib/DescriptiveComplexity/Definable.lean +++ b/Complexitylib/DescriptiveComplexity/Definable.lean @@ -34,7 +34,7 @@ bounds. -/ -@[expose] public section +public section open scoped Complexity.DescriptiveComplexity diff --git a/Complexitylib/DescriptiveComplexity/Encoding.lean b/Complexitylib/DescriptiveComplexity/Encoding.lean index 1bf72628..a5fc6f20 100644 --- a/Complexitylib/DescriptiveComplexity/Encoding.lean +++ b/Complexitylib/DescriptiveComplexity/Encoding.lean @@ -32,7 +32,7 @@ relational part of that encoding and computes its length; it is step 5 (structur -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/DescriptiveComplexity/Examples.lean b/Complexitylib/DescriptiveComplexity/Examples.lean index bb1a78fa..db8ae044 100644 --- a/Complexitylib/DescriptiveComplexity/Examples.lean +++ b/Complexitylib/DescriptiveComplexity/Examples.lean @@ -17,7 +17,7 @@ public import Complexitylib.DescriptiveComplexity.FirstOrder.Isomorphism -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/DescriptiveComplexity/FirstOrder/Isomorphism.lean b/Complexitylib/DescriptiveComplexity/FirstOrder/Isomorphism.lean index 2912d7a6..c7f18ca3 100644 --- a/Complexitylib/DescriptiveComplexity/FirstOrder/Isomorphism.lean +++ b/Complexitylib/DescriptiveComplexity/FirstOrder/Isomorphism.lean @@ -18,7 +18,7 @@ public import Complexitylib.DescriptiveComplexity.FirstOrder.Semantics -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/DescriptiveComplexity/FirstOrder/Substitution.lean b/Complexitylib/DescriptiveComplexity/FirstOrder/Substitution.lean index 3e9c7831..d883a420 100644 --- a/Complexitylib/DescriptiveComplexity/FirstOrder/Substitution.lean +++ b/Complexitylib/DescriptiveComplexity/FirstOrder/Substitution.lean @@ -32,7 +32,7 @@ formula along an `FOInterpretation`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/DescriptiveComplexity/Isomorphism.lean b/Complexitylib/DescriptiveComplexity/Isomorphism.lean index 1cdf67b1..6f8590ca 100644 --- a/Complexitylib/DescriptiveComplexity/Isomorphism.lean +++ b/Complexitylib/DescriptiveComplexity/Isomorphism.lean @@ -16,7 +16,7 @@ public import Complexitylib.DescriptiveComplexity.Structure -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/DescriptiveComplexity/Language.lean b/Complexitylib/DescriptiveComplexity/Language.lean index 0146596e..405e048f 100644 --- a/Complexitylib/DescriptiveComplexity/Language.lean +++ b/Complexitylib/DescriptiveComplexity/Language.lean @@ -27,7 +27,7 @@ ultimately rest on. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/DescriptiveComplexity/ModelChecking.lean b/Complexitylib/DescriptiveComplexity/ModelChecking.lean index 3929bfd5..e4ea575c 100644 --- a/Complexitylib/DescriptiveComplexity/ModelChecking.lean +++ b/Complexitylib/DescriptiveComplexity/ModelChecking.lean @@ -35,7 +35,7 @@ characterization, and the `FO ⊆ AC⁰` bridge. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Languages/AllSymbol.lean b/Complexitylib/Languages/AllSymbol.lean index ae258ca2..ee205204 100644 --- a/Complexitylib/Languages/AllSymbol.lean +++ b/Complexitylib/Languages/AllSymbol.lean @@ -28,7 +28,7 @@ single `Bool` tracking "every bit so far equals target". -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Languages/Balanced.lean b/Complexitylib/Languages/Balanced.lean index 79816f89..891c0d5b 100644 --- a/Complexitylib/Languages/Balanced.lean +++ b/Complexitylib/Languages/Balanced.lean @@ -37,7 +37,7 @@ Emptiness (`h = 0`) is detected structurally by the work head reading -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Languages/Contains.lean b/Complexitylib/Languages/Contains.lean index f3171a67..18dc6191 100644 --- a/Complexitylib/Languages/Contains.lean +++ b/Complexitylib/Languages/Contains.lean @@ -28,7 +28,7 @@ The strings containing at least one `0`-bit (resp. `1`-bit). Decided by a -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Languages/LastBit.lean b/Complexitylib/Languages/LastBit.lean index ea88d5da..bd7ffd83 100644 --- a/Complexitylib/Languages/LastBit.lean +++ b/Complexitylib/Languages/LastBit.lean @@ -28,7 +28,7 @@ is the last bit seen so far, or `none` if no bit has been read. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Languages/LengthDivBy.lean b/Complexitylib/Languages/LengthDivBy.lean index 34ec8d11..8d5cdc40 100644 --- a/Complexitylib/Languages/LengthDivBy.lean +++ b/Complexitylib/Languages/LengthDivBy.lean @@ -30,7 +30,7 @@ This generalizes `evenLength` (which is `lengthDivBy 2`). -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Languages/LengthParity.lean b/Complexitylib/Languages/LengthParity.lean index c1ff3cb8..73c0ad89 100644 --- a/Complexitylib/Languages/LengthParity.lean +++ b/Complexitylib/Languages/LengthParity.lean @@ -31,7 +31,7 @@ the input. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Languages/Trivial.lean b/Complexitylib/Languages/Trivial.lean index 020d1827..17ea856c 100644 --- a/Complexitylib/Languages/Trivial.lean +++ b/Complexitylib/Languages/Trivial.lean @@ -31,7 +31,7 @@ complexity class. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Languages/ZeroPrefix.lean b/Complexitylib/Languages/ZeroPrefix.lean index 2d0d43a7..26d3024c 100644 --- a/Complexitylib/Languages/ZeroPrefix.lean +++ b/Complexitylib/Languages/ZeroPrefix.lean @@ -35,7 +35,7 @@ via the permanently-`▷` cell 0. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Mathlib/FinsetPrefixes.lean b/Complexitylib/Mathlib/FinsetPrefixes.lean index fc5a3013..96ca3e9b 100644 --- a/Complexitylib/Mathlib/FinsetPrefixes.lean +++ b/Complexitylib/Mathlib/FinsetPrefixes.lean @@ -22,7 +22,7 @@ type in its home namespace — the sanctioned exception to the `Complexity` root-namespace rule. Its contents are candidates for upstreaming to Mathlib. -/ -@[expose] public section +public section namespace Finset diff --git a/Complexitylib/Models/RandomAccessMachine.lean b/Complexitylib/Models/RandomAccessMachine.lean index d435e814..5a4b17f8 100644 --- a/Complexitylib/Models/RandomAccessMachine.lean +++ b/Complexitylib/Models/RandomAccessMachine.lean @@ -303,7 +303,7 @@ simulator this proves `RAM.RegisterStore.Machine.RAM_P_eq_P`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Classes.lean b/Complexitylib/Models/RandomAccessMachine/Classes.lean index 0d79e4df..ebe1772b 100644 --- a/Complexitylib/Models/RandomAccessMachine/Classes.lean +++ b/Complexitylib/Models/RandomAccessMachine/Classes.lean @@ -15,7 +15,7 @@ elementary monotonicity properties. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Internal.lean index 2b7e0ee2..87d7d68f 100644 --- a/Complexitylib/Models/RandomAccessMachine/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Internal.lean @@ -32,7 +32,7 @@ statements in the surface module carry the mathematical content. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore.lean index c802a98c..418155cd 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore.lean @@ -24,7 +24,7 @@ bit-width at most `w`, a snapshot with `m` entries occupies at most -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Containment.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Containment.lean index c41791c1..cb9f28d2 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Containment.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Containment.lean @@ -19,7 +19,7 @@ establish machine-model robustness of polynomial time. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Containment/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Containment/Internal.lean index 1d457498..9ec83951 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Containment/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Containment/Internal.lean @@ -28,7 +28,7 @@ envelope and lifts the simulation to deterministic polynomial time. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/DenseOverlay.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/DenseOverlay.lean index dcf31452..be2f220c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/DenseOverlay.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/DenseOverlay.lean @@ -18,7 +18,7 @@ from an absent overlay entry. -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/DenseOverlay/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/DenseOverlay/Internal.lean index ed5221bc..3a10c663 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/DenseOverlay/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/DenseOverlay/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Internal.lean index 4ce0bfb7..03dbdca7 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Internal.lean @@ -17,7 +17,7 @@ the surface module. It is not part of the human-audited definitions layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/AddressEq.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/AddressEq.lean index 798e8585..15b1c96e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/AddressEq.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/AddressEq.lean @@ -17,7 +17,7 @@ comparison used by the concrete sparse register-store scan. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/AddressEq/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/AddressEq/Internal.lean index 5c731e11..c9c34957 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/AddressEq/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/AddressEq/Internal.lean @@ -15,7 +15,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.BinaryEq -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/DenseInputLookup.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/DenseInputLookup.lean index 9e901056..bedc3de2 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/DenseInputLookup.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/DenseInputLookup.lean @@ -16,7 +16,7 @@ overlay into the immutable public-input bank. -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/DenseInputLookup/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/DenseInputLookup/Internal.lean index 7d332804..01b6b58b 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/DenseInputLookup/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/DenseInputLookup/Internal.lean @@ -18,7 +18,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.ResetBinary -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryAppend.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryAppend.lean index a84d9120..4cb0ce9f 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryAppend.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryAppend.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryAppend/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryAppend/Internal.lean index 19e0f35f..1758a3ef 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryAppend/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryAppend/Internal.lean @@ -18,7 +18,7 @@ public import Mathlib.Tactic.NormNum.OfScientific -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryCleanup.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryCleanup.lean index 9c8691e1..8046ba7c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryCleanup.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryCleanup.lean @@ -18,7 +18,7 @@ bounded sparse register-store scan. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryCleanup/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryCleanup/Internal.lean index 104e8c4c..83bc6df7 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryCleanup/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryCleanup/Internal.lean @@ -20,7 +20,7 @@ public import Mathlib.Tactic.NormNum.OfScientific -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode.lean index d7a15400..e7f6f175 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode.lean @@ -20,7 +20,7 @@ address/value decoder. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode/Internal.lean index be6c2e96..9466cf76 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode/LinearInternal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode/LinearInternal.lean index 928c4cbf..48ce9325 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode/LinearInternal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryDecode/LinearInternal.lean @@ -18,7 +18,7 @@ framed for compatibility with the existing sparse-store work-tape layout. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryEncode.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryEncode.lean index 8ebf48c3..9361475f 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryEncode.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryEncode.lean @@ -16,7 +16,7 @@ public import Complexitylib.Models.TuringMachine.Hoare.RetargetOutput -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryEncode/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryEncode/Internal.lean index 85e942c6..9473108a 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryEncode/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryEncode/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup.lean index cd14f6ad..f65c99e6 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup.lean @@ -17,7 +17,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup/Defs.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup/Defs.lean index 7db57953..36743fef 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup/Defs.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup/Defs.lean @@ -16,7 +16,7 @@ its semantic endpoint in terms of the pure sparse-store `read` operation. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup/Internal.lean index 6f8aafc1..20ff15f8 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookup/Internal.lean @@ -15,7 +15,7 @@ public import Mathlib.Data.Nat.Bitwise -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookupRestore.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookupRestore.lean index c63f6789..8cbe2776 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookupRestore.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryLookupRestore.lean @@ -18,7 +18,7 @@ source, restores the runtime entry count, and returns to the same scanner ABI. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMatch.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMatch.lean index 26aa0055..c6475344 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMatch.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMatch.lean @@ -18,7 +18,7 @@ unit used by a bounded sparse register-store scan. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMatch/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMatch/Internal.lean index f8fcd854..069b314e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMatch/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMatch/Internal.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMissCopy.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMissCopy.lean index 9ddd0b71..41efbb65 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMissCopy.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMissCopy.lean @@ -18,7 +18,7 @@ the new store and restores the exact invariant needed to inspect the next one. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMissCopy/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMissCopy/Internal.lean index 4c9f0d75..c42babe9 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMissCopy/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryMissCopy/Internal.lean @@ -15,7 +15,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryReplace.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryReplace.lean index d0e6b9fb..35efa72e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryReplace.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryReplace.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryReplace/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryReplace/Internal.lean index 07719fa6..8aa571ec 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryReplace/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryReplace/Internal.lean @@ -15,7 +15,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan.lean index 8d17f7f6..3ff092df 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan.lean @@ -21,7 +21,7 @@ it is not hardwired into the finite controller. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Bounds.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Bounds.lean index 19e14b19..b477d72c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Bounds.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Bounds.lean @@ -5,13 +5,12 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore -public import - Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryMatch.Internal +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryMatch.Internal public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryScan.Defs -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred -public import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany +import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred +import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany /-! # Encoded-length bounds for sparse-entry scans -- proof internals @@ -22,7 +21,7 @@ scan theorem retains only the separate binary remaining-count charge. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Inv.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Inv.lean index 5dbaf47f..a9138d25 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Inv.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Inv.lean @@ -7,19 +7,19 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryScan.Defs -public import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany -public import Mathlib.Tactic.FinCases -public import Mathlib.Data.Rat.Cast.Order -public import Mathlib.Tactic.NormNum.Abs -public import Mathlib.Tactic.NormNum.DivMod -public import Mathlib.Tactic.NormNum.OfScientific +import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany +import Mathlib.Tactic.FinCases +import Mathlib.Data.Rat.Cast.Order +import Mathlib.Tactic.NormNum.Abs +import Mathlib.Tactic.NormNum.DivMod +import Mathlib.Tactic.NormNum.OfScientific /-! # Bounded sparse-entry scan — invariant internals -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Sem.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Sem.lean index 1c2ccee3..083ea4da 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Sem.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScan/Internal/Sem.lean @@ -5,11 +5,11 @@ Authors: Samuel Schlesinger -/ module -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryScan.Internal.Ctrl public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryScan.Internal.Inv -public import Complexitylib.Models.TuringMachine.Combinators.WorkBranch +import Complexitylib.Models.TuringMachine.Combinators.WorkBranch public import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryScanStep @@ -19,7 +19,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScanStep.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScanStep.lean index 9963eb67..48a0590e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScanStep.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScanStep.lean @@ -18,7 +18,7 @@ encoded sparse register-store entry. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScanStep/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScanStep/Internal.lean index ace9736b..092b43ff 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScanStep/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryScanStep/Internal.lean @@ -16,7 +16,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate.lean index 29c19216..e92fa360 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate.lean @@ -26,7 +26,7 @@ entry exactly when the address was absent. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/BoundsInternal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/BoundsInternal.lean index 4314f798..88babdd9 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/BoundsInternal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/BoundsInternal.lean @@ -22,7 +22,7 @@ linear in the current entry and the instruction's query/replacement widths. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/End.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/End.lean index d6d37791..53d72e2c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/End.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/End.lean @@ -7,11 +7,11 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Loop -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Out -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Time -public import Complexitylib.Models.TuringMachine.Combinators.WorkBranch +import Complexitylib.Models.TuringMachine.Combinators.WorkBranch /-! # Bounded encoded sparse-store update -- terminal loop case @@ -22,7 +22,7 @@ runs the checked append and result-count successor subroutines. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Hit.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Hit.lean index 8ac5f0af..169525a4 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Hit.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Hit.lean @@ -7,11 +7,11 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Loop -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Out -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Time -public import Complexitylib.Models.TuringMachine.Combinators.WorkBranch +import Complexitylib.Models.TuringMachine.Combinators.WorkBranch /-! # Bounded encoded sparse-store update -- matching iterations @@ -22,7 +22,7 @@ requested address. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Inv.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Inv.lean index 7352bb71..22a44fcd 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Inv.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Inv.lean @@ -9,7 +9,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Ctrl public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryScan.Internal.Inv -public import Complexitylib.Models.TuringMachine.Subroutines.BinarySucc +import Complexitylib.Models.TuringMachine.Subroutines.BinarySucc /-! # Bounded encoded sparse-store update — invariant internals diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Loop.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Loop.lean index 847bd94b..be087ee7 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Loop.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Loop.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Miss.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Miss.lean index dc3dfa61..3faf5b57 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Miss.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Miss.lean @@ -7,19 +7,19 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Loop -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Out -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Time -public import Mathlib.Data.Nat.Bitwise -public import Complexitylib.Models.TuringMachine.Combinators.WorkBranch +import Mathlib.Data.Nat.Bitwise +import Complexitylib.Models.TuringMachine.Combinators.WorkBranch /-! # Bounded encoded sparse-store update -- unmatched entry iteration -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Out.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Out.lean index f0898fbc..55712957 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Out.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Out.lean @@ -11,7 +11,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryMissCopy public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryReplace -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred +import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryMatch /-! @@ -23,7 +23,7 @@ the output head idle, so the complete controller remains a transducer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Sem.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Sem.lean index baeb457b..1f8c8a8d 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Sem.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Sem.lean @@ -7,7 +7,7 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Step -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.End /-! @@ -20,7 +20,7 @@ output needed to connect the concrete controller to `RegisterStore.write`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Step.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Step.lean index fc5271a3..b7c7a550 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Step.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Step.lean @@ -5,7 +5,7 @@ Authors: Samuel Schlesinger -/ module -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Hit public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Internal.Miss @@ -15,7 +15,7 @@ Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryU -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Time.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Time.lean index 7b81aea7..3adae3a8 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Time.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Internal/Time.lean @@ -8,13 +8,13 @@ module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryUpdate.Defs public import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred -public import Complexitylib.Models.TuringMachine.Subroutines.BinarySucc -public import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany -public import Mathlib.Data.Rat.Cast.Order -public import Mathlib.Tactic.FinCases -public import Mathlib.Tactic.NormNum.Abs -public import Mathlib.Tactic.NormNum.DivMod -public import Mathlib.Tactic.NormNum.OfScientific +import Complexitylib.Models.TuringMachine.Subroutines.BinarySucc +import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany +import Mathlib.Data.Rat.Cast.Order +import Mathlib.Tactic.FinCases +import Mathlib.Tactic.NormNum.Abs +import Mathlib.Tactic.NormNum.DivMod +import Mathlib.Tactic.NormNum.OfScientific /-! # Bounded encoded sparse-store update — static runtime bounds @@ -26,7 +26,7 @@ readable match bounds the one cursor whose endpoint is intentionally in-place. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Progress.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Progress.lean index e00fb8b7..99d8ee45 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Progress.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Progress.lean @@ -17,7 +17,7 @@ simulation proof. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Source.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Source.lean index fee96017..a617d165 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Source.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Source.lean @@ -21,7 +21,7 @@ read-only certificate. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Tagged.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Tagged.lean index 75b5bd60..371a01a8 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Tagged.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/Tagged.lean @@ -13,7 +13,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/TaggedProof.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/TaggedProof.lean index 9be8d7ef..1fbd1044 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/TaggedProof.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/EntryUpdate/TaggedProof.lean @@ -15,7 +15,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction.lean index 4cdbbdf1..589abea9 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction.lean @@ -30,7 +30,7 @@ controller. A redirected form writes the new store to a fresh work buffer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Control.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Control.lean index 5e66c041..7449fcf3 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Control.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Control.lean @@ -19,7 +19,7 @@ counter tape. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseControl.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseControl.lean index c471c77e..10ccf968 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseControl.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseControl.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseCtrlSim.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseCtrlSim.lean index a521e5a9..477d1691 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseCtrlSim.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseCtrlSim.lean @@ -17,7 +17,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseDirect.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseDirect.lean index 2bf01f0d..1dfb8810 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseDirect.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseDirect.lean @@ -19,7 +19,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseDispatch.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseDispatch.lean index e471c7fd..472a1ff0 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseDispatch.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseDispatch.lean @@ -16,7 +16,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseImm.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseImm.lean index f1500b7a..c4848893 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseImm.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseImm.lean @@ -17,7 +17,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseLoad.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseLoad.lean index 25e8354c..4d73ff4a 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseLoad.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseLoad.lean @@ -19,7 +19,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseSim.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseSim.lean index 021c3532..e0426709 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseSim.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseSim.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseSimData.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseSimData.lean index 406a3726..766fcfb7 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseSimData.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseSimData.lean @@ -21,7 +21,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseStore.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseStore.lean index 167bc9c4..4612872e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseStore.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/DenseStore.lean @@ -13,7 +13,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Direct.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Direct.lean index 0ffe70b8..c7820f1f 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Direct.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Direct.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Dispatch.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Dispatch.lean index 8f2da708..48e36793 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Dispatch.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Dispatch.lean @@ -25,7 +25,7 @@ execution layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Immediate.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Immediate.lean index 2b64d001..2ca02aed 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Immediate.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Immediate.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Internal.lean index f395a41d..ab1a5d98 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Internal.lean @@ -16,7 +16,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.BinaryShiftMul -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Load.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Load.lean index 7d3ac854..ac51b7e4 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Load.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Load.lean @@ -16,7 +16,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Control.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Control.lean index b6451615..2bb6e096 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Control.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Control.lean @@ -7,15 +7,15 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Instruction.Sim.Defs -public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Instruction -public import Complexitylib.Models.TuringMachine.Subroutines.CopyWorkOutput +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Instruction +import Complexitylib.Models.TuringMachine.Subroutines.CopyWorkOutput /-! # Uniform next-store buffering for control instructions -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Data.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Data.lean index f5c8c70e..d2f5f298 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Data.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Data.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Internal.lean index cdac41b2..462124b3 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Sim/Internal.lean @@ -7,18 +7,18 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Instruction.Sim.Defs -public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore -public import Complexitylib.Models.TuringMachine.Combinators.WorkBranch -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred -public import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore +import Complexitylib.Models.TuringMachine.Combinators.WorkBranch +import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy +import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred +import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany /-! # Fixed-program dispatch -- proof internals -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Store.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Store.lean index 7a883d9d..8353c17c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Store.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Instruction/Store.lean @@ -13,7 +13,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/DenseInternal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/DenseInternal.lean index 39859537..06156f28 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/DenseInternal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/DenseInternal.lean @@ -15,7 +15,7 @@ Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.DenseI -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Assemble.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Assemble.lean index 37062b5d..9ff7e208 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Assemble.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Assemble.lean @@ -5,13 +5,13 @@ Authors: Samuel Schlesinger -/ module -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Lookup.Internal.Prepare -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Lookup.Internal.Restore public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Lookup.Internal.Scan -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Lookup.Internal.Value /-! @@ -19,7 +19,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Bounds.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Bounds.lean index 5fd7cf96..dee2f27d 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Bounds.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Bounds.lean @@ -12,7 +12,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Prepare.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Prepare.lean index 34c915f7..c0279404 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Prepare.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Prepare.lean @@ -6,14 +6,14 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Lookup.Defs -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy +import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy /-! # Reusable sparse-register lookup -- query preparation -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Reset.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Reset.lean index e3acf221..96a46eea 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Reset.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Reset.lean @@ -7,17 +7,17 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Lookup.Internal.Bounds -public import Mathlib.Data.Rat.Cast.Order -public import Mathlib.Tactic.NormNum.Abs -public import Mathlib.Tactic.NormNum.DivMod -public import Mathlib.Tactic.NormNum.OfScientific +import Mathlib.Data.Rat.Cast.Order +import Mathlib.Tactic.NormNum.Abs +import Mathlib.Tactic.NormNum.DivMod +import Mathlib.Tactic.NormNum.OfScientific /-! # Reusable sparse-register lookup -- reset certificates -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Restore.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Restore.lean index e0301bdc..249c3e25 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Restore.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Restore.lean @@ -5,20 +5,20 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany +import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Lookup.Defs -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy -public import Mathlib.Data.Rat.Cast.Order -public import Mathlib.Tactic.NormNum.Abs -public import Mathlib.Tactic.NormNum.DivMod -public import Mathlib.Tactic.NormNum.OfScientific +import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy +import Mathlib.Data.Rat.Cast.Order +import Mathlib.Tactic.NormNum.Abs +import Mathlib.Tactic.NormNum.DivMod +import Mathlib.Tactic.NormNum.OfScientific /-! # Reusable sparse-register lookup -- scanner restoration -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Scan.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Scan.lean index abb5bb36..f2b35cd6 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Scan.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Scan.lean @@ -14,7 +14,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Static.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Static.lean index ecb8900d..498cf77b 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Static.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Static.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.BinaryAddConst -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Value.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Value.lean index bb6eed6c..67539660 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Value.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Lookup/Internal/Value.lean @@ -5,19 +5,19 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy +import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Lookup.Defs -public import Mathlib.Data.Rat.Cast.Order -public import Mathlib.Tactic.NormNum.Abs -public import Mathlib.Tactic.NormNum.DivMod -public import Mathlib.Tactic.NormNum.OfScientific +import Mathlib.Data.Rat.Cast.Order +import Mathlib.Tactic.NormNum.Abs +import Mathlib.Tactic.NormNum.DivMod +import Mathlib.Tactic.NormNum.OfScientific /-! # Reusable sparse-register lookup -- value rewind and copy -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program.lean index a098d0d5..44c3b98d 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program.lean @@ -18,7 +18,7 @@ the selected instruction is `halt`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds.lean index 15c565a5..b32108f4 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds/Defs.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds/Defs.lean index cca9f8f8..e330b03c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds/Defs.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds/Defs.lean @@ -6,8 +6,8 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Defs -public import Mathlib.Tactic.NormNum.Inv -public import Mathlib.Tactic.NormNum.Pow +import Mathlib.Tactic.NormNum.Inv +import Mathlib.Tactic.NormNum.Pow /-! # Sparse RAM decision-machine resource-bound definitions diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds/Internal.lean index a45f8fd6..c3c5be7c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Bounds/Internal.lean @@ -9,7 +9,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Program.Bounds.Defs public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Program.Decision.Defs -public import +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Program.Init.Internal public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Program.Internal @@ -19,7 +19,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Decision.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Decision.lean index 32a9016a..3b35b990 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Decision.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Decision.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DecisionInternal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DecisionInternal.lean index 59ae4405..8e0b4a2c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DecisionInternal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DecisionInternal.lean @@ -17,7 +17,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Dense.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Dense.lean index d95b70f1..ee007168 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Dense.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Dense.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseBounds.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseBounds.lean index 6161421f..b0328fe5 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseBounds.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseBounds.lean @@ -19,7 +19,7 @@ optimized dense-input RAM simulator. -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseBoundsProof.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseBoundsProof.lean index 7fc1603d..7cc5e02e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseBoundsProof.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseBoundsProof.lean @@ -21,7 +21,7 @@ Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Progra -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseDecision.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseDecision.lean index 39784213..897497ca 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseDecision.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseDecision.lean @@ -15,7 +15,7 @@ Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Progra -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseDecisionProof.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseDecisionProof.lean index f39b98d7..e0095b82 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseDecisionProof.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseDecisionProof.lean @@ -17,7 +17,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInit.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInit.lean index e622523e..4cc55144 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInit.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInit.lean @@ -19,7 +19,7 @@ program ABI, and rewinds the input for dense fallback reads. -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInitProof.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInitProof.lean index 82da8850..7d374fb3 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInitProof.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInitProof.lean @@ -18,7 +18,7 @@ public import -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInternal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInternal.lean index 4bdb5787..1cdbe83e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInternal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/DenseInternal.lean @@ -16,7 +16,7 @@ Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Instru -/ -@[expose] public section +public section namespace Complexity namespace RAM diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Init/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Init/Internal.lean index 522243f4..56192a8d 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Init/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Init/Internal.lean @@ -7,23 +7,23 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.Program.Init.Defs -public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryEncode -public import Complexitylib.Models.TuringMachine.Combinators.WorkBranch -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy -public import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred -public import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany -public import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore -public import Mathlib.Data.Rat.Cast.Order -public import Mathlib.Tactic.NormNum.Abs -public import Mathlib.Tactic.NormNum.DivMod -public import Mathlib.Tactic.NormNum.OfScientific +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore.Machine.EntryEncode +import Complexitylib.Models.TuringMachine.Combinators.WorkBranch +import Complexitylib.Models.TuringMachine.Subroutines.BinaryCopy +import Complexitylib.Models.TuringMachine.Subroutines.BinaryPred +import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany +import Complexitylib.Models.RandomAccessMachine.Simulation.RegisterStore +import Mathlib.Data.Rat.Cast.Order +import Mathlib.Tactic.NormNum.Abs +import Mathlib.Tactic.NormNum.DivMod +import Mathlib.Tactic.NormNum.OfScientific /-! # Sparse RAM public-input initialization -- proof internals -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Initialization.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Initialization.lean index ca647f36..c5fb4a0c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Initialization.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Initialization.lean @@ -19,7 +19,7 @@ clean work-tape image consumed by the reusable RAM program controller. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Internal.lean index 79b11cdb..4c1b528a 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/Program/Internal.lean @@ -15,7 +15,7 @@ public import Complexitylib.Models.TuringMachine.Combinators.Internal.Loop -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode.lean index d88e2a3f..be7b2612 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode.lean @@ -23,7 +23,7 @@ natural on a separate work tape. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode/Internal.lean index fd6346c7..cad32919 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode/Internal.lean @@ -27,7 +27,7 @@ cursor and the canonical binary width counter. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode/LinearInternal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode/LinearInternal.lean index 0ac20e4d..e892350e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode/LinearInternal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordDecode/LinearInternal.lean @@ -19,7 +19,7 @@ while copying one payload bit. Each pass is linear in the encoded word width. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordEncode.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordEncode.lean index 40f39910..c2986271 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordEncode.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordEncode.lean @@ -15,7 +15,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordEncode/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordEncode/Internal.lean index 4216c572..efba76ff 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordEncode/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/RegisterStore/Machine/WordEncode/Internal.lean @@ -16,7 +16,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.BinarySucc.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig.lean index d10d09b4..21eee79f 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig.lean @@ -18,7 +18,7 @@ information. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Internal.lean index b4b30511..cd22252b 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Internal.lean @@ -12,7 +12,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse.lean index b5043bf7..33fc678b 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse.lean @@ -17,7 +17,7 @@ input length or running-time bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI.lean index ce0eaf2c..034a4b2a 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI.lean @@ -21,7 +21,7 @@ Boolean verdict in `R₀`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Capture.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Capture.lean index 08b34612..d46aa046 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Capture.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Capture.lean @@ -6,15 +6,15 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.ABI.Defs -public import Mathlib.Tactic.NormNum.Inv -public import Mathlib.Tactic.NormNum.Pow +import Mathlib.Tactic.NormNum.Inv +import Mathlib.Tactic.NormNum.Pow /-! # Capturing raw-input scratch bits in finite control -- proof internals -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Decision.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Decision.lean index 8bd01d4b..2551ee0e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Decision.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Decision.lean @@ -7,8 +7,7 @@ Authors: Samuel Schlesinger module public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.ABI.Internal.Marshal -public import - Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.Step.Internal.Iteration +import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.Step.Internal.Iteration public import Complexitylib.Models.RandomAccessMachine.Structured /-! @@ -16,7 +15,7 @@ public import Complexitylib.Models.RandomAccessMachine.Structured -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Loop.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Loop.lean index 6b675b42..2f8dce6d 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Loop.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Loop.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Spars -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Marshal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Marshal.lean index ed635058..c8ce9a2a 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Marshal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Marshal.lean @@ -5,11 +5,11 @@ Authors: Samuel Schlesinger -/ module -public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.ABI.Internal.Loop -public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.Internal +import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.ABI.Internal.Loop +import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.Internal public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.ABI.Internal.Capture -public import Mathlib.Algebra.Order.Sub.Basic +import Mathlib.Algebra.Order.Sub.Basic /-! # Public-input marshalling correctness -- proof internals diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Resources.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Resources.lean index 00003676..d464d100 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Resources.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/ABI/Internal/Resources.lean @@ -21,7 +21,7 @@ the sparse data region, returning to the core envelope before simulation. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Containment.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Containment.lean index 4a0d5beb..16b74071 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Containment.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Containment.lean @@ -17,7 +17,7 @@ Turing time is therefore contained in polynomial RAM time. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Containment/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Containment/Internal.lean index ee7b909b..83beb1f2 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Containment/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Containment/Internal.lean @@ -18,7 +18,7 @@ forward machine-model robustness theorem. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Internal.lean index e5920c62..5ea24fa0 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Inter -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step.lean index 9837b057..d082a071 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step.lean @@ -23,7 +23,7 @@ public input/output marshalling layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Action.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Action.lean index e089adb0..54b05213 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Action.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Action.lean @@ -14,7 +14,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Dispatch.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Dispatch.lean index 2ce84d0a..a8e2be26 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Dispatch.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Dispatch.lean @@ -5,8 +5,7 @@ Authors: Samuel Schlesinger -/ module -public import - Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.Step.Internal.Action +import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.Step.Internal.Action public import Complexitylib.Models.RandomAccessMachine.Structured.Switch public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Sparse.Step.Internal.Load @@ -15,7 +14,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Spars -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Iteration.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Iteration.lean index ae2a83d8..d3b0d996 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Iteration.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Iteration.lean @@ -13,7 +13,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Layout.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Layout.lean index 000c9362..0fc4dac2 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Layout.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Layout.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Spars -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Load.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Load.lean index 11a9702a..0532fa55 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Load.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Load.lean @@ -13,7 +13,7 @@ public import -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Resources.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Resources.lean index 71747efa..538ca2e0 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Resources.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Sparse/Step/Internal/Resources.lean @@ -18,7 +18,7 @@ measurements into explicit bounds depending only on input length and TM steps. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step.lean index a58f27af..4ffe8172 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step.lean @@ -19,7 +19,7 @@ envelope and compiled-RAM transfer are the next M6 layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Action.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Action.lean index 3ebc7baa..a26c979e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Action.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Action.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Structured.Internal.Resou -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Dispatch.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Dispatch.lean index 00227ede..9d469189 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Dispatch.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Dispatch.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Step. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Layout.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Layout.lean index 8d1fb5da..5ec3702c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Layout.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Layout.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Simulation.TMConfig.Step. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Load.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Load.lean index df89c05f..a5aa106c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Load.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Load.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Structured.Internal.Resou -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Resources.lean b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Resources.lean index 08d33cf8..9bda4f9c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Resources.lean +++ b/Complexitylib/Models/RandomAccessMachine/Simulation/TMConfig/Step/Internal/Resources.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.RandomAccessMachine.Structured.Switch -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Soundness.lean b/Complexitylib/Models/RandomAccessMachine/Soundness.lean index e15957a6..019a33dd 100644 --- a/Complexitylib/Models/RandomAccessMachine/Soundness.lean +++ b/Complexitylib/Models/RandomAccessMachine/Soundness.lean @@ -30,7 +30,7 @@ convention but the boundary between a sound Turing-equivalent model and a -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured.lean b/Complexitylib/Models/RandomAccessMachine/Structured.lean index 7977f91b..988c1a5a 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured.lean @@ -27,7 +27,7 @@ accounting and preserves explicit logarithmic-cost and space envelopes. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/GateEval.lean b/Complexitylib/Models/RandomAccessMachine/Structured/GateEval.lean index cb4e4cf1..d8181950 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/GateEval.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/GateEval.lean @@ -20,7 +20,7 @@ and indirectly appends the result in exactly twenty RAM transitions. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/GateEval/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Structured/GateEval/Internal.lean index 71ce4311..4c3fd18e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/GateEval/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/GateEval/Internal.lean @@ -15,7 +15,7 @@ public import Std.Tactic.BVDecide.Normalize.Bool -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/GateStep.lean b/Complexitylib/Models/RandomAccessMachine/Structured/GateStep.lean index 7335bab1..c7fe4d43 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/GateStep.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/GateStep.lean @@ -19,7 +19,7 @@ memo base at runtime, evaluates the decoded gate, and appends its result. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/GateStep/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Structured/GateStep/Internal.lean index 25e42a35..f0d270be 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/GateStep/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/GateStep/Internal.lean @@ -16,7 +16,7 @@ public import Mathlib.Tactic.IntervalCases -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/GateStreamStep.lean b/Complexitylib/Models/RandomAccessMachine/Structured/GateStreamStep.lean index 11067aaa..414f2f71 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/GateStreamStep.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/GateStreamStep.lean @@ -18,7 +18,7 @@ routine can be invoked again at the returned cursor. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/GateStreamStep/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Structured/GateStreamStep/Internal.lean index 8006097a..5d4f04d3 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/GateStreamStep/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/GateStreamStep/Internal.lean @@ -16,7 +16,7 @@ public import Mathlib.Tactic.IntervalCases -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/Hamming.lean b/Complexitylib/Models/RandomAccessMachine/Structured/Hamming.lean index dbd1c7b3..a65d65e1 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/Hamming.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/Hamming.lean @@ -22,7 +22,7 @@ quasilinear asymptotic corollaries. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/Hamming/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Structured/Hamming/Internal.lean index 1ad5a5c2..2d588073 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/Hamming/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/Hamming/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Structured.Internal.Resou -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Structured/Internal.lean index 295a2373..843da64f 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/Internal.lean @@ -18,7 +18,7 @@ semantics exactly: final registers, logarithmic cost, and peak register space. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/LastBit.lean b/Complexitylib/Models/RandomAccessMachine/Structured/LastBit.lean index 2dbed364..7f27c5da 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/LastBit.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/LastBit.lean @@ -18,7 +18,7 @@ and resource bounds. This module adds only agreement with the existing -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/PairValidate.lean b/Complexitylib/Models/RandomAccessMachine/Structured/PairValidate.lean index cb52f003..2d733a0e 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/PairValidate.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/PairValidate.lean @@ -20,7 +20,7 @@ correctness theorem for the canonical pair-encoding language. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/PairValidate/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Structured/PairValidate/Internal.lean index 900fd683..3ac0f76b 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/PairValidate/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/PairValidate/Internal.lean @@ -16,7 +16,7 @@ execution, correctness, and resource proofs are all in the generic scanner layer -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/Scanner.lean b/Complexitylib/Models/RandomAccessMachine/Structured/Scanner.lean index 81b26d5b..d1009409 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/Scanner.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/Scanner.lean @@ -20,7 +20,7 @@ the concrete compiled RAM. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/Scanner/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Structured/Scanner/Internal.lean index ad12dc90..f64c60dc 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/Scanner/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/Scanner/Internal.lean @@ -14,7 +14,7 @@ public import Std.Tactic.BVDecide.Normalize.BitVec -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/Switch.lean b/Complexitylib/Models/RandomAccessMachine/Structured/Switch.lean index bb3100f5..c2cf6f5c 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/Switch.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/Switch.lean @@ -16,7 +16,7 @@ logarithmic-cost and peak-space bounds for a finite numeric switch. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/Switch/Compiled.lean b/Complexitylib/Models/RandomAccessMachine/Structured/Switch/Compiled.lean index edf3b137..5ddad5e0 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/Switch/Compiled.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/Switch/Compiled.lean @@ -12,7 +12,7 @@ public import Complexitylib.Models.RandomAccessMachine.Structured -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/Switch/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Structured/Switch/Internal.lean index 31972d57..f62a6a3a 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/Switch/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/Switch/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Structured.Switch.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/ThreeSATSyntax.lean b/Complexitylib/Models/RandomAccessMachine/Structured/ThreeSATSyntax.lean index 96f646eb..2bd4f2df 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/ThreeSATSyntax.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/ThreeSATSyntax.lean @@ -16,7 +16,7 @@ resource analysis for the existing 27-state `SAT.ThreeSAT.Syntax` automaton. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/UnaryDecode.lean b/Complexitylib/Models/RandomAccessMachine/Structured/UnaryDecode.lean index 5f712847..1e0e1b38 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/UnaryDecode.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/UnaryDecode.lean @@ -20,7 +20,7 @@ logarithmic cost, peak space, decoded value, and suffix cursor. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RandomAccessMachine/Structured/UnaryDecode/Internal.lean b/Complexitylib/Models/RandomAccessMachine/Structured/UnaryDecode/Internal.lean index a0214a31..b2769341 100644 --- a/Complexitylib/Models/RandomAccessMachine/Structured/UnaryDecode/Internal.lean +++ b/Complexitylib/Models/RandomAccessMachine/Structured/UnaryDecode/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.RandomAccessMachine.Structured.UnaryDecode.De -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RoseTreeMachine/Data.lean b/Complexitylib/Models/RoseTreeMachine/Data.lean index 6fb2959b..6e2faed0 100644 --- a/Complexitylib/Models/RoseTreeMachine/Data.lean +++ b/Complexitylib/Models/RoseTreeMachine/Data.lean @@ -28,7 +28,7 @@ This file contains the main internal data structure for the RTM, `Data`, a rose -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/RoseTreeMachine/DataEncode.lean b/Complexitylib/Models/RoseTreeMachine/DataEncode.lean index 91bcf703..d2409157 100644 --- a/Complexitylib/Models/RoseTreeMachine/DataEncode.lean +++ b/Complexitylib/Models/RoseTreeMachine/DataEncode.lean @@ -21,7 +21,7 @@ and `ℕ` (binary encoding via `List Bool`) -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/ForBinaryWork.lean b/Complexitylib/Models/TuringMachine/Combinators/ForBinaryWork.lean index 436117ea..2634bd49 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/ForBinaryWork.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/ForBinaryWork.lean @@ -26,7 +26,7 @@ for bitwise algorithms without iterating over the represented numeric value. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/ForInput.lean b/Complexitylib/Models/TuringMachine/Combinators/ForInput.lean index 61c145b7..9e959767 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/ForInput.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/ForInput.lean @@ -25,7 +25,7 @@ counterpart of the unary-work-register loop `TM.forRegTM`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/ForWorkOnes.lean b/Complexitylib/Models/TuringMachine/Combinators/ForWorkOnes.lean index 684147ba..f3c5eeb8 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/ForWorkOnes.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/ForWorkOnes.lean @@ -24,7 +24,7 @@ the RAM snapshot word decoder. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/Internal/Scanner.lean b/Complexitylib/Models/TuringMachine/Combinators/Internal/Scanner.lean index 5293748e..d863428a 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/Internal/Scanner.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/Internal/Scanner.lean @@ -24,7 +24,7 @@ Proofs that `TM.scannerTM` correctly implements a left-to-right fold with -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/Internal/Union.lean b/Complexitylib/Models/TuringMachine/Combinators/Internal/Union.lean index a747c691..d25f28d1 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/Internal/Union.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/Internal/Union.lean @@ -35,7 +35,7 @@ The proof proceeds in three phases: -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/RetargetCompute.lean b/Complexitylib/Models/TuringMachine/Combinators/RetargetCompute.lean index 4711812c..ab935f35 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/RetargetCompute.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/RetargetCompute.lean @@ -31,7 +31,7 @@ positive advertised time bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/RetargetCompute/Internal.lean b/Complexitylib/Models/TuringMachine/Combinators/RetargetCompute/Internal.lean index 9ccaf0ad..966f0c0d 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/RetargetCompute/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/RetargetCompute/Internal.lean @@ -19,7 +19,7 @@ therefore halts immediately on its parked blank output tape. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/WorkBranch.lean b/Complexitylib/Models/TuringMachine/Combinators/WorkBranch.lean index a2457e4e..071538d7 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/WorkBranch.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/WorkBranch.lean @@ -33,7 +33,7 @@ heads reading `▷` must move right. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/WorkSymbolBranch.lean b/Complexitylib/Models/TuringMachine/Combinators/WorkSymbolBranch.lean index c82f1b4a..2d087c65 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/WorkSymbolBranch.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/WorkSymbolBranch.lean @@ -18,7 +18,7 @@ branch on the readable sparse-entry equality flag. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Combinators/WorkSymbolBranch/Internal.lean b/Complexitylib/Models/TuringMachine/Combinators/WorkSymbolBranch/Internal.lean index ed808acf..df1dba7f 100644 --- a/Complexitylib/Models/TuringMachine/Combinators/WorkSymbolBranch/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Combinators/WorkSymbolBranch/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.TuringMachine.Combinators.WorkSymbolBranch.De -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Composition.lean b/Complexitylib/Models/TuringMachine/Composition.lean index 852f4cdd..042dd906 100644 --- a/Complexitylib/Models/TuringMachine/Composition.lean +++ b/Complexitylib/Models/TuringMachine/Composition.lean @@ -24,7 +24,7 @@ first delimiter. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Composition/Internal.lean b/Complexitylib/Models/TuringMachine/Composition/Internal.lean index 42bb0b9c..83a2271f 100644 --- a/Complexitylib/Models/TuringMachine/Composition/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Composition/Internal.lean @@ -18,7 +18,7 @@ both function composition and preprocessing followed by a language decider. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Composition/Internal/FirstPhase.lean b/Complexitylib/Models/TuringMachine/Composition/Internal/FirstPhase.lean index 3cfaebef..3d852ad2 100644 --- a/Complexitylib/Models/TuringMachine/Composition/Internal/FirstPhase.lean +++ b/Complexitylib/Models/TuringMachine/Composition/Internal/FirstPhase.lean @@ -19,7 +19,7 @@ exact tape facts required by the normalization tail. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Composition/PairWithInput.lean b/Complexitylib/Models/TuringMachine/Composition/PairWithInput.lean index 7ce3a051..9475e15a 100644 --- a/Complexitylib/Models/TuringMachine/Composition/PairWithInput.lean +++ b/Complexitylib/Models/TuringMachine/Composition/PairWithInput.lean @@ -21,7 +21,7 @@ retaining a concrete polynomial-preserving time bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Composition/PairWithInput/Internal.lean b/Complexitylib/Models/TuringMachine/Composition/PairWithInput/Internal.lean index 5b982125..06dc9f9a 100644 --- a/Complexitylib/Models/TuringMachine/Composition/PairWithInput/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Composition/PairWithInput/Internal.lean @@ -19,7 +19,7 @@ This module verifies the generic fanout pipeline defined in -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine.lean index 26553ed3..f38e8a45 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine.lean @@ -35,7 +35,7 @@ this initial layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Arithmetic.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Arithmetic.lean index 375e47da..d25e7546 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Arithmetic.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Arithmetic.lean @@ -25,7 +25,7 @@ word, time bound, and all-prefix space bound to its concrete Turing machine. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Arithmetic/Internal.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Arithmetic/Internal.lean index dc283e46..08e2addb 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Arithmetic/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Arithmetic/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.BinaryPolynomial -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Control.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Control.lean index 60cd3ef3..087676a7 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Control.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Control.lean @@ -29,7 +29,7 @@ Thus many iterations can retain logarithmic auxiliary space. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Control/Internal.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Control/Internal.lean index c7552b9b..e4ecfa06 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Control/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Control/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.Cont -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/InputLength.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/InputLength.lean index 5f14db02..10214d9d 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/InputLength.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/InputLength.lean @@ -23,7 +23,7 @@ the resulting routine inherits a total all-prefix `ComputesInSpace` contract. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/InputLength/Internal.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/InputLength/Internal.lean index f614463b..76e11d55 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/InputLength/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/InputLength/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.BinaryLength -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Internal.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Internal.lean index 69f680b8..e234b3cc 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/Internal.lean @@ -19,7 +19,7 @@ accumulator, and composes routines across the parked `seqTM` phase boundary. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/List.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/List.lean index 8775f464..bbe77f9b 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/List.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/List.lean @@ -17,7 +17,7 @@ leaving only genuinely input-dependent ranges to the binary loop adapter. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/List/Internal.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/List/Internal.lean index a699f570..d3ef6cd6 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/List/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/List/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.TuringMachine.Experimental.BinaryRoutine.List -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/SpaceBounds.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/SpaceBounds.lean index a0bb175e..f01f3883 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/SpaceBounds.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/SpaceBounds.lean @@ -20,7 +20,7 @@ composed certificate to logarithmic space. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/SpaceBounds/Internal.lean b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/SpaceBounds/Internal.lean index 0f04ed1c..c02c847f 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/SpaceBounds/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/BinaryRoutine/SpaceBounds/Internal.lean @@ -15,7 +15,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.BinaryRippleAdd -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/EmitSpec.lean b/Complexitylib/Models/TuringMachine/Experimental/EmitSpec.lean index 7a51ddac..13afad7b 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/EmitSpec.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/EmitSpec.lean @@ -27,7 +27,7 @@ short heterogeneous machine trees and retains each stage's structural bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/Routine.lean b/Complexitylib/Models/TuringMachine/Experimental/Routine.lean index 5b645b72..b812e334 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/Routine.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/Routine.lean @@ -30,7 +30,7 @@ experimental until a second independent construction validates the interface. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Experimental/Routine/Internal.lean b/Complexitylib/Models/TuringMachine/Experimental/Routine/Internal.lean index c8163f5b..27cafd3a 100644 --- a/Complexitylib/Models/TuringMachine/Experimental/Routine/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Experimental/Routine/Internal.lean @@ -17,7 +17,7 @@ preserved by lowering through sequential composition and read-only-input loops. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Hoare/RetargetOutput.lean b/Complexitylib/Models/TuringMachine/Hoare/RetargetOutput.lean index 89044b19..2cd2dcb6 100644 --- a/Complexitylib/Models/TuringMachine/Hoare/RetargetOutput.lean +++ b/Complexitylib/Models/TuringMachine/Hoare/RetargetOutput.lean @@ -17,7 +17,7 @@ standard parked blank tape. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Hoare/Space.lean b/Complexitylib/Models/TuringMachine/Hoare/Space.lean index 1d15c420..c764ed61 100644 --- a/Complexitylib/Models/TuringMachine/Hoare/Space.lean +++ b/Complexitylib/Models/TuringMachine/Hoare/Space.lean @@ -31,7 +31,7 @@ closure, and a fresh-start computation bridge. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Hoare/Space/Internal.lean b/Complexitylib/Models/TuringMachine/Hoare/Space/Internal.lean index 04f23f9a..347fe675 100644 --- a/Complexitylib/Models/TuringMachine/Hoare/Space/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Hoare/Space/Internal.lean @@ -17,7 +17,7 @@ from fresh-start contracts to `TM.ComputesInSpace`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Internal.lean b/Complexitylib/Models/TuringMachine/Internal.lean index 064f7ec5..f60c415e 100644 --- a/Complexitylib/Models/TuringMachine/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Internal.lean @@ -16,7 +16,7 @@ and the NTM trace on `toNTM` compute the same thing. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Internal/OutputBounds.lean b/Complexitylib/Models/TuringMachine/Internal/OutputBounds.lean index 6dba8aeb..fceabfe6 100644 --- a/Complexitylib/Models/TuringMachine/Internal/OutputBounds.lean +++ b/Complexitylib/Models/TuringMachine/Internal/OutputBounds.lean @@ -19,7 +19,7 @@ Public statements are in `Complexitylib.Models.TuringMachine.OutputBounds`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/OutputBounds.lean b/Complexitylib/Models/TuringMachine/OutputBounds.lean index 6ffd244f..7398ae6c 100644 --- a/Complexitylib/Models/TuringMachine/OutputBounds.lean +++ b/Complexitylib/Models/TuringMachine/OutputBounds.lean @@ -22,7 +22,7 @@ produce at most `t` output bits. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Placement.lean b/Complexitylib/Models/TuringMachine/Placement.lean index 82957fea..9fc18382 100644 --- a/Complexitylib/Models/TuringMachine/Placement.lean +++ b/Complexitylib/Models/TuringMachine/Placement.lean @@ -25,7 +25,7 @@ are parked away from the left-end marker. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Placement/Internal.lean b/Complexitylib/Models/TuringMachine/Placement/Internal.lean index d31220f9..d21b15fe 100644 --- a/Complexitylib/Models/TuringMachine/Placement/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Placement/Internal.lean @@ -17,7 +17,7 @@ parked frame are fixed points of that action. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Registers/DecReg.lean b/Complexitylib/Models/TuringMachine/Registers/DecReg.lean index 780e8222..1bacb23d 100644 --- a/Complexitylib/Models/TuringMachine/Registers/DecReg.lean +++ b/Complexitylib/Models/TuringMachine/Registers/DecReg.lean @@ -25,7 +25,7 @@ Mirror of `incRegTM` (`RegisterOps.lean`) with an erase phase. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Registers/InputLen.lean b/Complexitylib/Models/TuringMachine/Registers/InputLen.lean index 9a21d23b..4b42965c 100644 --- a/Complexitylib/Models/TuringMachine/Registers/InputLen.lean +++ b/Complexitylib/Models/TuringMachine/Registers/InputLen.lean @@ -19,7 +19,7 @@ campaign (`docs/A5-ReductionEmitter.md`). -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Registers/Probe.lean b/Complexitylib/Models/TuringMachine/Registers/Probe.lean index e80b5b13..9f2f7255 100644 --- a/Complexitylib/Models/TuringMachine/Registers/Probe.lean +++ b/Complexitylib/Models/TuringMachine/Registers/Probe.lean @@ -27,7 +27,7 @@ read off the input tape position by position. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Repetition.lean b/Complexitylib/Models/TuringMachine/Repetition.lean index 833e9bbd..ab4dbe21 100644 --- a/Complexitylib/Models/TuringMachine/Repetition.lean +++ b/Complexitylib/Models/TuringMachine/Repetition.lean @@ -25,7 +25,7 @@ simulation invariants proved in the internal correctness layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Repetition/Correctness.lean b/Complexitylib/Models/TuringMachine/Repetition/Correctness.lean index 01ec9a32..3ea252ad 100644 --- a/Complexitylib/Models/TuringMachine/Repetition/Correctness.lean +++ b/Complexitylib/Models/TuringMachine/Repetition/Correctness.lean @@ -29,7 +29,7 @@ The source machine need only halt on every `T`-step path for the fixed input. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Repetition/Internal/Correctness.lean b/Complexitylib/Models/TuringMachine/Repetition/Internal/Correctness.lean index 6b68bc5e..68358f0f 100644 --- a/Complexitylib/Models/TuringMachine/Repetition/Internal/Correctness.lean +++ b/Complexitylib/Models/TuringMachine/Repetition/Internal/Correctness.lean @@ -25,7 +25,7 @@ and the final trial writes their strict majority. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Repetition/Internal/Finish.lean b/Complexitylib/Models/TuringMachine/Repetition/Internal/Finish.lean index 22e1111b..7222e83a 100644 --- a/Complexitylib/Models/TuringMachine/Repetition/Internal/Finish.lean +++ b/Complexitylib/Models/TuringMachine/Repetition/Internal/Finish.lean @@ -15,7 +15,7 @@ transition of `NTM.repeatAtTime`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Repetition/Internal/ScheduleArithmetic.lean b/Complexitylib/Models/TuringMachine/Repetition/Internal/ScheduleArithmetic.lean index c12ab098..a04ebfec 100644 --- a/Complexitylib/Models/TuringMachine/Repetition/Internal/ScheduleArithmetic.lean +++ b/Complexitylib/Models/TuringMachine/Repetition/Internal/ScheduleArithmetic.lean @@ -17,7 +17,7 @@ depending on `Complexitylib.Models.TuringMachine.Repetition`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Repetition/Internal/Setup.lean b/Complexitylib/Models/TuringMachine/Repetition/Internal/Setup.lean index 4f7e1496..c91969ef 100644 --- a/Complexitylib/Models/TuringMachine/Repetition/Internal/Setup.lean +++ b/Complexitylib/Models/TuringMachine/Repetition/Internal/Setup.lean @@ -23,7 +23,7 @@ machine, whose setup immediately halts with the empty majority verdict. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Repetition/Internal/VoteStep.lean b/Complexitylib/Models/TuringMachine/Repetition/Internal/VoteStep.lean index b8b60782..ffc5b1e1 100644 --- a/Complexitylib/Models/TuringMachine/Repetition/Internal/VoteStep.lean +++ b/Complexitylib/Models/TuringMachine/Repetition/Internal/VoteStep.lean @@ -26,7 +26,7 @@ source configuration, and specializes the final finish theorem to `repeatVotes`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Repetition/Validation.lean b/Complexitylib/Models/TuringMachine/Repetition/Validation.lean index 6a376243..a87d2e55 100644 --- a/Complexitylib/Models/TuringMachine/Repetition/Validation.lean +++ b/Complexitylib/Models/TuringMachine/Repetition/Validation.lean @@ -18,7 +18,7 @@ final majority verdict. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/SingleTape/Validation.lean b/Complexitylib/Models/TuringMachine/SingleTape/Validation.lean index c7b66b04..dd921c19 100644 --- a/Complexitylib/Models/TuringMachine/SingleTape/Validation.lean +++ b/Complexitylib/Models/TuringMachine/SingleTape/Validation.lean @@ -30,7 +30,7 @@ materialization, distant writes read back, and `k = 2` tape interleaving. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/SpaceTime.lean b/Complexitylib/Models/TuringMachine/SpaceTime.lean index 1facb362..0dcd61d9 100644 --- a/Complexitylib/Models/TuringMachine/SpaceTime.lean +++ b/Complexitylib/Models/TuringMachine/SpaceTime.lean @@ -25,7 +25,7 @@ explicit time bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Observation.lean b/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Observation.lean index dc8560af..c7fc27b5 100644 --- a/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Observation.lean +++ b/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Observation.lean @@ -19,7 +19,7 @@ remain inside the observed window. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Reachability.lean b/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Reachability.lean index 04fff43d..fe88b5a5 100644 --- a/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Reachability.lean +++ b/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Reachability.lean @@ -16,7 +16,7 @@ execution choices to the machine model. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/SpaceTime/Internal/RunBound.lean b/Complexitylib/Models/TuringMachine/SpaceTime/Internal/RunBound.lean index 9bee0645..46fbc27a 100644 --- a/Complexitylib/Models/TuringMachine/SpaceTime/Internal/RunBound.lean +++ b/Complexitylib/Models/TuringMachine/SpaceTime/Internal/RunBound.lean @@ -18,7 +18,7 @@ type. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Snapshot.lean b/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Snapshot.lean index dc1c1dae..64428d45 100644 --- a/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Snapshot.lean +++ b/Complexitylib/Models/TuringMachine/SpaceTime/Internal/Snapshot.lean @@ -18,7 +18,7 @@ contents are fixed. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryAdd.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryAdd.lean index 72991b4e..7476ebd7 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryAdd.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryAdd.lean @@ -29,7 +29,7 @@ width-based rather than derived from total loop runtime. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryAddConst.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryAddConst.lean index 4f3c451c..367a7be4 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryAddConst.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryAddConst.lean @@ -23,7 +23,7 @@ sequence of binary successors compiled from a hardwired natural constant. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryCopy.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryCopy.lean index 97776971..7e4b5893 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryCopy.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryCopy.lean @@ -24,7 +24,7 @@ destination becomes an exact copy, and the zero scratch is restored literally. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryEq.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryEq.lean index 78d33dce..e6f178fb 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryEq.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryEq.lean @@ -16,7 +16,7 @@ binary equality routine used by RAM register-store scans. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryEq/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryEq/Internal.lean index fac4df2d..25d31684 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryEq/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryEq/Internal.lean @@ -15,7 +15,7 @@ public import Std.Tactic.BVDecide.Normalize.BitVec -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor.lean index 00eb6d95..2ea9cef0 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor.lean @@ -33,7 +33,7 @@ limit, or tape frames. Clients record those endpoint facts in -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor/Internal/Comparison.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor/Internal/Comparison.lean index 590bf519..c42eb3de 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor/Internal/Comparison.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor/Internal/Comparison.lean @@ -22,7 +22,7 @@ iteration precisely below the limit, or to `done` precisely at equality. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor/Internal/Loop.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor/Internal/Loop.lean index ff6c99ee..3a2b5cf9 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor/Internal/Loop.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryFor/Internal/Loop.lean @@ -18,7 +18,7 @@ body. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryLength.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryLength.lean index a369be91..7e2a3a1f 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryLength.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryLength.lean @@ -31,7 +31,7 @@ reuses the local successor bound at each iteration and is formally `O(log n)`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryLength/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryLength/Internal.lean index 21301bc6..7fe3733b 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryLength/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryLength/Internal.lean @@ -20,7 +20,7 @@ reachable driver/body phase so input length is never charged as work space. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryMulAdd.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryMulAdd.lean index 173f13a4..48733c88 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryMulAdd.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryMulAdd.lean @@ -24,7 +24,7 @@ zero. The resource contract gives a width-based all-prefix space bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryPolynomial.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryPolynomial.lean index d5b27e8b..caeb81fe 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryPolynomial.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryPolynomial.lean @@ -27,7 +27,7 @@ not runtime, and is logarithmic in the input value for every fixed polynomial. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryPred.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryPred.lean index a22ef1c0..aefe4533 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryPred.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryPred.lean @@ -30,7 +30,7 @@ represent `value + 1`; they make no underflow claim. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryPred/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryPred/Internal.lean index e5deafaa..1f40aca9 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryPred/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryPred/Internal.lean @@ -22,7 +22,7 @@ high-bit erasure needed when decrementing a power of two. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd.lean index e60e125c..3b95a2c0 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd.lean @@ -22,7 +22,7 @@ machine instead. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Bounds.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Bounds.lean index ba0bd0a1..ec0d00f2 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Bounds.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Bounds.lean @@ -16,7 +16,7 @@ standard binary widths of the two operands. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Out.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Out.lean index 992ccbe4..b992e1d1 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Out.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Out.lean @@ -17,7 +17,7 @@ computation. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Pure.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Pure.lean index c9951057..a79fcb82 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Pure.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Pure.lean @@ -18,7 +18,7 @@ incoming carry so that its induction follows the recurrence exactly. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Scan.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Scan.lean index 2c76d21f..20ce1a5a 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Scan.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleAdd/Internal/Scan.lean @@ -18,7 +18,7 @@ later internal layers. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub.lean index fba6b78a..e06f1d11 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub.lean @@ -20,7 +20,7 @@ the operand bit widths. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Backward.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Backward.lean index d3b06706..9403e538 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Backward.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Backward.lean @@ -21,7 +21,7 @@ literally throughout the run. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Out.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Out.lean index 3a4cf52e..3b63f36c 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Out.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Out.lean @@ -16,7 +16,7 @@ tape one-way, so the core and complete machines are safe transducers. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Pure.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Pure.lean index e740753e..5d066284 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Pure.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Pure.lean @@ -19,7 +19,7 @@ canonical `Nat.bits` representation of the raw fixed-width value. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Scan.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Scan.lean index ac063b96..b548c1ea 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Scan.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryRippleSub/Internal/Scan.lean @@ -21,7 +21,7 @@ separate internal layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul.lean index 9b01c2d9..b08f58e7 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul.lean @@ -21,7 +21,7 @@ in the combined operand width. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul/Internal/Out.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul/Internal/Out.lean index 0b110116..d0cd4763 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul/Internal/Out.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul/Internal/Out.lean @@ -18,7 +18,7 @@ This file composes the transducer certificates of every multiplication phase. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul/Internal/Pure.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul/Internal/Pure.lean index fffc5d54..352b9c41 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul/Internal/Pure.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinaryShiftMul/Internal/Pure.lean @@ -18,7 +18,7 @@ every partial accumulator and shifted multiplicand. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinarySucc.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinarySucc.lean index 157df0b3..5bc8a541 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinarySucc.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinarySucc.lean @@ -27,7 +27,7 @@ tape to cell one. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/BinarySucc/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/BinarySucc/Internal.lean index e26ea8a5..04ffaad6 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/BinarySucc/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/BinarySucc/Internal.lean @@ -18,7 +18,7 @@ content predicate, generalized over the already-zeroed low-order prefix. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/ClearWork.lean b/Complexitylib/Models/TuringMachine/Subroutines/ClearWork.lean index a2ec06fb..485b8306 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/ClearWork.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/ClearWork.lean @@ -23,7 +23,7 @@ discipline of the clearing, rewinding, and composite machines. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/ClearWork/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/ClearWork/Internal.lean index a45e9bf0..118e1b80 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/ClearWork/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/ClearWork/Internal.lean @@ -19,7 +19,7 @@ left. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/CopyOutput.lean b/Complexitylib/Models/TuringMachine/Subroutines/CopyOutput.lean index 5ba68eae..4ae69564 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/CopyOutput.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/CopyOutput.lean @@ -22,7 +22,7 @@ its Boolean input verbatim to its output tape in the exact linear bound -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/CopyWorkOutput.lean b/Complexitylib/Models/TuringMachine/Subroutines/CopyWorkOutput.lean index 4f40f4d3..44ebd42a 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/CopyWorkOutput.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/CopyWorkOutput.lean @@ -22,7 +22,7 @@ junk. The fresh destination receives a canonical `Tape.HasBinaryPrefix`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/Internal.lean index 15a19ffb..9e8f75d6 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/Internal.lean @@ -39,7 +39,7 @@ an arbitrary predicate `P` on the untouched tapes through the run. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/Internal/CopyOutput.lean b/Complexitylib/Models/TuringMachine/Subroutines/Internal/CopyOutput.lean index 93b89028..39c898ff 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/Internal/CopyOutput.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/Internal/CopyOutput.lean @@ -22,7 +22,7 @@ The public theorem is stated in -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/Internal/CopyWorkOutput.lean b/Complexitylib/Models/TuringMachine/Subroutines/Internal/CopyWorkOutput.lean index 89335ce6..e04f1d36 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/Internal/CopyWorkOutput.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/Internal/CopyWorkOutput.lean @@ -23,7 +23,7 @@ Public statements are in -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/Internal/ScanRight.lean b/Complexitylib/Models/TuringMachine/Subroutines/Internal/ScanRight.lean index 21aa23ac..02518d97 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/Internal/ScanRight.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/Internal/ScanRight.lean @@ -23,7 +23,7 @@ The public compositional theorem is stated in -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/PairEmit.lean b/Complexitylib/Models/TuringMachine/Subroutines/PairEmit.lean index f0a8c8ab..1c1a90c6 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/PairEmit.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/PairEmit.lean @@ -22,7 +22,7 @@ second component. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/PairEmit/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/PairEmit/Internal.lean index 287298a8..65e81e00 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/PairEmit/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/PairEmit/Internal.lean @@ -18,7 +18,7 @@ This module verifies the exact two-pass controller in `PairEmit.Defs`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/PairSplit.lean b/Complexitylib/Models/TuringMachine/Subroutines/PairSplit.lean index cb9f8d7d..5184e0b5 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/PairSplit.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/PairSplit.lean @@ -37,7 +37,7 @@ with a distinct failure result. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/PairSplit/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/PairSplit/Internal.lean index a831a9a7..ba8a14bd 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/PairSplit/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/PairSplit/Internal.lean @@ -21,7 +21,7 @@ This file proves the stepwise decoding and exact-time correctness facts for -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/PairValidate.lean b/Complexitylib/Models/TuringMachine/Subroutines/PairValidate.lean index ad8a36ea..579817bb 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/PairValidate.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/PairValidate.lean @@ -23,7 +23,7 @@ the two decoded components. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/PairValidate/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/PairValidate/Internal.lean index 3f222920..30db1961 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/PairValidate/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/PairValidate/Internal.lean @@ -18,7 +18,7 @@ correctness theorem supplies the executable machine proof and exact time bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/ResetBinary.lean b/Complexitylib/Models/TuringMachine/Subroutines/ResetBinary.lean index 8e35f8dd..b92c233d 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/ResetBinary.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/ResetBinary.lean @@ -17,7 +17,7 @@ arbitrary canonical binary cursor and clearing it to the standard blank tape. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/ResetBinary/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/ResetBinary/Internal.lean index cde4e27c..714a090b 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/ResetBinary/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/ResetBinary/Internal.lean @@ -14,7 +14,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.ResetBinary.Defs -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/ResetBinaryMany.lean b/Complexitylib/Models/TuringMachine/Subroutines/ResetBinaryMany.lean index baec41a7..d8f153ca 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/ResetBinaryMany.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/ResetBinaryMany.lean @@ -16,7 +16,7 @@ of distinct canonical binary work tapes. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/ResetBinaryMany/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/ResetBinaryMany/Internal.lean index f0a1b384..7c30f778 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/ResetBinaryMany/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/ResetBinaryMany/Internal.lean @@ -13,7 +13,7 @@ public import Complexitylib.Models.TuringMachine.Subroutines.ResetBinaryMany.Def -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/ScanRight.lean b/Complexitylib/Models/TuringMachine/Subroutines/ScanRight.lean index fc1c62bb..cf611fc3 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/ScanRight.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/ScanRight.lean @@ -24,7 +24,7 @@ first blank. Every stable tape outside that target is preserved exactly. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/UnaryLength.lean b/Complexitylib/Models/TuringMachine/Subroutines/UnaryLength.lean index 7eea7bff..543c6658 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/UnaryLength.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/UnaryLength.lean @@ -21,7 +21,7 @@ emits `List.replicate x.length true` within the linear bound `|x| + 2`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Subroutines/UnaryLength/Internal.lean b/Complexitylib/Models/TuringMachine/Subroutines/UnaryLength/Internal.lean index f625404d..5521a7fe 100644 --- a/Complexitylib/Models/TuringMachine/Subroutines/UnaryLength/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Subroutines/UnaryLength/Internal.lean @@ -19,7 +19,7 @@ exactly `|x| + 2` transitions. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Trace.lean b/Complexitylib/Models/TuringMachine/Trace.lean index 734f06a0..f9e0bfdd 100644 --- a/Complexitylib/Models/TuringMachine/Trace.lean +++ b/Complexitylib/Models/TuringMachine/Trace.lean @@ -21,7 +21,7 @@ dependent `Fin` casts into fixed-schedule simulation proofs. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/Trace/Internal.lean b/Complexitylib/Models/TuringMachine/Trace/Internal.lean index f28b1037..8fed659a 100644 --- a/Complexitylib/Models/TuringMachine/Trace/Internal.lean +++ b/Complexitylib/Models/TuringMachine/Trace/Internal.lean @@ -14,7 +14,7 @@ Proofs for the public finite-trace decomposition rules. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Diagonal.lean b/Complexitylib/Models/TuringMachine/UTM/Diagonal.lean index 46cb7f4c..10b44cfc 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Diagonal.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Diagonal.lean @@ -63,7 +63,7 @@ Two landed specs do not quite fit and are bridged locally: -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/HierarchySupport.lean b/Complexitylib/Models/TuringMachine/UTM/HierarchySupport.lean index 3ad12c86..7672735e 100644 --- a/Complexitylib/Models/TuringMachine/UTM/HierarchySupport.lean +++ b/Complexitylib/Models/TuringMachine/UTM/HierarchySupport.lean @@ -24,7 +24,7 @@ Four self-contained ingredients used by the diagonalization argument: -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyApply.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyApply.lean index 1e26840a..aeb5e187 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyApply.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyApply.lean @@ -31,7 +31,7 @@ decoders to the description decoders in `Desc.lean`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyAssembly.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyAssembly.lean index 8594df23..45b01b67 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyAssembly.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyAssembly.lean @@ -23,7 +23,7 @@ running one brings it to the peek phase with all tapes restored. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyInternal.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyInternal.lean index f101726b..5d9901b3 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyInternal.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyInternal.lean @@ -19,7 +19,7 @@ write-backs — in closed form. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyLoop.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyLoop.lean index ff607c99..71fdb1bf 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyLoop.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyLoop.lean @@ -43,7 +43,7 @@ which has just read the next region's head symbol and found it non-`□`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyMatch.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyMatch.lean index 265b898d..a7a37672 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/BodyMatch.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/BodyMatch.lean @@ -23,7 +23,7 @@ as an update-on-an-interval of the ghost cells (as in `dfCopy_loop`). -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/ClockFrontier.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/ClockFrontier.lean index 951997eb..87e2099d 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/ClockFrontier.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/ClockFrontier.lean @@ -36,7 +36,7 @@ Two `TM 7` machines, both with ghost-initial-tapes `HoareTime` specs: -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/DescLayout.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/DescLayout.lean index 5752fdd4..ab8b8bdb 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/DescLayout.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/DescLayout.lean @@ -25,7 +25,7 @@ head at the entry region) and the match loop (entry-region cells). -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/Extract.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/Extract.lean index eeac413a..84413b1b 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/Extract.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/Extract.lean @@ -44,7 +44,7 @@ unchanged (only its head moves). -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/HaltTest.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/HaltTest.lean index 5ffaa18a..f9a0d55d 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/HaltTest.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/HaltTest.lean @@ -50,7 +50,7 @@ state tape holds bit symbols only, so this is no restriction in use. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/NegOut.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/NegOut.lean index 313afe8b..80d76183 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/NegOut.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/NegOut.lean @@ -45,7 +45,7 @@ writes and `idleDir` moves); the output cells are unchanged except cell 1. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/SeekFrontier.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/SeekFrontier.lean index 53ca5e77..5eb53d55 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/SeekFrontier.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/SeekFrontier.lean @@ -30,7 +30,7 @@ steps, every other tape exactly preserved. Behavior from head 1 on -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/Sim.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/Sim.lean index e905be2a..345bc92e 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/Sim.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/Sim.lean @@ -26,7 +26,7 @@ The completed loop simulation and headline universal-machine theorems are in -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/SimClocked.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/SimClocked.lean index 9214f2b4..ef0361f2 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/SimClocked.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/SimClocked.lean @@ -54,7 +54,7 @@ subsequent halt test conclusive via `simInv_verdict`). -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/StepGlue.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/StepGlue.lean index b897ac3d..3193e89c 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/StepGlue.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/StepGlue.lean @@ -21,7 +21,7 @@ Small bridges used when matching the body's phase outputs against -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/TermCheck.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/TermCheck.lean index 42144d55..952ba772 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/TermCheck.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/TermCheck.lean @@ -34,7 +34,7 @@ Contents: -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Internal/Terminated.lean b/Complexitylib/Models/TuringMachine/UTM/Internal/Terminated.lean index 3d46ed02..e97ffed5 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Internal/Terminated.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Internal/Terminated.lean @@ -25,7 +25,7 @@ since every machine has at least its start state. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/Models/TuringMachine/UTM/Universal.lean b/Complexitylib/Models/TuringMachine/UTM/Universal.lean index b58eea17..06c3d368 100644 --- a/Complexitylib/Models/TuringMachine/UTM/Universal.lean +++ b/Complexitylib/Models/TuringMachine/UTM/Universal.lean @@ -28,7 +28,7 @@ public import Complexitylib.Models.TuringMachine.Deterministic -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/CookLevin/Assembly.lean b/Complexitylib/SAT/CookLevin/Assembly.lean index 633e04ac..b43ea39a 100644 --- a/Complexitylib/SAT/CookLevin/Assembly.lean +++ b/Complexitylib/SAT/CookLevin/Assembly.lean @@ -28,7 +28,7 @@ Cook–Levin reductions `cookLevin_reduction_singleTape` / -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Headline.lean b/Complexitylib/SAT/Headline.lean index ea87f194..de85a4ac 100644 --- a/Complexitylib/SAT/Headline.lean +++ b/Complexitylib/SAT/Headline.lean @@ -23,7 +23,7 @@ Combining them yields the unconditional theorem `SAT.language_mem_NP : language -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Internal/LinearGuessVerify.lean b/Complexitylib/SAT/Internal/LinearGuessVerify.lean index 3ea53b19..cf57824c 100644 --- a/Complexitylib/SAT/Internal/LinearGuessVerify.lean +++ b/Complexitylib/SAT/Internal/LinearGuessVerify.lean @@ -23,7 +23,7 @@ theorems for any relation with that same linear bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Resolution.lean b/Complexitylib/SAT/Resolution.lean index bef82c5b..a40987c4 100644 --- a/Complexitylib/SAT/Resolution.lean +++ b/Complexitylib/SAT/Resolution.lean @@ -27,7 +27,7 @@ resolvent — is the semantic core underlying resolution proof systems. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/ThreeSAT/Completeness.lean b/Complexitylib/SAT/ThreeSAT/Completeness.lean index 6f10a94d..e15a89de 100644 --- a/Complexitylib/SAT/ThreeSAT/Completeness.lean +++ b/Complexitylib/SAT/ThreeSAT/Completeness.lean @@ -26,7 +26,7 @@ headline NP-completeness theorem. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/ThreeSAT/Headline.lean b/Complexitylib/SAT/ThreeSAT/Headline.lean index 2d02294a..6f73d7c0 100644 --- a/Complexitylib/SAT/ThreeSAT/Headline.lean +++ b/Complexitylib/SAT/ThreeSAT/Headline.lean @@ -21,7 +21,7 @@ the headline theorem `ThreeSAT.language_mem_NP`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/ThreeSAT/Verifier.lean b/Complexitylib/SAT/ThreeSAT/Verifier.lean index 02388b4a..4ee7dbc4 100644 --- a/Complexitylib/SAT/ThreeSAT/Verifier.lean +++ b/Complexitylib/SAT/ThreeSAT/Verifier.lean @@ -23,7 +23,7 @@ exact-3 syntax checker. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Internal/Correctness.lean b/Complexitylib/SAT/Tseitin/Internal/Correctness.lean index eb25c4c6..8481e737 100644 --- a/Complexitylib/SAT/Tseitin/Internal/Correctness.lean +++ b/Complexitylib/SAT/Tseitin/Internal/Correctness.lean @@ -18,7 +18,7 @@ proof threads those extensions across disjoint fresh ranges. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Internal/EncodingBounds.lean b/Complexitylib/SAT/Tseitin/Internal/EncodingBounds.lean index 9d6553b7..a0c13b33 100644 --- a/Complexitylib/SAT/Tseitin/Internal/EncodingBounds.lean +++ b/Complexitylib/SAT/Tseitin/Internal/EncodingBounds.lean @@ -18,7 +18,7 @@ indices share a common upper bound. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Internal/Shape.lean b/Complexitylib/SAT/Tseitin/Internal/Shape.lean index 67c4ad58..3c3b78ba 100644 --- a/Complexitylib/SAT/Tseitin/Internal/Shape.lean +++ b/Complexitylib/SAT/Tseitin/Internal/Shape.lean @@ -18,7 +18,7 @@ size in the source literal and clause counts. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Internal/Size.lean b/Complexitylib/SAT/Tseitin/Internal/Size.lean index a5c96f16..de90ba8d 100644 --- a/Complexitylib/SAT/Tseitin/Internal/Size.lean +++ b/Complexitylib/SAT/Tseitin/Internal/Size.lean @@ -18,7 +18,7 @@ indices make the honest bit-level bound quadratic in the source encoding length. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Internal/StreamingEndpoint.lean b/Complexitylib/SAT/Tseitin/Internal/StreamingEndpoint.lean index 59d9299f..69bc1af6 100644 --- a/Complexitylib/SAT/Tseitin/Internal/StreamingEndpoint.lean +++ b/Complexitylib/SAT/Tseitin/Internal/StreamingEndpoint.lean @@ -17,7 +17,7 @@ typed CNF token stream. The endpoint is recovered from the public -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine.lean b/Complexitylib/SAT/Tseitin/Machine.lean index 8cbc14a8..0ce1e95c 100644 --- a/Complexitylib/SAT/Tseitin/Machine.lean +++ b/Complexitylib/SAT/Tseitin/Machine.lean @@ -24,7 +24,7 @@ the fixed malformed-input fallback. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerInput.lean b/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerInput.lean index 69197426..9d730481 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerInput.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerInput.lean @@ -19,7 +19,7 @@ cells have been consumed. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerRun.lean b/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerRun.lean index 8fc2ef5e..5b199a62 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerRun.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerRun.lean @@ -29,7 +29,7 @@ to the next layer. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerSemantics.lean b/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerSemantics.lean index e23dd3b5..93715dd1 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerSemantics.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerSemantics.lean @@ -28,7 +28,7 @@ The results are definitional seams used by the later controller induction. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerToken.lean b/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerToken.lean index 6e27e5a2..fe5de885 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerToken.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Internal/ControllerToken.lean @@ -29,7 +29,7 @@ later induction over `Streaming.run` can instantiate it directly. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Internal/Execution.lean b/Complexitylib/SAT/Tseitin/Machine/Internal/Execution.lean index 2558709e..fe02ccce 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Internal/Execution.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Internal/Execution.lean @@ -27,7 +27,7 @@ started execution theorem. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Internal/InvalidBranchSpec.lean b/Complexitylib/SAT/Tseitin/Machine/Internal/InvalidBranchSpec.lean index 7923f48d..74e30ef2 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Internal/InvalidBranchSpec.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Internal/InvalidBranchSpec.lean @@ -26,7 +26,7 @@ time bound are completely independent of the supplied `validEmitter`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Internal/Setup.lean b/Complexitylib/SAT/Tseitin/Machine/Internal/Setup.lean index fcd7cf00..6f160417 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Internal/Setup.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Internal/Setup.lean @@ -28,7 +28,7 @@ are preserved. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Internal/ValidBranchAssembly.lean b/Complexitylib/SAT/Tseitin/Machine/Internal/ValidBranchAssembly.lean index e690dde6..da20dc10 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Internal/ValidBranchAssembly.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Internal/ValidBranchAssembly.lean @@ -27,7 +27,7 @@ which is exactly the final transition performed by `ifTM`. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Internal/Validation.lean b/Complexitylib/SAT/Tseitin/Machine/Internal/Validation.lean index 5382e191..4c4f1be2 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Internal/Validation.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Internal/Validation.lean @@ -18,7 +18,7 @@ tokenization. -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/SAT/Tseitin/Machine/Validation.lean b/Complexitylib/SAT/Tseitin/Machine/Validation.lean index 02fc79b0..ec5311ed 100644 --- a/Complexitylib/SAT/Tseitin/Machine/Validation.lean +++ b/Complexitylib/SAT/Tseitin/Machine/Validation.lean @@ -37,7 +37,7 @@ to the executable guards, its imported proof layer establishes: -/ -@[expose] public section +public section namespace Complexity diff --git a/Complexitylib/TimeConstructible.lean b/Complexitylib/TimeConstructible.lean index 2ff7051b..93c03c4a 100644 --- a/Complexitylib/TimeConstructible.lean +++ b/Complexitylib/TimeConstructible.lean @@ -33,7 +33,7 @@ time-constructible. -/ -@[expose] public section +public section namespace Complexity