diff --git a/.github/workflows/offline-validation.yml b/.github/workflows/offline-validation.yml index b6bf89ca..21ba0260 100644 --- a/.github/workflows/offline-validation.yml +++ b/.github/workflows/offline-validation.yml @@ -56,7 +56,7 @@ jobs: --volume "$PWD:$PWD" --workdir "$PWD" \ --env PRISMPM_EPHEMERAL_HOME=1 \ --tmpfs /tmp:rw,exec,nosuid,size=4g \ - "$image" bash -euc 'prismpm lock check; lexlean fmt --check --all; just model-write; node scripts/offline-validation.mjs export-projections .prism/projection-candidates' + "$image" bash -euc 'prismpm lock check; node scripts/lexlean-pin.mjs exec fmt --check --all; just model-write; node scripts/offline-validation.mjs export-projections .prism/projection-candidates' - uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a with: name: generated-projection-candidates diff --git a/Cargo.lock b/Cargo.lock index f16a68b6..58c974e4 100644 --- a/Cargo.lock +++ b/Cargo.lock @@ -318,8 +318,7 @@ checksum = "8f42a60cbdf9a97f5d2305f08a87dc4e09308d1276d28c869c684d7777685682" [[package]] name = "lexlean" version = "0.4.0" -source = "registry+https://github.com/rust-lang/crates.io-index" -checksum = "f2d579289052493d2c68274b10015d2cce544a78fbb876d73062184f09fb0a18" +source = "git+https://github.com/UOR-Foundation/LexLean?rev=2bf5c1e23744dff7edb2b7da3bd3e1c02d814919#2bf5c1e23744dff7edb2b7da3bd3e1c02d814919" dependencies = [ "camino", "clap", diff --git a/Cargo.toml b/Cargo.toml index 634eed60..515af8f2 100644 --- a/Cargo.toml +++ b/Cargo.toml @@ -25,6 +25,10 @@ repo-model = { version = "0.6.0", path = "crates/model" } # carries both. repo-conformance = { version = "0.6.0", path = "crates/conformance" } uorc = { version = "0.6.0", path = "crates/uorc" } +# The LexLean the whole gate runs (lexlean.pin.json): the model, the source +# conversions and the runtime staged for standalone `lean` follow the same +# revision as the pinned compiler; scripts/lexlean-pin.mjs refuses any other. +lexlean = { version = "=0.4.0", git = "https://github.com/UOR-Foundation/LexLean", rev = "2bf5c1e23744dff7edb2b7da3bd3e1c02d814919" } [workspace.lints.rust] missing_docs = "deny" diff --git a/Justfile b/Justfile index 357ebb41..75011fb9 100644 --- a/Justfile +++ b/Justfile @@ -8,6 +8,12 @@ export LEXLEAN_VERIFY_WIDTH := env_var_or_default("LEXLEAN_VERIFY_WIDTH", "4") export LEXLEAN_VERIFY_MEMORY_KIB := env_var_or_default("LEXLEAN_VERIFY_MEMORY_KIB", "9437184") export LEXLEAN_VERIFY_HINTS := env_var_or_default("LEXLEAN_VERIFY_HINTS", justfile_directory() + "/validation/lexlean-verify-hints.json") +# Every recipe runs the one pinned LexLean (lexlean.pin.json), the compiler the +# client is exported with, through scripts/lexlean-pin.mjs, which builds it once +# per revision into .lexlean/tool. It is named, never put on PATH: the SDK +# refuses a PATH that shadows the tools it declares. +lexlean := "node scripts/lexlean-pin.mjs exec" + default: vv # The whole gate. @@ -18,9 +24,9 @@ vv: lexlean-authority template-check fmt-check model lint test features bdd deny # LexLean suffix. The locked compiler must accept the exact project before the # Rust projection/gate layer is allowed to consume it. lexlean-authority: - lexlean lock --check - lexlean fmt --check --all - lexlean check --all + {{lexlean}} lock --check + {{lexlean}} fmt --check --all + {{lexlean}} check --all # R1, R4, R5 --- the repository gates, each falsifiable. model: @@ -103,8 +109,8 @@ deny: # Full formal construction/replay of the declared charter authority. lexlean-artifacts: - lexlean build --all - lexlean verify --all + {{lexlean}} build --all + {{lexlean}} verify --all # Execute every source-owned promotion and verify every restored control. claim-dispositions: diff --git a/crates/model/Cargo.toml b/crates/model/Cargo.toml index 705bd29a..8460ac61 100644 --- a/crates/model/Cargo.toml +++ b/crates/model/Cargo.toml @@ -20,7 +20,7 @@ categories.workspace = true serde = { version = "1", features = ["derive"] } serde_json = "1.0.151" toml = "1.2" -lexlean = "=0.4.0" +lexlean = { workspace = true } [lints] workspace = true diff --git a/deny.toml b/deny.toml index f4351013..43cc49e4 100644 --- a/deny.toml +++ b/deny.toml @@ -37,6 +37,8 @@ deny = [] unknown-registry = "deny" unknown-git = "deny" allow-registry = ["https://github.com/rust-lang/crates.io-index"] +# The pinned LexLean (lexlean.pin.json), the only git source. +allow-git = ["https://github.com/UOR-Foundation/LexLean"] # The client crates LexLean exports carry no licence field of their own; they # are this repository's code, under its licence. diff --git a/factory/graph.json b/factory/graph.json index 2a3ccbb2..2ea0507e 100644 --- a/factory/graph.json +++ b/factory/graph.json @@ -2,7 +2,7 @@ "schema": "uorc/factory-graph/1", "sets": { "formal": ["", "!client/", "!crates/uorc/", "!crates/uorc-wasm/", "!crates/engine/", "!model/engine.toml", "!model/hypotheses.toml", "!.github/workflows/engine.yml", "!crates/frontier/", "!crates/figures/", "!model/figures.toml", "!frontier.toml", "!generated/", "!web/", "web/index.html", "!vendor/hologram-brand/", "!scripts/site.", "!scripts/page-acceptance.mjs", "!.github/workflows/pages-client.yml", "!scripts/bench.mjs", "!scripts/lab.mjs", "!scripts/client-export.", "!factory/", "!scripts/factory.", "!.github/workflows/release.yml", "!.github/workflows/pages.yml", "!.github/workflows/factory.yml", "manifest:crates/conformance/Cargo.toml", "manifest:crates/engine/Cargo.toml", "manifest:crates/uorc/Cargo.toml", "manifest:crates/uorc-wasm/Cargo.toml", "manifest:generated/rust/uorc_compress/Cargo.toml", "manifest:generated/rust/uorc_decompress/Cargo.toml", "manifest:generated/rust/uorc_search/Cargo.toml", "manifest:crates/frontier/Cargo.toml", "manifest:crates/figures/Cargo.toml"], - "lexlean": ["lexlean.toml", "lexlean.lock", "lakefile.toml", "lake-manifest.json", "lean-toolchain", "prismpm.lock", "Justfile", ".github/workflows/bootstrap.yml", "validation/lexlean-verify-hints.json"], + "lexlean": ["lexlean.toml", "lexlean.lock", "lexlean.pin.json", "scripts/lexlean-pin.mjs", "lakefile.toml", "lake-manifest.json", "lean-toolchain", "prismpm.lock", "Justfile", ".github/workflows/bootstrap.yml", "validation/lexlean-verify-hints.json"], "xtask": ["Cargo.toml", "Cargo.lock", "rust-toolchain.toml", ".cargo/", "xtask/", "crates/model/", "manifest:crates/conformance/Cargo.toml", "manifest:crates/engine/Cargo.toml", "manifest:crates/uorc/Cargo.toml", "manifest:crates/uorc-wasm/Cargo.toml", "manifest:generated/rust/uorc_compress/Cargo.toml", "manifest:generated/rust/uorc_decompress/Cargo.toml", "manifest:generated/rust/uorc_search/Cargo.toml", "manifest:crates/frontier/Cargo.toml", "manifest:crates/figures/Cargo.toml"], "scripts": ["scripts/", "!scripts/factory.", "!scripts/site.", "!scripts/page-acceptance.mjs", "!scripts/bench.mjs", "!scripts/lab.mjs", "!scripts/client-export."], "client": ["Cargo.toml", "Cargo.lock", "rust-toolchain.toml", ".cargo/", "crates/uorc/", "generated/rust/", ".github/workflows/release.yml"] @@ -17,7 +17,7 @@ {"name": "integrity-ubuntu-24.04", "kind": "hermetic", "environment": "ubuntu-24.04", "run": "just integrity", "inputs": ["&lexlean", "&xtask", "&scripts", "closure:Uorc.Integrity.*", "standards/", "standards.lock"], "needs": [], "workflow": "bootstrap.yml", "job": "template-gate"}, {"name": "figures-ubuntu-24.04", "kind": "hermetic", "environment": "ubuntu-24.04", "run": "just figures", "inputs": ["Cargo.toml", "Cargo.lock", "rust-toolchain.toml", ".cargo/", "Justfile", "prismpm.lock", ".github/workflows/bootstrap.yml", "crates/figures/", "crates/uorc/", "crates/uorc-wasm/", "web/", "vendor/hologram-brand/MANIFEST.sha256", "closure:Uorc.Client@client/src,src", "factory/graph.json", "model/figures.toml", "src/Uorc/Performance.lex.tex", "src/Uorc/Wire/", "manifest:crates/conformance/Cargo.toml", "manifest:crates/engine/Cargo.toml", "manifest:crates/frontier/Cargo.toml", "manifest:crates/model/Cargo.toml", "manifest:xtask/Cargo.toml", "manifest:generated/rust/uorc_compress/Cargo.toml", "manifest:generated/rust/uorc_decompress/Cargo.toml", "manifest:generated/rust/uorc_search/Cargo.toml"], "needs": [], "workflow": "bootstrap.yml", "job": "template-gate"}, {"name": "offline", "kind": "fetch", "environment": "ubuntu-24.04", "run": "node scripts/offline-validation.mjs acquire, isolated first and second-distinct-root, compare-offline", "inputs": ["&formal"], "needs": [], "workflow": "offline-validation.yml", "job": "offline-compare"}, - {"name": "export", "kind": "fetch", "environment": "host", "run": "node scripts/client-export.mjs", "inputs": ["closure:Uorc.Client@client/src,src", "lexlean.toml", "lakefile.toml", "lake-manifest.json", "lean-toolchain", "scripts/client-export.mjs", "scripts/semantic-source.mjs"], "needs": [], "record": "generated/rust/factory.identity"}, + {"name": "export", "kind": "fetch", "environment": "host", "run": "node scripts/client-export.mjs", "inputs": ["closure:Uorc.Client@client/src,src", "lexlean.toml", "lexlean.pin.json", "scripts/lexlean-pin.mjs", "lakefile.toml", "lake-manifest.json", "lean-toolchain", "scripts/client-export.mjs", "scripts/semantic-source.mjs"], "needs": [], "record": "generated/rust/factory.identity"}, {"name": "pages", "kind": "fetch", "environment": "ubuntu-24.04", "run": "cargo build --locked --release -p uorc-wasm --target wasm32-unknown-unknown && node scripts/site.mjs && node scripts/page-acceptance.mjs", "inputs": ["&client", "crates/uorc-wasm/", "web/", "vendor/hologram-brand/", "scripts/site.mjs", "scripts/page-acceptance.mjs", ".github/workflows/pages-client.yml", "model/ledger.toml", "frontier.toml", "model/engine.toml"], "needs": [], "workflow": "pages-client.yml", "job": "acceptance"}, {"name": "gate", "kind": "gate", "environment": "-", "run": "-", "inputs": [], "needs": ["rest-ubuntu-24.04", "rest-ubuntu-24.04-arm", "artifacts-ubuntu-24.04", "claims-ubuntu-24.04", "varint-ubuntu-24.04", "reproducibility-ubuntu-24.04", "integrity-ubuntu-24.04", "figures-ubuntu-24.04", "pages"], "workflow": "release.yml", "job": "factory"}, {"name": "native-x86_64-unknown-linux-gnu", "kind": "fetch", "environment": "ubuntu-24.04", "run": "cargo build --locked --release -p uorc --target x86_64-unknown-linux-gnu && round-trip the shipped binary (release.yml native)", "inputs": ["&client"], "needs": [], "workflow": "release.yml", "job": "native", "evidence": "factory-native-x86_64-unknown-linux-gnu"}, diff --git a/lexlean.lock b/lexlean.lock index 0b34a1ac..728f7f1c 100644 --- a/lexlean.lock +++ b/lexlean.lock @@ -1,6 +1,6 @@ spec = "lexlean/lock/2" language = "1.2" -compiler_semantics = "1427f8b629013648a480454d67202788f2303f5396f1d7c70a7c350ddab6f694" +compiler_semantics = "75b3d9e78fc27199a7d4e9ec85a5aabb6cb0955510d728de97d33f8592144ad3" project_config_sha256 = "4a0ccab2eb627fd932df7a458687759e4154c512f6d2e867f02459cd55e3eedb" lean_toolchain = "leanprover/lean4:v4.32.1" diff --git a/lexlean.pin.json b/lexlean.pin.json new file mode 100644 index 00000000..45194295 --- /dev/null +++ b/lexlean.pin.json @@ -0,0 +1,11 @@ +{ + "repository": "https://github.com/UOR-Foundation/LexLean", + "revision": "2bf5c1e23744dff7edb2b7da3bd3e1c02d814919", + "branch": "claude/evaluation-proof", + "carries": [ + "LexLean#441 rust-std shared-box lowering", + "LexLean#443 in-place byte update primitive (prim update), which also states a byte singleton (Uorc.Core.Types::byteCell)", + "LexLean#537 staged certificates released before Lean checks them; a conditional's taken branch restated by if_pos/if_neg", + "LexLean#553 evaluation proof: a closed equality checked by the kernel alone (Eq.refl without the unifier)" + ] +} diff --git a/model/figures.toml b/model/figures.toml index 0d00ae42..e03b1cb2 100644 --- a/model/figures.toml +++ b/model/figures.toml @@ -4,7 +4,7 @@ # any listing the implementation no longer holds; the writer never raises a count. schema = "uorc/figures/1" -sites = 5498 +sites = 4735 under_facets = 7 [[item]] @@ -3294,11 +3294,6 @@ file = "src/Uorc/Core/ByteBuilder.lex.tex" item = "blockSize" values = { "4096" = 1 } -[[item]] -file = "src/Uorc/Core/ByteBuilder.lex.tex" -item = "byteSlice" -values = { "2" = 1, "3" = 1, "4" = 1, "5" = 1, "6" = 1, "7" = 1, "8" = 1, "9" = 1, "10" = 1, "11" = 1, "12" = 1, "13" = 1, "14" = 1, "15" = 1, "16" = 1, "17" = 1, "18" = 1, "19" = 1, "20" = 1, "21" = 1, "22" = 1, "23" = 1, "24" = 1, "25" = 1, "26" = 1, "27" = 1, "28" = 1, "29" = 1, "30" = 1, "31" = 1, "32" = 1, "33" = 1, "34" = 1, "35" = 1, "36" = 1, "37" = 1, "38" = 1, "39" = 1, "40" = 1, "41" = 1, "42" = 1, "43" = 1, "44" = 1, "45" = 1, "46" = 1, "47" = 1, "48" = 1, "49" = 1, "50" = 1, "51" = 1, "52" = 1, "53" = 1, "54" = 1, "55" = 1, "56" = 1, "57" = 1, "58" = 1, "59" = 1, "60" = 1, "61" = 1, "62" = 1, "63" = 1, "64" = 1, "65" = 1, "66" = 1, "67" = 1, "68" = 1, "69" = 1, "70" = 1, "71" = 1, "72" = 1, "73" = 1, "74" = 1, "75" = 1, "76" = 1, "77" = 1, "78" = 1, "79" = 1, "80" = 1, "81" = 1, "82" = 1, "83" = 1, "84" = 1, "85" = 1, "86" = 1, "87" = 1, "88" = 1, "89" = 1, "90" = 1, "91" = 1, "92" = 1, "93" = 1, "94" = 1, "95" = 1, "96" = 1, "97" = 1, "98" = 1, "99" = 1, "100" = 1, "101" = 1, "102" = 1, "103" = 1, "104" = 1, "105" = 1, "106" = 1, "107" = 1, "108" = 1, "109" = 1, "110" = 1, "111" = 1, "112" = 1, "113" = 1, "114" = 1, "115" = 1, "116" = 1, "117" = 1, "118" = 1, "119" = 1, "120" = 1, "121" = 1, "122" = 1, "123" = 1, "124" = 1, "125" = 1, "126" = 1, "127" = 1, "128" = 1, "129" = 1, "130" = 1, "131" = 1, "132" = 1, "133" = 1, "134" = 1, "135" = 1, "136" = 1, "137" = 1, "138" = 1, "139" = 1, "140" = 1, "141" = 1, "142" = 1, "143" = 1, "144" = 1, "145" = 1, "146" = 1, "147" = 1, "148" = 1, "149" = 1, "150" = 1, "151" = 1, "152" = 1, "153" = 1, "154" = 1, "155" = 1, "156" = 1, "157" = 1, "158" = 1, "159" = 1, "160" = 1, "161" = 1, "162" = 1, "163" = 1, "164" = 1, "165" = 1, "166" = 1, "167" = 1, "168" = 1, "169" = 1, "170" = 1, "171" = 1, "172" = 1, "173" = 1, "174" = 1, "175" = 1, "176" = 1, "177" = 1, "178" = 1, "179" = 1, "180" = 1, "181" = 1, "182" = 1, "183" = 1, "184" = 1, "185" = 1, "186" = 1, "187" = 1, "188" = 1, "189" = 1, "190" = 1, "191" = 1, "192" = 1, "193" = 1, "194" = 1, "195" = 1, "196" = 1, "197" = 1, "198" = 1, "199" = 1, "200" = 1, "201" = 1, "202" = 1, "203" = 1, "204" = 1, "205" = 1, "206" = 1, "207" = 1, "208" = 1, "209" = 1, "210" = 1, "211" = 1, "212" = 1, "213" = 1, "214" = 1, "215" = 1, "216" = 1, "217" = 1, "218" = 1, "219" = 1, "220" = 1, "221" = 1, "222" = 1, "223" = 1, "224" = 1, "225" = 1, "226" = 1, "227" = 1, "228" = 1, "229" = 1, "230" = 1, "231" = 1, "232" = 1, "233" = 1, "234" = 1, "235" = 1, "236" = 1, "237" = 1, "238" = 1, "239" = 1, "240" = 1, "241" = 1, "242" = 1, "243" = 1, "244" = 1, "245" = 1, "246" = 1, "247" = 1, "248" = 1, "249" = 1, "250" = 1, "251" = 1, "252" = 1, "253" = 1, "254" = 1, "255" = 1 } - [[item]] file = "src/Uorc/Core/ByteBuilder.lex.tex" item = "chooseCapacity" @@ -3464,11 +3459,6 @@ file = "src/Uorc/Core/Store.lex.tex" item = "writeStore" values = { "64" = 1 } -[[item]] -file = "src/Uorc/Core/Types.lex.tex" -item = "singletonSequence" -values = { "2" = 1, "3" = 1, "4" = 1, "5" = 1, "6" = 1, "7" = 1, "8" = 1, "9" = 1, "10" = 1, "11" = 1, "12" = 1, "13" = 1, "14" = 1, "15" = 1, "16" = 1, "17" = 1, "18" = 1, "19" = 1, "20" = 1, "21" = 1, "22" = 1, "23" = 1, "24" = 1, "25" = 1, "26" = 1, "27" = 1, "28" = 1, "29" = 1, "30" = 1, "31" = 1, "32" = 1, "33" = 1, "34" = 1, "35" = 1, "36" = 1, "37" = 1, "38" = 1, "39" = 1, "40" = 1, "41" = 1, "42" = 1, "43" = 1, "44" = 1, "45" = 1, "46" = 1, "47" = 1, "48" = 1, "49" = 1, "50" = 1, "51" = 1, "52" = 1, "53" = 1, "54" = 1, "55" = 1, "56" = 1, "57" = 1, "58" = 1, "59" = 1, "60" = 1, "61" = 1, "62" = 1, "63" = 1, "64" = 1, "65" = 1, "66" = 1, "67" = 1, "68" = 1, "69" = 1, "70" = 1, "71" = 1, "72" = 1, "73" = 1, "74" = 1, "75" = 1, "76" = 1, "77" = 1, "78" = 1, "79" = 1, "80" = 1, "81" = 1, "82" = 1, "83" = 1, "84" = 1, "85" = 1, "86" = 1, "87" = 1, "88" = 1, "89" = 1, "90" = 1, "91" = 1, "92" = 1, "93" = 1, "94" = 1, "95" = 1, "96" = 1, "97" = 1, "98" = 1, "99" = 1, "100" = 1, "101" = 1, "102" = 1, "103" = 1, "104" = 1, "105" = 1, "106" = 1, "107" = 1, "108" = 1, "109" = 1, "110" = 1, "111" = 1, "112" = 1, "113" = 1, "114" = 1, "115" = 1, "116" = 1, "117" = 1, "118" = 1, "119" = 1, "120" = 1, "121" = 1, "122" = 1, "123" = 1, "124" = 1, "125" = 1, "126" = 1, "127" = 1, "128" = 1, "129" = 1, "130" = 1, "131" = 1, "132" = 1, "133" = 1, "134" = 1, "135" = 1, "136" = 1, "137" = 1, "138" = 1, "139" = 1, "140" = 1, "141" = 1, "142" = 1, "143" = 1, "144" = 1, "145" = 1, "146" = 1, "147" = 1, "148" = 1, "149" = 1, "150" = 1, "151" = 1, "152" = 1, "153" = 1, "154" = 1, "155" = 1, "156" = 1, "157" = 1, "158" = 1, "159" = 1, "160" = 1, "161" = 1, "162" = 1, "163" = 1, "164" = 1, "165" = 1, "166" = 1, "167" = 1, "168" = 1, "169" = 1, "170" = 1, "171" = 1, "172" = 1, "173" = 1, "174" = 1, "175" = 1, "176" = 1, "177" = 1, "178" = 1, "179" = 1, "180" = 1, "181" = 1, "182" = 1, "183" = 1, "184" = 1, "185" = 1, "186" = 1, "187" = 1, "188" = 1, "189" = 1, "190" = 1, "191" = 1, "192" = 1, "193" = 1, "194" = 1, "195" = 1, "196" = 1, "197" = 1, "198" = 1, "199" = 1, "200" = 1, "201" = 1, "202" = 1, "203" = 1, "204" = 1, "205" = 1, "206" = 1, "207" = 1, "208" = 1, "209" = 1, "210" = 1, "211" = 1, "212" = 1, "213" = 1, "214" = 1, "215" = 1, "216" = 1, "217" = 1, "218" = 1, "219" = 1, "220" = 1, "221" = 1, "222" = 1, "223" = 1, "224" = 1, "225" = 1, "226" = 1, "227" = 1, "228" = 1, "229" = 1, "230" = 1, "231" = 1, "232" = 1, "233" = 1, "234" = 1, "235" = 1, "236" = 1, "237" = 1, "238" = 1, "239" = 1, "240" = 1, "241" = 1, "242" = 1, "243" = 1, "244" = 1, "245" = 1, "246" = 1, "247" = 1, "248" = 1, "249" = 1, "250" = 1, "251" = 1, "252" = 1, "253" = 1, "254" = 1, "255" = 1 } - [[item]] file = "src/Uorc/Core/Types.lex.tex" item = "wordOfNat" @@ -3684,11 +3674,6 @@ file = "src/Uorc/Search/Enumerate.lex.tex" item = "buildStep" values = { "256" = 2 } -[[item]] -file = "src/Uorc/Search/Enumerate.lex.tex" -item = "natByteSlice" -values = { "2" = 1, "3" = 1, "4" = 1, "5" = 1, "6" = 1, "7" = 1, "8" = 1, "9" = 1, "10" = 1, "11" = 1, "12" = 1, "13" = 1, "14" = 1, "15" = 1, "16" = 1, "17" = 1, "18" = 1, "19" = 1, "20" = 1, "21" = 1, "22" = 1, "23" = 1, "24" = 1, "25" = 1, "26" = 1, "27" = 1, "28" = 1, "29" = 1, "30" = 1, "31" = 1, "32" = 1, "33" = 1, "34" = 1, "35" = 1, "36" = 1, "37" = 1, "38" = 1, "39" = 1, "40" = 1, "41" = 1, "42" = 1, "43" = 1, "44" = 1, "45" = 1, "46" = 1, "47" = 1, "48" = 1, "49" = 1, "50" = 1, "51" = 1, "52" = 1, "53" = 1, "54" = 1, "55" = 1, "56" = 1, "57" = 1, "58" = 1, "59" = 1, "60" = 1, "61" = 1, "62" = 1, "63" = 1, "64" = 1, "65" = 1, "66" = 1, "67" = 1, "68" = 1, "69" = 1, "70" = 1, "71" = 1, "72" = 1, "73" = 1, "74" = 1, "75" = 1, "76" = 1, "77" = 1, "78" = 1, "79" = 1, "80" = 1, "81" = 1, "82" = 1, "83" = 1, "84" = 1, "85" = 1, "86" = 1, "87" = 1, "88" = 1, "89" = 1, "90" = 1, "91" = 1, "92" = 1, "93" = 1, "94" = 1, "95" = 1, "96" = 1, "97" = 1, "98" = 1, "99" = 1, "100" = 1, "101" = 1, "102" = 1, "103" = 1, "104" = 1, "105" = 1, "106" = 1, "107" = 1, "108" = 1, "109" = 1, "110" = 1, "111" = 1, "112" = 1, "113" = 1, "114" = 1, "115" = 1, "116" = 1, "117" = 1, "118" = 1, "119" = 1, "120" = 1, "121" = 1, "122" = 1, "123" = 1, "124" = 1, "125" = 1, "126" = 1, "127" = 1, "128" = 1, "129" = 1, "130" = 1, "131" = 1, "132" = 1, "133" = 1, "134" = 1, "135" = 1, "136" = 1, "137" = 1, "138" = 1, "139" = 1, "140" = 1, "141" = 1, "142" = 1, "143" = 1, "144" = 1, "145" = 1, "146" = 1, "147" = 1, "148" = 1, "149" = 1, "150" = 1, "151" = 1, "152" = 1, "153" = 1, "154" = 1, "155" = 1, "156" = 1, "157" = 1, "158" = 1, "159" = 1, "160" = 1, "161" = 1, "162" = 1, "163" = 1, "164" = 1, "165" = 1, "166" = 1, "167" = 1, "168" = 1, "169" = 1, "170" = 1, "171" = 1, "172" = 1, "173" = 1, "174" = 1, "175" = 1, "176" = 1, "177" = 1, "178" = 1, "179" = 1, "180" = 1, "181" = 1, "182" = 1, "183" = 1, "184" = 1, "185" = 1, "186" = 1, "187" = 1, "188" = 1, "189" = 1, "190" = 1, "191" = 1, "192" = 1, "193" = 1, "194" = 1, "195" = 1, "196" = 1, "197" = 1, "198" = 1, "199" = 1, "200" = 1, "201" = 1, "202" = 1, "203" = 1, "204" = 1, "205" = 1, "206" = 1, "207" = 1, "208" = 1, "209" = 1, "210" = 1, "211" = 1, "212" = 1, "213" = 1, "214" = 1, "215" = 1, "216" = 1, "217" = 1, "218" = 1, "219" = 1, "220" = 1, "221" = 1, "222" = 1, "223" = 1, "224" = 1, "225" = 1, "226" = 1, "227" = 1, "228" = 1, "229" = 1, "230" = 1, "231" = 1, "232" = 1, "233" = 1, "234" = 1, "235" = 1, "236" = 1, "237" = 1, "238" = 1, "239" = 1, "240" = 1, "241" = 1, "242" = 1, "243" = 1, "244" = 1, "245" = 1, "246" = 1, "247" = 1, "248" = 1, "249" = 1, "250" = 1, "251" = 1, "252" = 1, "253" = 1, "254" = 1, "255" = 1, "256" = 1 } - [[item]] file = "src/Uorc/Search/Enumerate.lex.tex" item = "step" diff --git a/scripts/claims-validation.mjs b/scripts/claims-validation.mjs index e4331764..ee977712 100644 --- a/scripts/claims-validation.mjs +++ b/scripts/claims-validation.mjs @@ -5,6 +5,7 @@ import path from 'node:path'; import {spawnSync} from 'node:child_process'; import {fileURLToPath} from 'node:url'; import {copySource, sha, canonical} from './offline-validation.mjs'; +import {lexleanBinary} from './lexlean-pin.mjs'; import {dataForm, notation} from './semantic-source.mjs'; const script = fileURLToPath(import.meta.url); @@ -60,7 +61,12 @@ export function expectedFailure(result, mutation, generated) { requireFact(start>=0 && lines.filter(line=>line.startsWith(`public theorem ${mutation.owner} :`)).length===1, 'generated theorem owner is absent or ambiguous'); let end=start+1; while(endd.code==='LLV7002' && d.primary?.path===sourcePath && d.message.includes('Tactic `rfl` failed') && (d.notes??[]).some(note=>{ + // The owner is refused by the proof its generated body runs: `rfl` reports + // through the elaborator; an evaluation proof reaches the kernel, which + // names the owning declaration in its type mismatch. + const refused=message=>message.includes('Tactic `rfl` failed') + || (message.includes("(kernel) declaration type mismatch, '") && message.includes(`.${mutation.owner}' has type`)); + requireFact((value.diagnostics??[]).some(d=>d.code==='LLV7002' && d.primary?.path===sourcePath && refused(d.message) && (d.notes??[]).some(note=>{ const match=note.message.match(/^generated location: \$STAGING\/lean-src\/Uorc\/Uorc\/Claims\.lean:(\d+):\d+$/); return match && Number(match[1])>start && Number(match[1])<=end; })), 'failure did not reach its owning kernel theorem'); @@ -75,7 +81,7 @@ export function run(root) { const receipts=[]; const execute=(project,label,command='verify')=>{ const args=['--project',path.join(project,'lexlean.toml'),'--diagnostic-format','json',command,sourcePath]; - const result=spawnSync('/usr/local/bin/lexlean',args,{cwd:project,encoding:'utf8',timeout:300000,maxBuffer:32*1024*1024}); + const result=spawnSync(lexleanBinary(),args,{cwd:project,encoding:'utf8',timeout:300000,maxBuffer:32*1024*1024}); fs.writeFileSync(path.join(output,`${label}.stdout`),result.stdout??''); fs.writeFileSync(path.join(output,`${label}.stderr`),result.stderr??''); return result; diff --git a/scripts/claims-validation.test.mjs b/scripts/claims-validation.test.mjs index c7f57e92..770163f3 100644 --- a/scripts/claims-validation.test.mjs +++ b/scripts/claims-validation.test.mjs @@ -39,6 +39,13 @@ function rejection() { } test('only a completed kernel rejection at the exact owning theorem counts',()=>{ const f=rejection();expectedFailure(f.result,f.row,f.generated); + // An evaluation proof is refused by the kernel, naming its owner; another + // declaration's mismatch does not count. + const kernel=rejection(); + kernel.value.diagnostics[0].message=`Lean rejected \`Uorc.Uorc.Claims\` (error): (kernel) declaration type mismatch, 'Uorc.Uorc.Claims.${kernel.row.owner}' has type`; + expectedFailure({...kernel.result,stdout:JSON.stringify(kernel.value)},kernel.row,kernel.generated); + kernel.value.diagnostics[0].message="Lean rejected `Uorc.Uorc.Claims` (error): (kernel) declaration type mismatch, 'Uorc.Uorc.Claims.other' has type"; + assert.throws(()=>expectedFailure({...kernel.result,stdout:JSON.stringify(kernel.value)},kernel.row,kernel.generated)); for(const patch of [{status:0},{status:null},{error:new Error('missing SDK')},{signal:'SIGTERM'},{stdout:'not JSON'}]) { assert.throws(()=>expectedFailure({...f.result,...patch},f.row,f.generated)); } diff --git a/scripts/client-export.mjs b/scripts/client-export.mjs index dbeb0f22..bf68478a 100644 --- a/scripts/client-export.mjs +++ b/scripts/client-export.mjs @@ -36,15 +36,11 @@ // literal second, with x not a literal and N above SECOND_LITERAL_BOUND, stops // the export with its module and definition named. // -// The export uses LexLean pinned at LEXLEAN_REV, the branch -// claude/release-staged-certificates of UOR-Foundation/LexLean (claude/uorc-pin -// plus LexLean#537): the rust-std shared-box lowering (LexLean#441) keeps -// search states behind reference-counted boxes instead of copying them on every -// field read, the in-place byte update primitive (LexLean#443) gives the codec -// O(1) table writes, and #537 releases each certificate once staged and restates -// a conditional's taken branch by if_pos/if_neg, so the kernel never evaluates -// a branch's computation to compare it with its unreduced selection. The pin -// moves to a LexLean release once these ship. +// The export uses the LexLean the whole gate runs, pinned in lexlean.pin.json +// (scripts/lexlean-pin.mjs): the rust-std shared-box lowering (LexLean#441) +// keeps search states behind reference-counted boxes instead of copying them on +// every field read, and the in-place byte update primitive (LexLean#443) gives +// the codec O(1) table writes. The pin moves to a LexLean release once these ship. // Set LEXLEAN to an already built binary of the same revision to skip the build. // // The export is the factory obligation `export` (factory/graph.json): its @@ -59,26 +55,18 @@ import {spawnSync} from 'node:child_process'; import {fileURLToPath} from 'node:url'; import {dataForm, notation} from './semantic-source.mjs'; import {loadGraph, identities, workingTree} from './factory.mjs'; +import {lexleanBinary} from './lexlean-pin.mjs'; const root = process.cwd(); const out = path.join(root, 'generated/rust'); const entry = 'src/Uorc/Client.lex.tex'; // staged path const roots = [['uorc_compress', 'Uorc.Uorc.Client.compress'], ['uorc_decompress', 'Uorc.Uorc.Client.decompress'], ['uorc_search', 'Uorc.Uorc.Client.search']]; -const LEXLEAN_REPO = 'https://github.com/UOR-Foundation/LexLean'; -const LEXLEAN_REV = '560b64905d86f9711b4f986a9916f505067b08d8'; const fail = m => { throw new Error(m); }; const run = (cmd, args, cwd) => { const r = spawnSync(cmd, args, {cwd, encoding: 'utf8', maxBuffer: 256 * 1024 * 1024}); if (r.error || r.status !== 0) fail(`${cmd} ${args.join(' ')}: ${r.error ?? ''}${r.stdout}${r.stderr}`); return r.stdout; }; -function lexleanBinary() { - if (process.env.LEXLEAN) return process.env.LEXLEAN; - const tool = path.join(root, '.lexlean/tool', LEXLEAN_REV); - const bin = path.join(tool, 'bin', 'lexlean'); - if (!fs.existsSync(bin)) run('cargo', ['install', '--locked', '--git', LEXLEAN_REPO, '--rev', LEXLEAN_REV, '--root', tool, 'lexlean'], root); - return bin; -} const moduleFile = (dir, m) => path.join(dir, 'src', ...m.split('.')) + '.lex.tex'; // `file` maps a module name to its source: the stage, or for --check the diff --git a/scripts/executed-controls-runtime.mjs b/scripts/executed-controls-runtime.mjs index ced20c19..03af8064 100644 --- a/scripts/executed-controls-runtime.mjs +++ b/scripts/executed-controls-runtime.mjs @@ -9,6 +9,7 @@ import path from 'node:path'; import {spawnSync} from 'node:child_process'; import {controlModules, driver} from './executed-controls.mjs'; import {dataForm, stageRuntime} from './semantic-source.mjs'; +import {lexleanBinary} from './lexlean-pin.mjs'; const requireFact=(b,m)=>{if(!b)throw new Error(m);}; function run(command,args,cwd,env={}){ const r=spawnSync(command,args,{cwd,env:{...process.env,...env},encoding:'utf8',timeout:3600000,maxBuffer:64*1024*1024}); @@ -29,7 +30,7 @@ try{ requireFact(process.argv.length===2,'no arguments accepted'); const root=process.cwd(); const expected=new Map(controlModules.map(m=>[m,inventory(root,m)])); - const built=JSON.parse(checked('lexlean',['--diagnostic-format','json','build',...controlModules.map(m=>`src/Uorc/${m}.lex.tex`)],root).stdout); + const built=JSON.parse(checked(lexleanBinary(),['--diagnostic-format','json','build',...controlModules.map(m=>`src/Uorc/${m}.lex.tex`)],root).stdout); requireFact(built.success&&built.artifacts.length===1,'one generated closure required'); const generated=path.join(path.resolve(root,built.artifacts[0]),'modules'); const runtime=fs.mkdtempSync(path.join(os.tmpdir(),'uorc-executed-controls-')); diff --git a/scripts/integrity-validation.mjs b/scripts/integrity-validation.mjs index bfc9f612..a4d10c6c 100644 --- a/scripts/integrity-validation.mjs +++ b/scripts/integrity-validation.mjs @@ -7,6 +7,7 @@ import crypto from 'node:crypto'; import {fileURLToPath} from 'node:url'; import {loadCorpus,sourceRecords,leanDriver,requireFact} from './integrity-vectors.mjs'; import {dataForm, notation, stageRuntime} from './semantic-source.mjs'; +import {lexleanBinary} from './lexlean-pin.mjs'; const script=fileURLToPath(import.meta.url); const shaFile='src/Uorc/Integrity/Sha256.lex.tex'; const sources=[shaFile,'src/Uorc/Integrity/BoundedChain.lex.tex','src/Uorc/Integrity/Contract.lex.tex']; @@ -44,7 +45,7 @@ function execute(command,args,cwd,output,label,extra={}){ } function succeeded(result,label){requireFact(!result.error&&result.status===0&&!result.signal,`${label} failed: ${result.stderr??''} ${result.stdout??''}`);} function verify(root,selected,output,label){ - const result=execute('lexlean',['--project',path.join(root,'lexlean.toml'),'--diagnostic-format','json','verify',...selected],root,output,label); + const result=execute(lexleanBinary(),['--project',path.join(root,'lexlean.toml'),'--diagnostic-format','json','verify',...selected],root,output,label); return result; } export function auditRun(just,harness){ @@ -79,7 +80,7 @@ export function run(root){ receipts.push({id:mutation.id,owner:mutation.owner,source_sha256:sha(source),mutant_sha256:sha(mutant),failed_stdout_sha256:sha(failed.stdout),restored_stdout_sha256:sha(restored.stdout)}); } requireFact(receipts.length===mutations.length,'source mutations omitted'); - const built=execute('lexlean',['--project',path.join(root,'lexlean.toml'),'--diagnostic-format','json','build',...sources],root,output,'build');succeeded(built,'source build'); + const built=execute(lexleanBinary(),['--project',path.join(root,'lexlean.toml'),'--diagnostic-format','json','build',...sources],root,output,'build');succeeded(built,'source build'); const result=JSON.parse(built.stdout);requireFact(result.success&&result.artifacts.length===1,'source build artifact missing'); const build=path.resolve(root,result.artifacts[0]);requireFact(build.startsWith(path.resolve(root)+path.sep),'build artifact escaped project'); const modelRoot=path.join(temporary,'generated'); diff --git a/scripts/lexlean-pin.mjs b/scripts/lexlean-pin.mjs new file mode 100644 index 00000000..e66338ee --- /dev/null +++ b/scripts/lexlean-pin.mjs @@ -0,0 +1,76 @@ +// The one LexLean revision every uorc recipe runs: the authority gate, the +// formal legs, and the client export (scripts/client-export.mjs) all take it +// from lexlean.pin.json, so the model is checked by the same compiler it is +// exported with. The pin is a branch of UOR-Foundation/LexLean until a LexLean +// release carries what it adds (see lexlean.pin.json `carries`). +// +// node scripts/lexlean-pin.mjs dir prints the pinned tool's bin directory +// node scripts/lexlean-pin.mjs install builds it there once, then prints it +// node scripts/lexlean-pin.mjs exec ARGS runs it (building it once) with ARGS +// +// The pin is named, never put on PATH: the SDK refuses a PATH that shadows the +// tools it declares (PP5401), so recipes run `lexlean` through `exec`. +// +// Set LEXLEAN to an already built binary of the same revision to skip the build, +// or LEXLEAN_TOOL_ROOT to the directory it is installed under (the offline +// construction installs it into its sealed acquisition this way). The build +// itself runs beside the tool root (on the workspace disk) and is removed once the binary +// is installed: the recipe containers mount a small /tmp, which cargo install's +// default build directory would fill. +import fs from 'node:fs'; +import path from 'node:path'; +import {spawnSync} from 'node:child_process'; +import {fileURLToPath} from 'node:url'; + +const here = path.dirname(fileURLToPath(import.meta.url)); +const root = path.resolve(here, '..'); +const pin = JSON.parse(fs.readFileSync(path.join(root, 'lexlean.pin.json'), 'utf8')); +export const LEXLEAN_REPO = pin.repository; +export const LEXLEAN_REV = pin.revision; + +// The Rust model and gates link the LexLean crate (Cargo.toml's workspace +// `lexlean`), whose source conversions and runtime modules must be those of the +// compiler that runs: a crate of another revision stages a runtime without the +// primitives the pinned compiler emits. Wherever the workspace is present, its +// dependency is this pin. +export function cargoRevision(text) { + const m = /^lexlean = \{ version = "=[^"]+", git = "([^"]+)", rev = "([0-9a-f]{40})" \}$/m.exec(text); + return m && {repository: m[1], revision: m[2]}; +} +const manifest = path.join(root, 'Cargo.toml'); +if (fs.existsSync(manifest)) { + const cargo = cargoRevision(fs.readFileSync(manifest, 'utf8')); + if (!cargo || cargo.repository !== LEXLEAN_REPO || cargo.revision !== LEXLEAN_REV) + throw new Error(`Cargo.toml's lexlean dependency ${JSON.stringify(cargo)} is not the pin ${LEXLEAN_REPO}@${LEXLEAN_REV} (lexlean.pin.json)`); +} + +export function lexleanDir() { + if (process.env.LEXLEAN) return path.dirname(path.resolve(process.env.LEXLEAN)); + return path.join(toolRoot(), 'bin'); +} + +function toolRoot() { + return process.env.LEXLEAN_TOOL_ROOT ? path.resolve(process.env.LEXLEAN_TOOL_ROOT) : path.join(root, '.lexlean/tool', LEXLEAN_REV); +} + +export function lexleanBinary() { + if (process.env.LEXLEAN) return path.resolve(process.env.LEXLEAN); + const bin = path.join(lexleanDir(), 'lexlean'); + if (!fs.existsSync(bin)) { + const build = `${toolRoot()}.build`; + const r = spawnSync('cargo', ['install', '--locked', '--git', LEXLEAN_REPO, '--rev', LEXLEAN_REV, '--root', toolRoot(), '--target-dir', build, 'lexlean'], {cwd: root, stdio: ['ignore', 2, 2]}); + fs.rmSync(build, {recursive: true, force: true}); + if (r.error || r.status !== 0) throw new Error(`cargo install lexlean ${LEXLEAN_REV} failed: ${r.error ?? r.status}`); + } + return bin; +} + +if (process.argv[1] && path.resolve(process.argv[1]) === fileURLToPath(import.meta.url)) { + const command = process.argv[2]; + if (command === 'dir') console.log(lexleanDir()); + else if (command === 'install') console.log(path.dirname(lexleanBinary())); + else if (command === 'exec') { + const r = spawnSync(lexleanBinary(), process.argv.slice(3), {cwd: process.cwd(), stdio: 'inherit'}); + process.exit(r.error ? 70 : r.status ?? 70); + } else { console.error('usage: lexlean-pin.mjs dir|install|exec ARGS'); process.exit(64); } +} diff --git a/scripts/offline-validation.mjs b/scripts/offline-validation.mjs index c8754937..edd67890 100644 --- a/scripts/offline-validation.mjs +++ b/scripts/offline-validation.mjs @@ -5,6 +5,7 @@ import path from 'node:path'; import crypto from 'node:crypto'; import { spawnSync } from 'node:child_process'; import { fileURLToPath } from 'node:url'; +import { lexleanBinary } from './lexlean-pin.mjs'; const SCRIPT = fileURLToPath(import.meta.url); const SDK = '/usr/local/bin/prismpm'; @@ -52,8 +53,15 @@ export function cleanOutputs(root) { export function compare(left, right) { if (canonical(left) !== canonical(right)) fail('URP003', 'canonical artifact inventory or bytes differ'); } +// Every `lexlean` this script runs, directly or through just in a copied root, +// is the pinned one (lexlean.pin.json), never the SDK's own. It is named, not +// put on PATH (the SDK refuses a PATH that shadows its tools), and LEXLEAN +// carries it so a copied root's recipes reuse it instead of building it again. +function pinLexlean() { + process.env.LEXLEAN = lexleanBinary(); +} function run(root, command, args, options = {}) { - const result = spawnSync(command, args, { cwd: root, encoding: 'utf8', maxBuffer: 64 * 1024 * 1024, + const result = spawnSync(command === 'lexlean' ? lexleanBinary() : command, args, { cwd: root, encoding: 'utf8', maxBuffer: 64 * 1024 * 1024, env: { ...process.env, ...options.env }, timeout: 110 * 60 * 1000 }); if (options.log) { fs.mkdirSync(path.dirname(options.log), { recursive: true }); @@ -211,6 +219,7 @@ export function negativeSdk(root, temporary) { } function reproduce(root) { sdk(root); + pinLexlean(); // Two clean roots each hold a full cargo target and LexLean build: they live // on the checkout's disk (source-excluded `.tmp`), never the SDK's small /tmp. fs.mkdirSync(path.join(root, '.tmp'), { recursive: true }); @@ -255,6 +264,20 @@ function setup(root, acquisition) { fs.mkdirSync(env.HOME, { recursive: true }); fs.mkdirSync(env.XDG_CACHE_HOME, { recursive: true }); run(root, 'cargo', ['fetch', '--locked'], { env, log: path.join(acquisition, 'fetch.log') }); run(root, 'cargo', ['deny', '--locked', '--all-features', 'fetch'], { env, log: path.join(acquisition, 'deny-fetch.log') }); + // The pinned LexLean crate is a git dependency: its sealed form is cargo's + // bare repository (git/db), regular files only. A working checkout + // (git/checkouts) is derived from it, holds the repository's symlinks, which + // the sealed inventory refuses, and is made again offline from git/db. + fs.rmSync(path.join(env.CARGO_HOME, 'git', 'checkouts'), { recursive: true, force: true }); + // The pinned LexLean (lexlean.pin.json) is a tool, sealed with the cache as + // its installed binary alone: it is fetched and built under a cargo home of + // its own, removed afterwards, so the cache holds no git checkout of it + // (whose symlinks the sealed inventory refuses) and no crate the project + // does not lock. + const toolHome = path.join(acquisition, 'lexlean-cargo-home'); + try { + run(root, 'node', ['scripts/lexlean-pin.mjs', 'install'], { env: { ...env, CARGO_HOME: toolHome, LEXLEAN_TOOL_ROOT: path.join(cache, 'lexlean') }, log: path.join(acquisition, 'lexlean-install.log') }); + } finally { fs.rmSync(toolHome, { recursive: true, force: true }); } // Acquisition never compiles, generates, or verifies UORC outputs. cleanOutputs(root); writeJson(path.join(acquisition, 'setup.json'), { schema: 'uorc/dependency-setup/1', sdk_image: lock.sdk_image, @@ -275,9 +298,10 @@ function offline(root, acquisition) { cleanOutputs(root); const cache = fs.mkdtempSync(path.join(os.tmpdir(), 'uorc-acquired-')); fs.cpSync(path.join(acquisition, 'cache'), cache, { recursive: true }); - const env = { ...cacheEnvironment(cache), CARGO_NET_OFFLINE: 'true', CARGO_INCREMENTAL: '0', CARGO_TARGET_DIR: path.join(root, 'target'), + const env = { ...cacheEnvironment(cache), LEXLEAN_TOOL_ROOT: path.join(cache, 'lexlean'), CARGO_NET_OFFLINE: 'true', CARGO_INCREMENTAL: '0', CARGO_TARGET_DIR: path.join(root, 'target'), SOURCE_DATE_EPOCH: '0', TZ: 'UTC', LC_ALL: 'C.UTF-8' }; Object.assign(process.env, env); + pinLexlean(); // Current-build verification is always executed, never accepted from a cache receipt. // Every other recipe of `just vv` runs once in its own acceptance leg; this // root proves the formal construction itself needs no network. diff --git a/scripts/offline-validation.test.mjs b/scripts/offline-validation.test.mjs index bd7cca5d..54a5adb6 100644 --- a/scripts/offline-validation.test.mjs +++ b/scripts/offline-validation.test.mjs @@ -94,7 +94,7 @@ test('normative gate retains reproduction and full formal verification', () => { for (const gate of ['lexlean-authority', 'template-check', 'fmt-check', 'model', 'lint', 'test', 'features', 'bdd', 'deny', 'lexlean-artifacts', 'reproducibility']) { assert.ok(vv.split(/\s+/).includes(gate), `${gate} omitted from just vv`); } - assert.match(just, /lexlean-artifacts:\n lexlean build --all\n lexlean verify --all/); + assert.match(just, /lexlean-artifacts:\n \{\{lexlean\}\} build --all\n \{\{lexlean\}\} verify --all/); assert.match(just, /reproducibility:\n node scripts\/offline-validation\.mjs reproduce/); }); diff --git a/scripts/varint-validation.mjs b/scripts/varint-validation.mjs index 01459f80..8044c67a 100644 --- a/scripts/varint-validation.mjs +++ b/scripts/varint-validation.mjs @@ -5,6 +5,7 @@ import path from 'node:path'; import {spawnSync} from 'node:child_process'; import {fileURLToPath} from 'node:url'; import {copySource,sha,canonical} from './offline-validation.mjs'; +import {lexleanBinary} from './lexlean-pin.mjs'; import {dataForm, notation} from './semantic-source.mjs'; const script=fileURLToPath(import.meta.url); const sourcePath='src/Uorc/Varint.lex.tex'; @@ -59,7 +60,7 @@ export function run(root){ const output=fs.mkdtempSync(path.join(root,'.prism/uorc/varint.')); const receipts=[]; const execute=(project,label)=>{ - const result=spawnSync('/usr/local/bin/lexlean',['--project',path.join(project,'lexlean.toml'),'--diagnostic-format','json','verify',sourcePath],{cwd:project,encoding:'utf8',timeout:300000,maxBuffer:32*1024*1024}); + const result=spawnSync(lexleanBinary(),['--project',path.join(project,'lexlean.toml'),'--diagnostic-format','json','verify',sourcePath],{cwd:project,encoding:'utf8',timeout:300000,maxBuffer:32*1024*1024}); fs.writeFileSync(path.join(output,`${label}.stdout`),result.stdout??'');fs.writeFileSync(path.join(output,`${label}.stderr`),result.stderr??'');return result; }; try{ diff --git a/src/Uorc/Claims.lex.tex b/src/Uorc/Claims.lex.tex index 5cc30b65..3319244a 100644 --- a/src/Uorc/Claims.lex.tex +++ b/src/Uorc/Claims.lex.tex @@ -198,7 +198,7 @@ name: claimForEvidence_none, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.none)) = (ctor ClaimKind.open_claim)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -206,7 +206,7 @@ name: researchDisposition_none, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.none)) = (ctor ResearchDisposition.not_measured)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -214,7 +214,7 @@ name: implementationEvidence_none, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.none)) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -222,7 +222,7 @@ name: claimForEvidence_imported_fact, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.imported_fact)) = (ctor ClaimKind.imported_fact)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -230,7 +230,7 @@ name: researchDisposition_imported_fact, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.imported_fact)) = (ctor ResearchDisposition.not_measured)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -238,7 +238,7 @@ name: implementationEvidence_imported_fact, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.imported_fact)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -246,7 +246,7 @@ name: claimForEvidence_build_evidence, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.build_evidence)) = (ctor ClaimKind.build_evidence)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -254,7 +254,7 @@ name: researchDisposition_build_evidence, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.build_evidence)) = (ctor ResearchDisposition.not_measured)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -262,7 +262,7 @@ name: implementationEvidence_build_evidence, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.build_evidence)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -270,7 +270,7 @@ name: claimForEvidence_kernel_theorem, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.kernel_theorem)) = (ctor ClaimKind.kernel_theorem)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -278,7 +278,7 @@ name: researchDisposition_kernel_theorem, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.kernel_theorem)) = (ctor ResearchDisposition.not_measured)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -286,7 +286,7 @@ name: implementationEvidence_kernel_theorem, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.kernel_theorem)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -294,7 +294,7 @@ name: claimForEvidence_fixture_result, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.fixture_result)) = (ctor ClaimKind.reconstruction_checked)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -302,7 +302,7 @@ name: researchDisposition_fixture_result, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.fixture_result)) = (ctor ResearchDisposition.not_measured)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -310,7 +310,7 @@ name: implementationEvidence_fixture_result, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.fixture_result)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -318,7 +318,7 @@ name: claimForEvidence_scoped_minimum_certificate, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.scoped_minimum_certificate)) = (ctor ClaimKind.minimum_certified)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -326,7 +326,7 @@ name: researchDisposition_scoped_minimum_certificate, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.scoped_minimum_certificate)) = (ctor ResearchDisposition.not_measured)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -334,7 +334,7 @@ name: implementationEvidence_scoped_minimum_certificate, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.scoped_minimum_certificate)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -342,7 +342,7 @@ name: claimForEvidence_benchmark_target_unmet, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.benchmark_target_unmet)) = (ctor ClaimKind.benchmark_result)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -350,7 +350,7 @@ name: researchDisposition_benchmark_target_unmet, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.benchmark_target_unmet)) = (ctor ResearchDisposition.measured_target_unmet)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -358,7 +358,7 @@ name: implementationEvidence_benchmark_target_unmet, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.benchmark_target_unmet)) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -366,7 +366,7 @@ name: claimForEvidence_benchmark_target_met, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.benchmark_target_met)) = (ctor ClaimKind.benchmark_result)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -374,7 +374,7 @@ name: researchDisposition_benchmark_target_met, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.benchmark_target_met)) = (ctor ResearchDisposition.measured_target_met)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -382,7 +382,7 @@ name: implementationEvidence_benchmark_target_met, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.benchmark_target_met)) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -390,7 +390,7 @@ name: claimForEvidence_benchmark_measurement, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.benchmark_measurement)) = (ctor ClaimKind.benchmark_result)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -398,7 +398,7 @@ name: researchDisposition_benchmark_measurement, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.benchmark_measurement)) = (ctor ResearchDisposition.measured_no_target)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -406,7 +406,7 @@ name: implementationEvidence_benchmark_measurement, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.benchmark_measurement)) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -414,7 +414,7 @@ name: claimForEvidence_external_record_acceptance, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.external_record_acceptance)) = (ctor ClaimKind.record_validated)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -422,7 +422,7 @@ name: researchDisposition_external_record_acceptance, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.external_record_acceptance)) = (ctor ResearchDisposition.externally_accepted_record)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -430,7 +430,7 @@ name: implementationEvidence_external_record_acceptance, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.external_record_acceptance)) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -438,7 +438,7 @@ name: claimForEvidence_version_metadata, parameters: [], statement: ((claimForEvidence (ctor EvidenceKind.version_metadata)) = (ctor ClaimKind.open_claim)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -446,7 +446,7 @@ name: researchDisposition_version_metadata, parameters: [], statement: ((researchDisposition (ctor EvidenceKind.version_metadata)) = (ctor ResearchDisposition.not_measured)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -454,7 +454,7 @@ name: implementationEvidence_version_metadata, parameters: [], statement: ((implementationEvidence (ctor EvidenceKind.version_metadata)) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -480,7 +480,7 @@ name: valid_measurement_benchmark_target_unmet, parameters: [], statement: ((measurementComplete (ctor EvidenceKind.benchmark_target_unmet)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -488,7 +488,7 @@ name: valid_measurement_benchmark_target_met, parameters: [], statement: ((measurementComplete (ctor EvidenceKind.benchmark_target_met)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -496,7 +496,7 @@ name: valid_measurement_benchmark_measurement, parameters: [], statement: ((measurementComplete (ctor EvidenceKind.benchmark_measurement)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -548,7 +548,7 @@ name: honestyLevel_none, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.none)) = "open"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -556,7 +556,7 @@ name: honestyLevel_imported_fact, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.imported_fact)) = "some-true"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -564,7 +564,7 @@ name: honestyLevel_build_evidence, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.build_evidence)) = "build"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -572,7 +572,7 @@ name: honestyLevel_kernel_theorem, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.kernel_theorem)) = "build"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -580,7 +580,7 @@ name: honestyLevel_fixture_result, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.fixture_result)) = "build"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -588,7 +588,7 @@ name: honestyLevel_scoped_minimum_certificate, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.scoped_minimum_certificate)) = "build"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -596,7 +596,7 @@ name: honestyLevel_benchmark_target_unmet, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.benchmark_target_unmet)) = "open"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -604,7 +604,7 @@ name: honestyLevel_benchmark_target_met, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.benchmark_target_met)) = "open"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -612,7 +612,7 @@ name: honestyLevel_benchmark_measurement, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.benchmark_measurement)) = "open"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -620,7 +620,7 @@ name: honestyLevel_external_record_acceptance, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.external_record_acceptance)) = "open"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -628,7 +628,7 @@ name: honestyLevel_version_metadata, parameters: [], statement: ((honestyLevel (ctor EvidenceKind.version_metadata)) = "open"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -636,7 +636,7 @@ name: performance_level_unpromoted, parameters: [], statement: ((project (performance) level) = "open"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -644,7 +644,7 @@ name: performance_evidence_unpromoted, parameters: [], statement: ((project (performance) evidence) = "benchmark_target_unmet"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -652,7 +652,7 @@ name: performance_disposition_unpromoted, parameters: [], statement: ((project (performance) disposition) = "measured_target_unmet"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -660,7 +660,7 @@ name: record_level_unpromoted, parameters: [], statement: ((project call{arguments: [], function: record} level) = "open"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -668,7 +668,7 @@ name: record_evidence_unpromoted, parameters: [], statement: ((project call{arguments: [], function: record} evidence) = "none"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -676,7 +676,7 @@ name: record_disposition_unpromoted, parameters: [], statement: ((project call{arguments: [], function: record} disposition) = "not_measured"), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } diff --git a/src/Uorc/Core/Basis.lex.tex b/src/Uorc/Core/Basis.lex.tex index f4909726..e0739ed1 100644 --- a/src/Uorc/Core/Basis.lex.tex +++ b/src/Uorc/Core/Basis.lex.tex @@ -305,7 +305,7 @@ name: empty_basis_lookup_is_typed, parameters: [], statement: ((atIndex (empty) 0) = (ctor Result.error [Uorc.Core.Bytes::Rope, TableError] (ctor TableError.invalidReference))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -313,7 +313,7 @@ name: basis_second_root_resolves_by_index, parameters: [], statement: ((preparedByteAt (runWork 1000 (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100000}) (start (ctor Input.chunks (cons 0x00 (cons 0xff (nil Bytes)))) (Uorc.Core.Resources::zeroUsage))) 1) = (ctor Result.ok [UInt8, BasisFailure] (255 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -329,7 +329,7 @@ name: basis_count_overflow_is_typed, parameters: [], statement: ((append (record Table {length := 18446744073709551615, root := (ctor Trie.empty)}) (ctor Uorc.Core.Bytes::Rope.empty)) = (ctor Result.error [Table, TableError] (ctor TableError.addressSpaceExhausted))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Core/ByteBuilder.lex.tex b/src/Uorc/Core/ByteBuilder.lex.tex index fc24aa33..d9318f92 100644 --- a/src/Uorc/Core/ByteBuilder.lex.tex +++ b/src/Uorc/Core/ByteBuilder.lex.tex @@ -120,8 +120,8 @@ name: byteSlice, parameters: [value : UInt8], result: (Option Bytes), - body: (if (Uorc.Core.Types::byteLess value (128 : UInt8)) then (if (Uorc.Core.Types::byteLess value (64 : UInt8)) then (if (Uorc.Core.Types::byteLess value (32 : UInt8)) then (if (Uorc.Core.Types::byteLess value (16 : UInt8)) then (if (Uorc.Core.Types::byteLess value (8 : UInt8)) then (if (Uorc.Core.Types::byteLess value (4 : UInt8)) then (if (Uorc.Core.Types::byteLess value (2 : UInt8)) then (if (Uorc.Core.Types::byteLess value (1 : UInt8)) then (ctor Option.some [Bytes] 0x00) else (ctor Option.some [Bytes] 0x01)) else (if (Uorc.Core.Types::byteLess value (3 : UInt8)) then (ctor Option.some [Bytes] 0x02) else (ctor Option.some [Bytes] 0x03))) else (if (Uorc.Core.Types::byteLess value (6 : UInt8)) then (if (Uorc.Core.Types::byteLess value (5 : UInt8)) then (ctor Option.some [Bytes] 0x04) else (ctor Option.some [Bytes] 0x05)) else (if (Uorc.Core.Types::byteLess value (7 : UInt8)) then (ctor Option.some [Bytes] 0x06) else (ctor Option.some [Bytes] 0x07)))) else (if (Uorc.Core.Types::byteLess value (12 : UInt8)) then (if (Uorc.Core.Types::byteLess value (10 : UInt8)) then (if (Uorc.Core.Types::byteLess value (9 : UInt8)) then (ctor Option.some [Bytes] 0x08) else (ctor Option.some [Bytes] 0x09)) else (if (Uorc.Core.Types::byteLess value (11 : UInt8)) then (ctor Option.some [Bytes] 0x0a) else (ctor Option.some [Bytes] 0x0b))) else (if (Uorc.Core.Types::byteLess value (14 : UInt8)) then (if (Uorc.Core.Types::byteLess value (13 : UInt8)) then (ctor Option.some [Bytes] 0x0c) else (ctor Option.some [Bytes] 0x0d)) else (if (Uorc.Core.Types::byteLess value (15 : UInt8)) then (ctor Option.some [Bytes] 0x0e) else (ctor Option.some [Bytes] 0x0f))))) else (if (Uorc.Core.Types::byteLess value (24 : UInt8)) then (if (Uorc.Core.Types::byteLess value (20 : UInt8)) then (if (Uorc.Core.Types::byteLess value (18 : UInt8)) then (if (Uorc.Core.Types::byteLess value (17 : UInt8)) then (ctor Option.some [Bytes] 0x10) else (ctor Option.some [Bytes] 0x11)) else (if (Uorc.Core.Types::byteLess value (19 : UInt8)) then (ctor Option.some [Bytes] 0x12) else (ctor Option.some [Bytes] 0x13))) else (if (Uorc.Core.Types::byteLess value (22 : UInt8)) then (if (Uorc.Core.Types::byteLess value (21 : UInt8)) then (ctor Option.some [Bytes] 0x14) else (ctor Option.some [Bytes] 0x15)) else (if (Uorc.Core.Types::byteLess value (23 : UInt8)) then (ctor Option.some [Bytes] 0x16) else (ctor Option.some [Bytes] 0x17)))) else (if (Uorc.Core.Types::byteLess value (28 : UInt8)) then (if (Uorc.Core.Types::byteLess value (26 : UInt8)) then (if (Uorc.Core.Types::byteLess value (25 : UInt8)) then (ctor Option.some [Bytes] 0x18) else (ctor Option.some [Bytes] 0x19)) else (if (Uorc.Core.Types::byteLess value (27 : UInt8)) then (ctor Option.some [Bytes] 0x1a) else (ctor Option.some [Bytes] 0x1b))) else (if (Uorc.Core.Types::byteLess value (30 : UInt8)) then (if (Uorc.Core.Types::byteLess value (29 : UInt8)) then (ctor Option.some [Bytes] 0x1c) else (ctor Option.some [Bytes] 0x1d)) else (if (Uorc.Core.Types::byteLess value (31 : UInt8)) then (ctor Option.some [Bytes] 0x1e) else (ctor Option.some [Bytes] 0x1f)))))) else (if (Uorc.Core.Types::byteLess value (48 : UInt8)) then (if (Uorc.Core.Types::byteLess value (40 : UInt8)) then (if (Uorc.Core.Types::byteLess value (36 : UInt8)) then (if (Uorc.Core.Types::byteLess value (34 : UInt8)) then (if (Uorc.Core.Types::byteLess value (33 : UInt8)) then (ctor Option.some [Bytes] 0x20) else (ctor Option.some [Bytes] 0x21)) else (if (Uorc.Core.Types::byteLess value (35 : UInt8)) then (ctor Option.some [Bytes] 0x22) else (ctor Option.some [Bytes] 0x23))) else (if (Uorc.Core.Types::byteLess value (38 : UInt8)) then (if (Uorc.Core.Types::byteLess value (37 : UInt8)) then (ctor Option.some [Bytes] 0x24) else (ctor Option.some [Bytes] 0x25)) else (if (Uorc.Core.Types::byteLess value (39 : UInt8)) then (ctor Option.some [Bytes] 0x26) else (ctor Option.some [Bytes] 0x27)))) else (if (Uorc.Core.Types::byteLess value (44 : UInt8)) then (if (Uorc.Core.Types::byteLess value (42 : UInt8)) then (if (Uorc.Core.Types::byteLess value (41 : UInt8)) then (ctor Option.some [Bytes] 0x28) else (ctor Option.some [Bytes] 0x29)) else (if (Uorc.Core.Types::byteLess value (43 : UInt8)) then (ctor Option.some [Bytes] 0x2a) else (ctor Option.some [Bytes] 0x2b))) else (if (Uorc.Core.Types::byteLess value (46 : UInt8)) then (if (Uorc.Core.Types::byteLess value (45 : UInt8)) then (ctor Option.some [Bytes] 0x2c) else (ctor Option.some [Bytes] 0x2d)) else (if (Uorc.Core.Types::byteLess value (47 : UInt8)) then (ctor Option.some [Bytes] 0x2e) else (ctor Option.some [Bytes] 0x2f))))) else (if (Uorc.Core.Types::byteLess value (56 : UInt8)) then (if (Uorc.Core.Types::byteLess value (52 : UInt8)) then (if (Uorc.Core.Types::byteLess value (50 : UInt8)) then (if (Uorc.Core.Types::byteLess value (49 : UInt8)) then (ctor Option.some [Bytes] 0x30) else (ctor Option.some [Bytes] 0x31)) else (if (Uorc.Core.Types::byteLess value (51 : UInt8)) then (ctor Option.some [Bytes] 0x32) else (ctor Option.some [Bytes] 0x33))) else (if (Uorc.Core.Types::byteLess value (54 : UInt8)) then (if (Uorc.Core.Types::byteLess value (53 : UInt8)) then (ctor Option.some [Bytes] 0x34) else (ctor Option.some [Bytes] 0x35)) else (if (Uorc.Core.Types::byteLess value (55 : UInt8)) then (ctor Option.some [Bytes] 0x36) else (ctor Option.some [Bytes] 0x37)))) else (if (Uorc.Core.Types::byteLess value (60 : UInt8)) then (if (Uorc.Core.Types::byteLess value (58 : UInt8)) then (if (Uorc.Core.Types::byteLess value (57 : UInt8)) then (ctor Option.some [Bytes] 0x38) else (ctor Option.some [Bytes] 0x39)) else (if (Uorc.Core.Types::byteLess value (59 : UInt8)) then (ctor Option.some [Bytes] 0x3a) else (ctor Option.some [Bytes] 0x3b))) else (if (Uorc.Core.Types::byteLess value (62 : UInt8)) then (if (Uorc.Core.Types::byteLess value (61 : UInt8)) then (ctor Option.some [Bytes] 0x3c) else (ctor Option.some [Bytes] 0x3d)) else (if (Uorc.Core.Types::byteLess value (63 : UInt8)) then (ctor Option.some [Bytes] 0x3e) else (ctor Option.some [Bytes] 0x3f))))))) else (if (Uorc.Core.Types::byteLess value (96 : UInt8)) then (if (Uorc.Core.Types::byteLess value (80 : UInt8)) then (if (Uorc.Core.Types::byteLess value (72 : UInt8)) then (if (Uorc.Core.Types::byteLess value (68 : UInt8)) then (if (Uorc.Core.Types::byteLess value (66 : UInt8)) then (if (Uorc.Core.Types::byteLess value (65 : UInt8)) then (ctor Option.some [Bytes] 0x40) else (ctor Option.some [Bytes] 0x41)) else (if (Uorc.Core.Types::byteLess value (67 : UInt8)) then (ctor Option.some [Bytes] 0x42) else (ctor Option.some [Bytes] 0x43))) else (if (Uorc.Core.Types::byteLess value (70 : UInt8)) then (if (Uorc.Core.Types::byteLess value (69 : UInt8)) then (ctor Option.some [Bytes] 0x44) else (ctor Option.some [Bytes] 0x45)) else (if (Uorc.Core.Types::byteLess value (71 : UInt8)) then (ctor Option.some [Bytes] 0x46) else (ctor Option.some [Bytes] 0x47)))) else (if (Uorc.Core.Types::byteLess value (76 : UInt8)) then (if (Uorc.Core.Types::byteLess value (74 : UInt8)) then (if (Uorc.Core.Types::byteLess value (73 : UInt8)) then (ctor Option.some [Bytes] 0x48) else (ctor Option.some [Bytes] 0x49)) else (if (Uorc.Core.Types::byteLess value (75 : UInt8)) then (ctor Option.some [Bytes] 0x4a) else (ctor Option.some [Bytes] 0x4b))) else (if (Uorc.Core.Types::byteLess value (78 : UInt8)) then (if (Uorc.Core.Types::byteLess value (77 : UInt8)) then (ctor Option.some [Bytes] 0x4c) else (ctor Option.some [Bytes] 0x4d)) else (if (Uorc.Core.Types::byteLess value (79 : UInt8)) then (ctor Option.some [Bytes] 0x4e) else (ctor Option.some [Bytes] 0x4f))))) else (if (Uorc.Core.Types::byteLess value (88 : UInt8)) then (if (Uorc.Core.Types::byteLess value (84 : UInt8)) then (if (Uorc.Core.Types::byteLess value (82 : UInt8)) then (if (Uorc.Core.Types::byteLess value (81 : UInt8)) then (ctor Option.some [Bytes] 0x50) else (ctor Option.some [Bytes] 0x51)) else (if (Uorc.Core.Types::byteLess value (83 : UInt8)) then (ctor Option.some [Bytes] 0x52) else (ctor Option.some [Bytes] 0x53))) else (if (Uorc.Core.Types::byteLess value (86 : UInt8)) then (if (Uorc.Core.Types::byteLess value (85 : UInt8)) then (ctor Option.some [Bytes] 0x54) else (ctor Option.some [Bytes] 0x55)) else (if (Uorc.Core.Types::byteLess value (87 : UInt8)) then (ctor Option.some [Bytes] 0x56) else (ctor Option.some [Bytes] 0x57)))) else (if (Uorc.Core.Types::byteLess value (92 : UInt8)) then (if (Uorc.Core.Types::byteLess value (90 : UInt8)) then (if (Uorc.Core.Types::byteLess value (89 : UInt8)) then (ctor Option.some [Bytes] 0x58) else (ctor Option.some [Bytes] 0x59)) else (if (Uorc.Core.Types::byteLess value (91 : UInt8)) then (ctor Option.some [Bytes] 0x5a) else (ctor Option.some [Bytes] 0x5b))) else (if (Uorc.Core.Types::byteLess value (94 : UInt8)) then (if (Uorc.Core.Types::byteLess value (93 : UInt8)) then (ctor Option.some [Bytes] 0x5c) else (ctor Option.some [Bytes] 0x5d)) else (if (Uorc.Core.Types::byteLess value (95 : UInt8)) then (ctor Option.some [Bytes] 0x5e) else (ctor Option.some [Bytes] 0x5f)))))) else (if (Uorc.Core.Types::byteLess value (112 : UInt8)) then (if (Uorc.Core.Types::byteLess value (104 : UInt8)) then (if (Uorc.Core.Types::byteLess value (100 : UInt8)) then (if (Uorc.Core.Types::byteLess value (98 : UInt8)) then (if (Uorc.Core.Types::byteLess value (97 : UInt8)) then (ctor Option.some [Bytes] 0x60) else (ctor Option.some [Bytes] 0x61)) else (if (Uorc.Core.Types::byteLess value (99 : UInt8)) then (ctor Option.some [Bytes] 0x62) else (ctor Option.some [Bytes] 0x63))) else (if (Uorc.Core.Types::byteLess value (102 : UInt8)) then (if (Uorc.Core.Types::byteLess value (101 : UInt8)) then (ctor Option.some [Bytes] 0x64) else (ctor Option.some [Bytes] 0x65)) else (if (Uorc.Core.Types::byteLess value (103 : UInt8)) then (ctor Option.some [Bytes] 0x66) else (ctor Option.some [Bytes] 0x67)))) else (if (Uorc.Core.Types::byteLess value (108 : UInt8)) then (if (Uorc.Core.Types::byteLess value (106 : UInt8)) then (if (Uorc.Core.Types::byteLess value (105 : UInt8)) then (ctor Option.some [Bytes] 0x68) else (ctor Option.some [Bytes] 0x69)) else (if (Uorc.Core.Types::byteLess value (107 : UInt8)) then (ctor Option.some [Bytes] 0x6a) else (ctor Option.some [Bytes] 0x6b))) else (if (Uorc.Core.Types::byteLess value (110 : UInt8)) then (if (Uorc.Core.Types::byteLess value (109 : UInt8)) then (ctor Option.some [Bytes] 0x6c) else (ctor Option.some [Bytes] 0x6d)) else (if (Uorc.Core.Types::byteLess value (111 : UInt8)) then (ctor Option.some [Bytes] 0x6e) else (ctor Option.some [Bytes] 0x6f))))) else (if (Uorc.Core.Types::byteLess value (120 : UInt8)) then (if (Uorc.Core.Types::byteLess value (116 : UInt8)) then (if (Uorc.Core.Types::byteLess value (114 : UInt8)) then (if (Uorc.Core.Types::byteLess value (113 : UInt8)) then (ctor Option.some [Bytes] 0x70) else (ctor Option.some [Bytes] 0x71)) else (if (Uorc.Core.Types::byteLess value (115 : UInt8)) then (ctor Option.some [Bytes] 0x72) else (ctor Option.some [Bytes] 0x73))) else (if (Uorc.Core.Types::byteLess value (118 : UInt8)) then (if (Uorc.Core.Types::byteLess value (117 : UInt8)) then (ctor Option.some [Bytes] 0x74) else (ctor Option.some [Bytes] 0x75)) else (if (Uorc.Core.Types::byteLess value (119 : UInt8)) then (ctor Option.some [Bytes] 0x76) else (ctor Option.some [Bytes] 0x77)))) else (if (Uorc.Core.Types::byteLess value (124 : UInt8)) then (if (Uorc.Core.Types::byteLess value (122 : UInt8)) then (if (Uorc.Core.Types::byteLess value (121 : UInt8)) then (ctor Option.some [Bytes] 0x78) else (ctor Option.some [Bytes] 0x79)) else (if (Uorc.Core.Types::byteLess value (123 : UInt8)) then (ctor Option.some [Bytes] 0x7a) else (ctor Option.some [Bytes] 0x7b))) else (if (Uorc.Core.Types::byteLess value (126 : UInt8)) then (if (Uorc.Core.Types::byteLess value (125 : UInt8)) then (ctor Option.some [Bytes] 0x7c) else (ctor Option.some [Bytes] 0x7d)) else (if (Uorc.Core.Types::byteLess value (127 : UInt8)) then (ctor Option.some [Bytes] 0x7e) else (ctor Option.some [Bytes] 0x7f)))))))) else (if (Uorc.Core.Types::byteLess value (192 : UInt8)) then (if (Uorc.Core.Types::byteLess value (160 : UInt8)) then (if (Uorc.Core.Types::byteLess value (144 : UInt8)) then (if (Uorc.Core.Types::byteLess value (136 : UInt8)) then (if (Uorc.Core.Types::byteLess value (132 : UInt8)) then (if (Uorc.Core.Types::byteLess value (130 : UInt8)) then (if (Uorc.Core.Types::byteLess value (129 : UInt8)) then (ctor Option.some [Bytes] 0x80) else (ctor Option.some [Bytes] 0x81)) else (if (Uorc.Core.Types::byteLess value (131 : UInt8)) then (ctor Option.some [Bytes] 0x82) else (ctor Option.some [Bytes] 0x83))) else (if (Uorc.Core.Types::byteLess value (134 : UInt8)) then (if (Uorc.Core.Types::byteLess value (133 : UInt8)) then (ctor Option.some [Bytes] 0x84) else (ctor Option.some [Bytes] 0x85)) else (if (Uorc.Core.Types::byteLess value (135 : UInt8)) then (ctor Option.some [Bytes] 0x86) else (ctor Option.some [Bytes] 0x87)))) else (if (Uorc.Core.Types::byteLess value (140 : UInt8)) then (if (Uorc.Core.Types::byteLess value (138 : UInt8)) then (if (Uorc.Core.Types::byteLess value (137 : UInt8)) then (ctor Option.some [Bytes] 0x88) else (ctor Option.some [Bytes] 0x89)) else (if (Uorc.Core.Types::byteLess value (139 : UInt8)) then (ctor Option.some [Bytes] 0x8a) else (ctor Option.some [Bytes] 0x8b))) else (if (Uorc.Core.Types::byteLess value (142 : UInt8)) then (if (Uorc.Core.Types::byteLess value (141 : UInt8)) then (ctor Option.some [Bytes] 0x8c) else (ctor Option.some [Bytes] 0x8d)) else (if (Uorc.Core.Types::byteLess value (143 : UInt8)) then (ctor Option.some [Bytes] 0x8e) else (ctor Option.some [Bytes] 0x8f))))) else (if (Uorc.Core.Types::byteLess value (152 : UInt8)) then (if (Uorc.Core.Types::byteLess value (148 : UInt8)) then (if (Uorc.Core.Types::byteLess value (146 : UInt8)) then (if (Uorc.Core.Types::byteLess value (145 : UInt8)) then (ctor Option.some [Bytes] 0x90) else (ctor Option.some [Bytes] 0x91)) else (if (Uorc.Core.Types::byteLess value (147 : UInt8)) then (ctor Option.some [Bytes] 0x92) else (ctor Option.some [Bytes] 0x93))) else (if (Uorc.Core.Types::byteLess value (150 : UInt8)) then (if (Uorc.Core.Types::byteLess value (149 : UInt8)) then (ctor Option.some [Bytes] 0x94) else (ctor Option.some [Bytes] 0x95)) else (if (Uorc.Core.Types::byteLess value (151 : UInt8)) then (ctor Option.some [Bytes] 0x96) else (ctor Option.some [Bytes] 0x97)))) else (if (Uorc.Core.Types::byteLess value (156 : UInt8)) then (if (Uorc.Core.Types::byteLess value (154 : UInt8)) then (if (Uorc.Core.Types::byteLess value (153 : UInt8)) then (ctor Option.some [Bytes] 0x98) else (ctor Option.some [Bytes] 0x99)) else (if (Uorc.Core.Types::byteLess value (155 : UInt8)) then (ctor Option.some [Bytes] 0x9a) else (ctor Option.some [Bytes] 0x9b))) else (if (Uorc.Core.Types::byteLess value (158 : UInt8)) then (if (Uorc.Core.Types::byteLess value (157 : UInt8)) then (ctor Option.some [Bytes] 0x9c) else (ctor Option.some [Bytes] 0x9d)) else (if (Uorc.Core.Types::byteLess value (159 : UInt8)) then (ctor Option.some [Bytes] 0x9e) else (ctor Option.some [Bytes] 0x9f)))))) else (if (Uorc.Core.Types::byteLess value (176 : UInt8)) then (if (Uorc.Core.Types::byteLess value (168 : UInt8)) then (if (Uorc.Core.Types::byteLess value (164 : UInt8)) then (if (Uorc.Core.Types::byteLess value (162 : UInt8)) then (if (Uorc.Core.Types::byteLess value (161 : UInt8)) then (ctor Option.some [Bytes] 0xa0) else (ctor Option.some [Bytes] 0xa1)) else (if (Uorc.Core.Types::byteLess value (163 : UInt8)) then (ctor Option.some [Bytes] 0xa2) else (ctor Option.some [Bytes] 0xa3))) else (if (Uorc.Core.Types::byteLess value (166 : UInt8)) then (if (Uorc.Core.Types::byteLess value (165 : UInt8)) then (ctor Option.some [Bytes] 0xa4) else (ctor Option.some [Bytes] 0xa5)) else (if (Uorc.Core.Types::byteLess value (167 : UInt8)) then (ctor Option.some [Bytes] 0xa6) else (ctor Option.some [Bytes] 0xa7)))) else (if (Uorc.Core.Types::byteLess value (172 : UInt8)) then (if (Uorc.Core.Types::byteLess value (170 : UInt8)) then (if (Uorc.Core.Types::byteLess value (169 : UInt8)) then (ctor Option.some [Bytes] 0xa8) else (ctor Option.some [Bytes] 0xa9)) else (if (Uorc.Core.Types::byteLess value (171 : UInt8)) then (ctor Option.some [Bytes] 0xaa) else (ctor Option.some [Bytes] 0xab))) else (if (Uorc.Core.Types::byteLess value (174 : UInt8)) then (if (Uorc.Core.Types::byteLess value (173 : UInt8)) then (ctor Option.some [Bytes] 0xac) else (ctor Option.some [Bytes] 0xad)) else (if (Uorc.Core.Types::byteLess value (175 : UInt8)) then (ctor Option.some [Bytes] 0xae) else (ctor Option.some [Bytes] 0xaf))))) else (if (Uorc.Core.Types::byteLess value (184 : UInt8)) then (if (Uorc.Core.Types::byteLess value (180 : UInt8)) then (if (Uorc.Core.Types::byteLess value (178 : UInt8)) then (if (Uorc.Core.Types::byteLess value (177 : UInt8)) then (ctor Option.some [Bytes] 0xb0) else (ctor Option.some [Bytes] 0xb1)) else (if (Uorc.Core.Types::byteLess value (179 : UInt8)) then (ctor Option.some [Bytes] 0xb2) else (ctor Option.some [Bytes] 0xb3))) else (if (Uorc.Core.Types::byteLess value (182 : UInt8)) then (if (Uorc.Core.Types::byteLess value (181 : UInt8)) then (ctor Option.some [Bytes] 0xb4) else (ctor Option.some [Bytes] 0xb5)) else (if (Uorc.Core.Types::byteLess value (183 : UInt8)) then (ctor Option.some [Bytes] 0xb6) else (ctor Option.some [Bytes] 0xb7)))) else (if (Uorc.Core.Types::byteLess value (188 : UInt8)) then (if (Uorc.Core.Types::byteLess value (186 : UInt8)) then (if (Uorc.Core.Types::byteLess value (185 : UInt8)) then (ctor Option.some [Bytes] 0xb8) else (ctor Option.some [Bytes] 0xb9)) else (if (Uorc.Core.Types::byteLess value (187 : UInt8)) then (ctor Option.some [Bytes] 0xba) else (ctor Option.some [Bytes] 0xbb))) else (if (Uorc.Core.Types::byteLess value (190 : UInt8)) then (if (Uorc.Core.Types::byteLess value (189 : UInt8)) then (ctor Option.some [Bytes] 0xbc) else (ctor Option.some [Bytes] 0xbd)) else (if (Uorc.Core.Types::byteLess value (191 : UInt8)) then (ctor Option.some [Bytes] 0xbe) else (ctor Option.some [Bytes] 0xbf))))))) else (if (Uorc.Core.Types::byteLess value (224 : UInt8)) then (if (Uorc.Core.Types::byteLess value (208 : UInt8)) then (if (Uorc.Core.Types::byteLess value (200 : UInt8)) then (if (Uorc.Core.Types::byteLess value (196 : UInt8)) then (if (Uorc.Core.Types::byteLess value (194 : UInt8)) then (if (Uorc.Core.Types::byteLess value (193 : UInt8)) then (ctor Option.some [Bytes] 0xc0) else (ctor Option.some [Bytes] 0xc1)) else (if (Uorc.Core.Types::byteLess value (195 : UInt8)) then (ctor Option.some [Bytes] 0xc2) else (ctor Option.some [Bytes] 0xc3))) else (if (Uorc.Core.Types::byteLess value (198 : UInt8)) then (if (Uorc.Core.Types::byteLess value (197 : UInt8)) then (ctor Option.some [Bytes] 0xc4) else (ctor Option.some [Bytes] 0xc5)) else (if (Uorc.Core.Types::byteLess value (199 : UInt8)) then (ctor Option.some [Bytes] 0xc6) else (ctor Option.some [Bytes] 0xc7)))) else (if (Uorc.Core.Types::byteLess value (204 : UInt8)) then (if (Uorc.Core.Types::byteLess value (202 : UInt8)) then (if (Uorc.Core.Types::byteLess value (201 : UInt8)) then (ctor Option.some [Bytes] 0xc8) else (ctor Option.some [Bytes] 0xc9)) else (if (Uorc.Core.Types::byteLess value (203 : UInt8)) then (ctor Option.some [Bytes] 0xca) else (ctor Option.some [Bytes] 0xcb))) else (if (Uorc.Core.Types::byteLess value (206 : UInt8)) then (if (Uorc.Core.Types::byteLess value (205 : UInt8)) then (ctor Option.some [Bytes] 0xcc) else (ctor Option.some [Bytes] 0xcd)) else (if (Uorc.Core.Types::byteLess value (207 : UInt8)) then (ctor Option.some [Bytes] 0xce) else (ctor Option.some [Bytes] 0xcf))))) else (if (Uorc.Core.Types::byteLess value (216 : UInt8)) then (if (Uorc.Core.Types::byteLess value (212 : UInt8)) then (if (Uorc.Core.Types::byteLess value (210 : UInt8)) then (if (Uorc.Core.Types::byteLess value (209 : UInt8)) then (ctor Option.some [Bytes] 0xd0) else (ctor Option.some [Bytes] 0xd1)) else (if (Uorc.Core.Types::byteLess value (211 : UInt8)) then (ctor Option.some [Bytes] 0xd2) else (ctor Option.some [Bytes] 0xd3))) else (if (Uorc.Core.Types::byteLess value (214 : UInt8)) then (if (Uorc.Core.Types::byteLess value (213 : UInt8)) then (ctor Option.some [Bytes] 0xd4) else (ctor Option.some [Bytes] 0xd5)) else (if (Uorc.Core.Types::byteLess value (215 : UInt8)) then (ctor Option.some [Bytes] 0xd6) else (ctor Option.some [Bytes] 0xd7)))) else (if (Uorc.Core.Types::byteLess value (220 : UInt8)) then (if (Uorc.Core.Types::byteLess value (218 : UInt8)) then (if (Uorc.Core.Types::byteLess value (217 : UInt8)) then (ctor Option.some [Bytes] 0xd8) else (ctor Option.some [Bytes] 0xd9)) else (if (Uorc.Core.Types::byteLess value (219 : UInt8)) then (ctor Option.some [Bytes] 0xda) else (ctor Option.some [Bytes] 0xdb))) else (if (Uorc.Core.Types::byteLess value (222 : UInt8)) then (if (Uorc.Core.Types::byteLess value (221 : UInt8)) then (ctor Option.some [Bytes] 0xdc) else (ctor Option.some [Bytes] 0xdd)) else (if (Uorc.Core.Types::byteLess value (223 : UInt8)) then (ctor Option.some [Bytes] 0xde) else (ctor Option.some [Bytes] 0xdf)))))) else (if (Uorc.Core.Types::byteLess value (240 : UInt8)) then (if (Uorc.Core.Types::byteLess value (232 : UInt8)) then (if (Uorc.Core.Types::byteLess value (228 : UInt8)) then (if (Uorc.Core.Types::byteLess value (226 : UInt8)) then (if (Uorc.Core.Types::byteLess value (225 : UInt8)) then (ctor Option.some [Bytes] 0xe0) else (ctor Option.some [Bytes] 0xe1)) else (if (Uorc.Core.Types::byteLess value (227 : UInt8)) then (ctor Option.some [Bytes] 0xe2) else (ctor Option.some [Bytes] 0xe3))) else (if (Uorc.Core.Types::byteLess value (230 : UInt8)) then (if (Uorc.Core.Types::byteLess value (229 : UInt8)) then (ctor Option.some [Bytes] 0xe4) else (ctor Option.some [Bytes] 0xe5)) else (if (Uorc.Core.Types::byteLess value (231 : UInt8)) then (ctor Option.some [Bytes] 0xe6) else (ctor Option.some [Bytes] 0xe7)))) else (if (Uorc.Core.Types::byteLess value (236 : UInt8)) then (if (Uorc.Core.Types::byteLess value (234 : UInt8)) then (if (Uorc.Core.Types::byteLess value (233 : UInt8)) then (ctor Option.some [Bytes] 0xe8) else (ctor Option.some [Bytes] 0xe9)) else (if (Uorc.Core.Types::byteLess value (235 : UInt8)) then (ctor Option.some [Bytes] 0xea) else (ctor Option.some [Bytes] 0xeb))) else (if (Uorc.Core.Types::byteLess value (238 : UInt8)) then (if (Uorc.Core.Types::byteLess value (237 : UInt8)) then (ctor Option.some [Bytes] 0xec) else (ctor Option.some [Bytes] 0xed)) else (if (Uorc.Core.Types::byteLess value (239 : UInt8)) then (ctor Option.some [Bytes] 0xee) else (ctor Option.some [Bytes] 0xef))))) else (if (Uorc.Core.Types::byteLess value (248 : UInt8)) then (if (Uorc.Core.Types::byteLess value (244 : UInt8)) then (if (Uorc.Core.Types::byteLess value (242 : UInt8)) then (if (Uorc.Core.Types::byteLess value (241 : UInt8)) then (ctor Option.some [Bytes] 0xf0) else (ctor Option.some [Bytes] 0xf1)) else (if (Uorc.Core.Types::byteLess value (243 : UInt8)) then (ctor Option.some [Bytes] 0xf2) else (ctor Option.some [Bytes] 0xf3))) else (if (Uorc.Core.Types::byteLess value (246 : UInt8)) then (if (Uorc.Core.Types::byteLess value (245 : UInt8)) then (ctor Option.some [Bytes] 0xf4) else (ctor Option.some [Bytes] 0xf5)) else (if (Uorc.Core.Types::byteLess value (247 : UInt8)) then (ctor Option.some [Bytes] 0xf6) else (ctor Option.some [Bytes] 0xf7)))) else (if (Uorc.Core.Types::byteLess value (252 : UInt8)) then (if (Uorc.Core.Types::byteLess value (250 : UInt8)) then (if (Uorc.Core.Types::byteLess value (249 : UInt8)) then (ctor Option.some [Bytes] 0xf8) else (ctor Option.some [Bytes] 0xf9)) else (if (Uorc.Core.Types::byteLess value (251 : UInt8)) then (ctor Option.some [Bytes] 0xfa) else (ctor Option.some [Bytes] 0xfb))) else (if (Uorc.Core.Types::byteLess value (254 : UInt8)) then (if (Uorc.Core.Types::byteLess value (253 : UInt8)) then (ctor Option.some [Bytes] 0xfc) else (ctor Option.some [Bytes] 0xfd)) else (if (Uorc.Core.Types::byteLess value (255 : UInt8)) then (ctor Option.some [Bytes] 0xfe) else (ctor Option.some [Bytes] 0xff))))))))), - axioms: [Quot.sound, propext] + body: (Uorc.Core.Types::byteCell value), + axioms: [] } definition{ @@ -157,7 +157,7 @@ | Uorc.Core.Bytes::WorkEvent.sequenceDone completedRope => (ctor Event.finished completedRope) | Uorc.Core.Bytes::WorkEvent.byteDone resultByte => (ctor Event.failed (ctor Error.invalidState)) | Uorc.Core.Bytes::WorkEvent.failed ropeError => (ctor Event.failed (ctor Error.rope ropeError)))), - axioms: [Quot.sound, propext] + axioms: [] } definition{ @@ -171,7 +171,7 @@ | Event.appended builder => (ctor Event.appended builder) | Event.finished rope => (ctor Event.finished rope) | Event.failed error => (ctor Event.failed error))), - axioms: [Quot.sound, propext], + axioms: [], recursive_argument: fuel } @@ -205,8 +205,8 @@ name: empty_builder_finishes_without_payload_copy, parameters: [], statement: ((step (finish (empty))) = (ctor Event.finished (ctor Uorc.Core.Bytes::Rope.empty))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ @@ -228,7 +228,7 @@ parameters: [workValue : Work], statement: ((runEvents 0 workValue) = (ctor Event.advanced workValue)), proof: reflexivity{}, - axioms: [Quot.sound, propext] + axioms: [] } theorem{ @@ -298,16 +298,16 @@ name: finishing_bins_preserves_byte_order, parameters: [], statement: ((runEvents 20 (finish (record Builder {completed := (ctor Uorc.Core.Bytes::Rope.empty), bins := (cons (ctor Option.some [Bytes] 0x33) (cons (ctor Option.some [Bytes] 0x1122) (nil (Option Bytes)))), buffered := 3, capacity := 4096}))) = (ctor Event.finished (ctor Uorc.Core.Bytes::Rope.leaf 0x112233))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ name: full_leaf_coalesces_and_drops_singleton_bins, parameters: [], statement: ((runEvents 20 (appendByte (record Builder {completed := (ctor Uorc.Core.Bytes::Rope.empty), bins := (cons (ctor Option.some [Bytes] 0x11) (nil (Option Bytes))), buffered := 1, capacity := 2}) (34 : UInt8))) = (ctor Event.appended (record Builder {completed := (ctor Uorc.Core.Bytes::Rope.leaf 0x1122), bins := (nil (Option Bytes)), buffered := 0, capacity := 2}))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ @@ -340,7 +340,7 @@ ], statement: ((step (ctor Work.tail completed (cons (ctor Option.none [Bytes]) olderBins) tailBytes)) = (ctor Event.advanced (ctor Work.tail completed olderBins tailBytes))), proof: reflexivity{}, - axioms: [Quot.sound, propext] + axioms: [] } theorem{ @@ -353,7 +353,7 @@ ], statement: ((step (ctor Work.rebuilding completed bins 0 count capacity)) = (ctor Event.appended (record Builder {completed := completed, bins := bins, buffered := count, capacity := capacity}))), proof: reflexivity{}, - axioms: [Quot.sound, propext] + axioms: [] } theorem{ @@ -361,7 +361,7 @@ parameters: [completed : Uorc.Core.Bytes::Rope], statement: ((step (ctor Work.tail completed (nil (Option Bytes)) 0x)) = (ctor Event.finished completed)), proof: reflexivity{}, - axioms: [Quot.sound, propext] + axioms: [] } definition{ @@ -405,7 +405,7 @@ ], statement: ((runEvents (fuel + 1) (ctor Work.rebuilding completed binValues (vacancies + 1) count capacity)) = (runEvents fuel (ctor Work.rebuilding completed (cons (ctor Option.none [Bytes]) binValues) vacancies count capacity))), proof: reflexivity{}, - axioms: [Quot.sound, propext] + axioms: [] } theorem{ @@ -430,7 +430,7 @@ generalizing: [binValues], scrutinee: vacancies }, - axioms: [Quot.sound, propext] + axioms: [propext] } \end{semanticmodule} \end{lexlean} diff --git a/src/Uorc/Core/ExecutionCredit.lex.tex b/src/Uorc/Core/ExecutionCredit.lex.tex index cdeaeed3..10e3f347 100644 --- a/src/Uorc/Core/ExecutionCredit.lex.tex +++ b/src/Uorc/Core/ExecutionCredit.lex.tex @@ -357,7 +357,7 @@ name: failed_future_is_hidden_with_unpaid_credit, parameters: [], statement: ((terminalObserved (runWork 2 (record Uorc.Core.StepMachine::Context {graph := (record Uorc.Core.Graph::Graph {blocks := (nil Uorc.Core.Graph::Block), entry := 0}), basis := (nil Bytes), budget := (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100000}), checked := (ctor Option.none [Uorc.Core.Validation::CheckedGraph]), indexedBasis := (ctor Option.none [Uorc.Core.Basis::Table])}) (record Cursor {future := (ctor Future.failed (ctor Uorc.Core.StepMachine::Failure.semantic (ctor Uorc.Core.Types::SemanticError.divisionByZero)) (record Uorc.Core.Resources::Usage {steps := 3, liveCells := 0, peakCells := 0, outputBytes := 0, frames := 0})), committedUsage := (Uorc.Core.Resources::zeroUsage), paidSteps := 0, remainingDebt := 3, consumedUnits := 0, attemptUnits := 0, decoderUnits := 0, availableCredit := 0, prepaidUnits := 0, planningUnits := 0, planningCredit := 0, plannedBound := (ctor Option.none [Nat])}))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -365,7 +365,7 @@ name: unpaid_failed_future_is_rejected_even_with_more_credit, parameters: [], statement: ((terminalObserved (runWork 3 (record Uorc.Core.StepMachine::Context {graph := (record Uorc.Core.Graph::Graph {blocks := (nil Uorc.Core.Graph::Block), entry := 0}), basis := (nil Bytes), budget := (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100000}), checked := (ctor Option.none [Uorc.Core.Validation::CheckedGraph]), indexedBasis := (ctor Option.none [Uorc.Core.Basis::Table])}) (record Cursor {future := (ctor Future.failed (ctor Uorc.Core.StepMachine::Failure.semantic (ctor Uorc.Core.Types::SemanticError.divisionByZero)) (record Uorc.Core.Resources::Usage {steps := 3, liveCells := 0, peakCells := 0, outputBytes := 0, frames := 0})), committedUsage := (Uorc.Core.Resources::zeroUsage), paidSteps := 0, remainingDebt := 3, consumedUnits := 0, attemptUnits := 0, decoderUnits := 0, availableCredit := 0, prepaidUnits := 0, planningUnits := 0, planningCredit := 0, plannedBound := (ctor Option.none [Nat])}))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Core/Lifetime.lex.tex b/src/Uorc/Core/Lifetime.lex.tex index 2b424efd..64376947 100644 --- a/src/Uorc/Core/Lifetime.lex.tex +++ b/src/Uorc/Core/Lifetime.lex.tex @@ -506,7 +506,7 @@ name: incremental_schedule_matches_reference_vector, parameters: [], statement: ((runFor 64 (start (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (1 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.sequenceConstant 0xff) (nil Uorc.Core.Graph::Instruction))), returnDistance := 1}))) = (ctor Result.ok [CursorEvent, Uorc.Core.Types::StaticError] (ctor CursorEvent.complete (cons (nil Nat) (cons (cons 0 (nil Nat)) (cons (nil Nat) (cons (cons 1 (nil Nat)) (nil (List Nat))))))))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Core/ReferenceSemantics.lex.tex b/src/Uorc/Core/ReferenceSemantics.lex.tex index 2491d76e..f51ba6a7 100644 --- a/src/Uorc/Core/ReferenceSemantics.lex.tex +++ b/src/Uorc/Core/ReferenceSemantics.lex.tex @@ -856,7 +856,7 @@ name: final_scan_update_failure_is_not_ignored, parameters: [], statement: ((scanLoop 1 0 (record BlockMeaning {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.byte), run := (fun (arguments : (List Value)) => (ctor Result.ok [Value, Failure] (ctor Value.byte 7)))}) (nil Value) (record BlockMeaning {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.natural), run := (fun (arguments : (List Value)) => (ctor Result.error [Value, Failure] (ctor Failure.semantic (ctor SemanticError.arithmeticOverflow))))}) (nil Value) (ctor Value.natural 18446744073709551615) (sequenceFromBytes 0x)) = (ctor Result.error [Value, Failure] (ctor Failure.semantic (ctor SemanticError.arithmeticOverflow)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -864,7 +864,7 @@ name: split_rejects_trailing_bytes, parameters: [], statement: ((splitObjects (cons 1 (nil Nat)) (sequenceFromBytes 0x00ff)) = (ctor Result.error [(List Sequence), Failure] (ctor Failure.semantic (ctor SemanticError.outputMismatch)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -872,7 +872,7 @@ name: split_rejects_short_output, parameters: [], statement: ((splitObjects (cons 3 (nil Nat)) (sequenceFromBytes 0x00ff)) = (ctor Result.error [(List Sequence), Failure] (ctor Failure.semantic (ctor SemanticError.outputMismatch)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -880,7 +880,7 @@ name: rope_reference_length_ignores_runtime_caches, parameters: [], statement: ((project (sequenceFromRope (ctor Uorc.Core.Bytes::Rope.branch 999 777 (ctor Uorc.Core.Bytes::Rope.leaf 0x11) (ctor Uorc.Core.Bytes::Rope.leaf 0x22))) length) = 2), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -888,7 +888,7 @@ name: rope_reference_contents_ignore_runtime_caches, parameters: [], statement: ((apply (project (sequenceFromRope (ctor Uorc.Core.Bytes::Rope.branch 999 777 (ctor Uorc.Core.Bytes::Rope.leaf 0x11) (ctor Uorc.Core.Bytes::Rope.leaf 0x22))) read) 1) = (ctor Option.some [Nat] 34)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -896,7 +896,7 @@ name: rope_view_reference_reads_its_window, parameters: [], statement: ((apply (project (sequenceFromRope (ctor Uorc.Core.Bytes::Rope.view 0x00112233 1 2)) read) 1) = (ctor Option.some [Nat] 34)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -904,7 +904,7 @@ name: rope_view_reference_hides_backing_suffix, parameters: [], statement: ((apply (project (sequenceFromRope (ctor Uorc.Core.Bytes::Rope.view 0x00112233 1 2)) read) 2) = (ctor Option.none [Nat])), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Core/Slots.lex.tex b/src/Uorc/Core/Slots.lex.tex index 3727007f..8ff68c9f 100644 --- a/src/Uorc/Core/Slots.lex.tex +++ b/src/Uorc/Core/Slots.lex.tex @@ -155,7 +155,7 @@ name: slot_index_vector_0, parameters: [], statement: ((readTrie 64 (writeTrie 64 (ctor SlotTrie.empty) (0 : UInt64) (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))) (0 : UInt64)) = (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -163,7 +163,7 @@ name: slot_index_vector_1, parameters: [], statement: ((readTrie 64 (writeTrie 64 (ctor SlotTrie.empty) (1 : UInt64) (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))) (1 : UInt64)) = (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -171,7 +171,7 @@ name: slot_index_vector_255, parameters: [], statement: ((readTrie 64 (writeTrie 64 (ctor SlotTrie.empty) (255 : UInt64) (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))) (255 : UInt64)) = (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -179,7 +179,7 @@ name: slot_index_vector_256, parameters: [], statement: ((readTrie 64 (writeTrie 64 (ctor SlotTrie.empty) (256 : UInt64) (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))) (256 : UInt64)) = (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -187,7 +187,7 @@ name: slot_index_vector_4096, parameters: [], statement: ((readTrie 64 (writeTrie 64 (ctor SlotTrie.empty) (4096 : UInt64) (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))) (4096 : UInt64)) = (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -195,7 +195,7 @@ name: slot_index_vector_65536, parameters: [], statement: ((readTrie 64 (writeTrie 64 (ctor SlotTrie.empty) (65536 : UInt64) (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))) (65536 : UInt64)) = (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -203,7 +203,7 @@ name: slot_index_vector_9223372036854775808, parameters: [], statement: ((readTrie 64 (writeTrie 64 (ctor SlotTrie.empty) (9223372036854775808 : UInt64) (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))) (9223372036854775808 : UInt64)) = (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -211,7 +211,7 @@ name: slot_index_vector_18446744073709551615, parameters: [], statement: ((readTrie 64 (writeTrie 64 (ctor SlotTrie.empty) (18446744073709551615 : UInt64) (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))) (18446744073709551615 : UInt64)) = (ctor Option.some [Uorc.Core.Types::Value] (ctor Uorc.Core.Types::Value.byte (7 : UInt8)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -219,7 +219,7 @@ name: slot_count_overflow_is_typed, parameters: [], statement: ((appendSlot (record SlotTable {length := 18446744073709551615, root := (ctor SlotTrie.empty)}) (ctor Uorc.Core.Types::Value.byte (0 : UInt8))) = (ctor Result.error [SlotTable, SlotError] (ctor SlotError.addressSpaceExhausted))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Core/StepMachine.lex.tex b/src/Uorc/Core/StepMachine.lex.tex index 429c4ff3..f84b9d3d 100644 --- a/src/Uorc/Core/StepMachine.lex.tex +++ b/src/Uorc/Core/StepMachine.lex.tex @@ -1359,7 +1359,7 @@ name: iteration_coordinate_exhaustion_is_typed, parameters: [], statement: ((iterationNatural 18446744073709551616) = (ctor Result.error [Uorc.Core.Types::Value, Failure] (ctor Failure.operational (ctor Uorc.Core.Resources::OperationalError.addressSpaceExhausted)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Core/Store.lex.tex b/src/Uorc/Core/Store.lex.tex index 181e987f..d1e5ae45 100644 --- a/src/Uorc/Core/Store.lex.tex +++ b/src/Uorc/Core/Store.lex.tex @@ -202,7 +202,7 @@ name: store_read_written_0, parameters: [], statement: ((readStore (writeStore (newStore (7 : UInt8)) (0 : UInt64) (13 : UInt8)) (0 : UInt64)) = (13 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -210,7 +210,7 @@ name: store_remove_default_0, parameters: [], statement: ((writeStore (writeStore (newStore (7 : UInt8)) (0 : UInt64) (13 : UInt8)) (0 : UInt64) (7 : UInt8)) = (newStore (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -218,7 +218,7 @@ name: store_preserve_alias_0, parameters: [], statement: ((readStore (newStore (7 : UInt8)) (0 : UInt64)) = (7 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -226,7 +226,7 @@ name: store_read_written_1, parameters: [], statement: ((readStore (writeStore (newStore (7 : UInt8)) (1 : UInt64) (13 : UInt8)) (1 : UInt64)) = (13 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -234,7 +234,7 @@ name: store_remove_default_1, parameters: [], statement: ((writeStore (writeStore (newStore (7 : UInt8)) (1 : UInt64) (13 : UInt8)) (1 : UInt64) (7 : UInt8)) = (newStore (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -242,7 +242,7 @@ name: store_preserve_alias_1, parameters: [], statement: ((readStore (newStore (7 : UInt8)) (1 : UInt64)) = (7 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -250,7 +250,7 @@ name: store_read_written_2, parameters: [], statement: ((readStore (writeStore (newStore (7 : UInt8)) (2 : UInt64) (13 : UInt8)) (2 : UInt64)) = (13 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -258,7 +258,7 @@ name: store_remove_default_2, parameters: [], statement: ((writeStore (writeStore (newStore (7 : UInt8)) (2 : UInt64) (13 : UInt8)) (2 : UInt64) (7 : UInt8)) = (newStore (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -266,7 +266,7 @@ name: store_preserve_alias_2, parameters: [], statement: ((readStore (newStore (7 : UInt8)) (2 : UInt64)) = (7 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -274,7 +274,7 @@ name: store_read_written_255, parameters: [], statement: ((readStore (writeStore (newStore (7 : UInt8)) (255 : UInt64) (13 : UInt8)) (255 : UInt64)) = (13 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -282,7 +282,7 @@ name: store_remove_default_255, parameters: [], statement: ((writeStore (writeStore (newStore (7 : UInt8)) (255 : UInt64) (13 : UInt8)) (255 : UInt64) (7 : UInt8)) = (newStore (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -290,7 +290,7 @@ name: store_preserve_alias_255, parameters: [], statement: ((readStore (newStore (7 : UInt8)) (255 : UInt64)) = (7 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -298,7 +298,7 @@ name: store_read_written_256, parameters: [], statement: ((readStore (writeStore (newStore (7 : UInt8)) (256 : UInt64) (13 : UInt8)) (256 : UInt64)) = (13 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -306,7 +306,7 @@ name: store_remove_default_256, parameters: [], statement: ((writeStore (writeStore (newStore (7 : UInt8)) (256 : UInt64) (13 : UInt8)) (256 : UInt64) (7 : UInt8)) = (newStore (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -314,7 +314,7 @@ name: store_preserve_alias_256, parameters: [], statement: ((readStore (newStore (7 : UInt8)) (256 : UInt64)) = (7 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -322,7 +322,7 @@ name: store_read_written_4096, parameters: [], statement: ((readStore (writeStore (newStore (7 : UInt8)) (4096 : UInt64) (13 : UInt8)) (4096 : UInt64)) = (13 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -330,7 +330,7 @@ name: store_remove_default_4096, parameters: [], statement: ((writeStore (writeStore (newStore (7 : UInt8)) (4096 : UInt64) (13 : UInt8)) (4096 : UInt64) (7 : UInt8)) = (newStore (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -338,7 +338,7 @@ name: store_preserve_alias_4096, parameters: [], statement: ((readStore (newStore (7 : UInt8)) (4096 : UInt64)) = (7 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -346,7 +346,7 @@ name: store_read_written_65536, parameters: [], statement: ((readStore (writeStore (newStore (7 : UInt8)) (65536 : UInt64) (13 : UInt8)) (65536 : UInt64)) = (13 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -354,7 +354,7 @@ name: store_remove_default_65536, parameters: [], statement: ((writeStore (writeStore (newStore (7 : UInt8)) (65536 : UInt64) (13 : UInt8)) (65536 : UInt64) (7 : UInt8)) = (newStore (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -362,7 +362,7 @@ name: store_preserve_alias_65536, parameters: [], statement: ((readStore (newStore (7 : UInt8)) (65536 : UInt64)) = (7 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -370,7 +370,7 @@ name: store_read_written_9223372036854775808, parameters: [], statement: ((readStore (writeStore (newStore (7 : UInt8)) (9223372036854775808 : UInt64) (13 : UInt8)) (9223372036854775808 : UInt64)) = (13 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -378,7 +378,7 @@ name: store_remove_default_9223372036854775808, parameters: [], statement: ((writeStore (writeStore (newStore (7 : UInt8)) (9223372036854775808 : UInt64) (13 : UInt8)) (9223372036854775808 : UInt64) (7 : UInt8)) = (newStore (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -386,7 +386,7 @@ name: store_preserve_alias_9223372036854775808, parameters: [], statement: ((readStore (newStore (7 : UInt8)) (9223372036854775808 : UInt64)) = (7 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -394,7 +394,7 @@ name: store_read_written_18446744073709551615, parameters: [], statement: ((readStore (writeStore (newStore (7 : UInt8)) (18446744073709551615 : UInt64) (13 : UInt8)) (18446744073709551615 : UInt64)) = (13 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -402,7 +402,7 @@ name: store_remove_default_18446744073709551615, parameters: [], statement: ((writeStore (writeStore (newStore (7 : UInt8)) (18446744073709551615 : UInt64) (13 : UInt8)) (18446744073709551615 : UInt64) (7 : UInt8)) = (newStore (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -410,7 +410,7 @@ name: store_preserve_alias_18446744073709551615, parameters: [], statement: ((readStore (newStore (7 : UInt8)) (18446744073709551615 : UInt64)) = (7 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -434,7 +434,7 @@ name: store_noninterference_vector, parameters: [], statement: ((readStore (writeStore (writeStore (newStore (0 : UInt8)) (1 : UInt64) (17 : UInt8)) (2 : UInt64) (23 : UInt8)) (1 : UInt64)) = (17 : UInt8)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Core/Tests.lex.tex b/src/Uorc/Core/Tests.lex.tex index fcb5a04c..8b3eb6f0 100644 --- a/src/Uorc/Core/Tests.lex.tex +++ b/src/Uorc/Core/Tests.lex.tex @@ -59,7 +59,7 @@ name: literal_length_empty, parameters: [], statement: ((resultLength (Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100}))) = (ctor Result.ok [Nat, Uorc.Core.StepMachine::Failure] 0)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -67,7 +67,7 @@ name: literal_length_00, parameters: [], statement: ((resultLength (Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x00) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100}))) = (ctor Result.ok [Nat, Uorc.Core.StepMachine::Failure] 1)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -75,7 +75,7 @@ name: literal_last_00, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x00) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 0) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (0 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -83,7 +83,7 @@ name: literal_length_ff, parameters: [], statement: ((resultLength (Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0xff) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100}))) = (ctor Result.ok [Nat, Uorc.Core.StepMachine::Failure] 1)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -91,7 +91,7 @@ name: literal_last_ff, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0xff) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 0) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (255 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -99,7 +99,7 @@ name: literal_length_00ff1080, parameters: [], statement: ((resultLength (Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x00ff1080) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100}))) = (ctor Result.ok [Nat, Uorc.Core.StepMachine::Failure] 4)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -107,7 +107,7 @@ name: literal_last_00ff1080, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x00ff1080) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 3) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (128 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -115,7 +115,7 @@ name: literal_length_all_bytes, parameters: [], statement: ((resultLength (Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e7f808182838485868788898a8b8c8d8e8f909192939495969798999a9b9c9d9e9fa0a1a2a3a4a5a6a7a8a9aaabacadaeafb0b1b2b3b4b5b6b7b8b9babbbcbdbebfc0c1c2c3c4c5c6c7c8c9cacbcccdcecfd0d1d2d3d4d5d6d7d8d9dadbdcdddedfe0e1e2e3e4e5e6e7e8e9eaebecedeeeff0f1f2f3f4f5f6f7f8f9fafbfcfdfeff) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100}))) = (ctor Result.ok [Nat, Uorc.Core.StepMachine::Failure] 256)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -123,7 +123,7 @@ name: literal_last_all_bytes, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e7f808182838485868788898a8b8c8d8e8f909192939495969798999a9b9c9d9e9fa0a1a2a3a4a5a6a7a8a9aaabacadaeafb0b1b2b3b4b5b6b7b8b9babbbcbdbebfc0c1c2c3c4c5c6c7c8c9cacbcccdcecfd0d1d2d3d4d5d6d7d8d9dadbdcdddedfe0e1e2e3e4e5e6e7e8e9eaebecedeeeff0f1f2f3f4f5f6f7f8f9fafbfcfdfeff) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 255) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (255 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -131,7 +131,7 @@ name: output_budget_enforced, parameters: [], statement: ((Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x00ff) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 1, maxFrames := 100})) = (ctor Result.error [Uorc.Core.StepMachine::Execution, Uorc.Core.StepMachine::Failure] (ctor Uorc.Core.StepMachine::Failure.operational (ctor Uorc.Core.Resources::OperationalError.outputLimit)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -139,7 +139,7 @@ name: step_budget_enforced, parameters: [], statement: ((Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x00ff) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 0, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) = (ctor Result.error [Uorc.Core.StepMachine::Execution, Uorc.Core.StepMachine::Failure] (ctor Uorc.Core.StepMachine::Failure.operational (ctor Uorc.Core.Resources::OperationalError.stepLimit)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -147,7 +147,7 @@ name: frame_budget_enforced, parameters: [], statement: ((Uorc.Core.StepMachine::runGraph (Uorc.Core.Graph::literalGraph 0x00ff) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 0})) = (ctor Result.error [Uorc.Core.StepMachine::Execution, Uorc.Core.StepMachine::Failure] (ctor Uorc.Core.StepMachine::Failure.operational (ctor Uorc.Core.Resources::OperationalError.frameLimit)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -155,7 +155,7 @@ name: unused_division_still_fails, parameters: [], statement: ((Uorc.Core.StepMachine::runGraph (record Uorc.Core.Graph::Graph {blocks := (cons (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (1 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (0 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalDivide 2 1) (cons (ctor Uorc.Core.Graph::Instruction.sequenceConstant 0xaa) (nil Uorc.Core.Graph::Instruction))))), returnDistance := 1}) (nil Uorc.Core.Graph::Block)), entry := 0}) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) = (ctor Result.error [Uorc.Core.StepMachine::Execution, Uorc.Core.StepMachine::Failure] (ctor Uorc.Core.StepMachine::Failure.semantic (ctor Uorc.Core.Types::SemanticError.divisionByZero)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -163,7 +163,7 @@ name: apply_adds_one, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (record Uorc.Core.Graph::Graph {blocks := (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType)), result := (ctor Uorc.Core.Types::ValueType.natural), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (1 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalAdd 2 1) (nil Uorc.Core.Graph::Instruction))), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (41 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.apply 1 (cons 1 (nil Nat))) (cons (ctor Uorc.Core.Graph::Instruction.naturalToByte 1) (cons (ctor Uorc.Core.Graph::Instruction.singletonSequence 1) (nil Uorc.Core.Graph::Instruction))))), returnDistance := 1}) (nil Uorc.Core.Graph::Block))), entry := 1}) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 0) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (42 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -171,7 +171,7 @@ name: fold_iterates_state, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (record Uorc.Core.Graph::Graph {blocks := (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.natural), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (1 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalAdd 2 1) (nil Uorc.Core.Graph::Instruction))), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (3 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (0 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.fold 2 1 1 (nil Nat)) (cons (ctor Uorc.Core.Graph::Instruction.naturalToByte 1) (cons (ctor Uorc.Core.Graph::Instruction.singletonSequence 1) (nil Uorc.Core.Graph::Instruction)))))), returnDistance := 1}) (nil Uorc.Core.Graph::Block))), entry := 1}) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 0) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (3 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -179,7 +179,7 @@ name: tabulate_length, parameters: [], statement: ((resultLength (Uorc.Core.StepMachine::runGraph (record Uorc.Core.Graph::Graph {blocks := (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.byte) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.byte), instructions := (nil Uorc.Core.Graph::Instruction), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (3 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.byteConstant (7 : UInt8)) (cons (ctor Uorc.Core.Graph::Instruction.tabulate 2 1 (cons 1 (nil Nat))) (nil Uorc.Core.Graph::Instruction)))), returnDistance := 1}) (nil Uorc.Core.Graph::Block))), entry := 1}) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100}))) = (ctor Result.ok [Nat, Uorc.Core.StepMachine::Failure] 3)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -187,7 +187,7 @@ name: tabulate_last, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (record Uorc.Core.Graph::Graph {blocks := (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.byte) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.byte), instructions := (nil Uorc.Core.Graph::Instruction), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (3 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.byteConstant (7 : UInt8)) (cons (ctor Uorc.Core.Graph::Instruction.tabulate 2 1 (cons 1 (nil Nat))) (nil Uorc.Core.Graph::Instruction)))), returnDistance := 1}) (nil Uorc.Core.Graph::Block))), entry := 1}) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 2) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (7 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -195,7 +195,7 @@ name: scan_observes_before_update_0, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (record Uorc.Core.Graph::Graph {blocks := (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.byte), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalToByte 1) (nil Uorc.Core.Graph::Instruction)), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.natural), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (1 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalAdd 2 1) (nil Uorc.Core.Graph::Instruction))), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (3 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (0 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.scan 2 1 2 (nil Nat) 1 (nil Nat)) (nil Uorc.Core.Graph::Instruction)))), returnDistance := 1}) (nil Uorc.Core.Graph::Block)))), entry := 2}) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 0) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (0 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -203,7 +203,7 @@ name: scan_observes_before_update_1, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (record Uorc.Core.Graph::Graph {blocks := (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.byte), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalToByte 1) (nil Uorc.Core.Graph::Instruction)), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.natural), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (1 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalAdd 2 1) (nil Uorc.Core.Graph::Instruction))), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (3 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (0 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.scan 2 1 2 (nil Nat) 1 (nil Nat)) (nil Uorc.Core.Graph::Instruction)))), returnDistance := 1}) (nil Uorc.Core.Graph::Block)))), entry := 2}) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 1) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (1 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -211,7 +211,7 @@ name: scan_observes_before_update_2, parameters: [], statement: ((resultByteAt (Uorc.Core.StepMachine::runGraph (record Uorc.Core.Graph::Graph {blocks := (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.byte), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalToByte 1) (nil Uorc.Core.Graph::Instruction)), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.natural), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (1 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalAdd 2 1) (nil Uorc.Core.Graph::Instruction))), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (3 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (0 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.scan 2 1 2 (nil Nat) 1 (nil Nat)) (nil Uorc.Core.Graph::Instruction)))), returnDistance := 1}) (nil Uorc.Core.Graph::Block)))), entry := 2}) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) 2) = (ctor Result.ok [UInt8, Uorc.Core.StepMachine::Failure] (2 : UInt8))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -219,7 +219,7 @@ name: scan_final_update_can_fail, parameters: [], statement: ((Uorc.Core.StepMachine::runGraph (record Uorc.Core.Graph::Graph {blocks := (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.byte), instructions := (cons (ctor Uorc.Core.Graph::Instruction.byteConstant (7 : UInt8)) (nil Uorc.Core.Graph::Instruction)), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (cons (ctor Uorc.Core.Types::ValueType.natural) (cons (ctor Uorc.Core.Types::ValueType.natural) (nil Uorc.Core.Types::ValueType))), result := (ctor Uorc.Core.Types::ValueType.natural), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (1 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalAdd 2 1) (nil Uorc.Core.Graph::Instruction))), returnDistance := 1}) (cons (record Uorc.Core.Graph::Block {parameters := (nil Uorc.Core.Types::ValueType), result := (ctor Uorc.Core.Types::ValueType.sequence), instructions := (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (1 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.naturalConstant (18446744073709551615 : UInt64)) (cons (ctor Uorc.Core.Graph::Instruction.scan 2 1 2 (nil Nat) 1 (nil Nat)) (nil Uorc.Core.Graph::Instruction)))), returnDistance := 1}) (nil Uorc.Core.Graph::Block)))), entry := 2}) (nil Bytes) (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100})) = (ctor Result.error [Uorc.Core.StepMachine::Execution, Uorc.Core.StepMachine::Failure] (ctor Uorc.Core.StepMachine::Failure.semantic (ctor Uorc.Core.Types::SemanticError.arithmeticOverflow)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -268,7 +268,7 @@ name: semantic_failure_retains_reserved_read_work, parameters: [], statement: ((divisionFailureWithBudget 100000) = (ctor Option.some [Nat] 327)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -276,7 +276,7 @@ name: resource_rejection_retains_previous_usage_only, parameters: [], statement: ((divisionFailureWithBudget 326) = (ctor Option.some [Nat] 7)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -284,7 +284,7 @@ name: initialization_invariant_failure_retains_entry_work, parameters: [], statement: ((initializationFailureSteps (Uorc.Core.StepMachine::initializeFromUsage (record Uorc.Core.StepMachine::Context {graph := (record Uorc.Core.Graph::Graph {blocks := (nil Uorc.Core.Graph::Block), entry := 0}), basis := (nil Bytes), budget := (record Uorc.Core.Resources::Budget {maxSteps := 100000, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100000}), checked := (ctor Option.none [Uorc.Core.Validation::CheckedGraph]), indexedBasis := (ctor Option.none [Uorc.Core.Basis::Table])}) (record Uorc.Core.Resources::Usage {steps := 7, liveCells := 0, peakCells := 0, outputBytes := 0, frames := 0}))) = (ctor Option.some [Nat] 264)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -292,7 +292,7 @@ name: initialization_budget_failure_charges_no_rejected_work, parameters: [], statement: ((initializationFailureSteps (Uorc.Core.StepMachine::initializeFromUsage (record Uorc.Core.StepMachine::Context {graph := (record Uorc.Core.Graph::Graph {blocks := (nil Uorc.Core.Graph::Block), entry := 0}), basis := (nil Bytes), budget := (record Uorc.Core.Resources::Budget {maxSteps := 263, maxLiveCells := 100000, maxOutputBytes := 100000, maxFrames := 100000}), checked := (ctor Option.none [Uorc.Core.Validation::CheckedGraph]), indexedBasis := (ctor Option.none [Uorc.Core.Basis::Table])}) (record Uorc.Core.Resources::Usage {steps := 7, liveCells := 0, peakCells := 0, outputBytes := 0, frames := 0}))) = (ctor Option.some [Nat] 7)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Core/Types.lex.tex b/src/Uorc/Core/Types.lex.tex index 91a3d995..788ce7a0 100644 --- a/src/Uorc/Core/Types.lex.tex +++ b/src/Uorc/Core/Types.lex.tex @@ -315,19 +315,35 @@ body: (prim append (prim append (prim append (prim append (cons 0x00 (cons 0x01 (cons 0x02 (cons 0x03 (cons 0x04 (cons 0x05 (cons 0x06 (cons 0x07 (cons 0x08 (cons 0x09 (cons 0x0a (cons 0x0b (cons 0x0c (cons 0x0d (cons 0x0e (cons 0x0f (nil Bytes))))))))))))))))) (cons 0x10 (cons 0x11 (cons 0x12 (cons 0x13 (cons 0x14 (cons 0x15 (cons 0x16 (cons 0x17 (cons 0x18 (cons 0x19 (cons 0x1a (cons 0x1b (cons 0x1c (cons 0x1d (cons 0x1e (cons 0x1f (nil Bytes))))))))))))))))) : (List Bytes)) (prim append (cons 0x20 (cons 0x21 (cons 0x22 (cons 0x23 (cons 0x24 (cons 0x25 (cons 0x26 (cons 0x27 (cons 0x28 (cons 0x29 (cons 0x2a (cons 0x2b (cons 0x2c (cons 0x2d (cons 0x2e (cons 0x2f (nil Bytes))))))))))))))))) (cons 0x30 (cons 0x31 (cons 0x32 (cons 0x33 (cons 0x34 (cons 0x35 (cons 0x36 (cons 0x37 (cons 0x38 (cons 0x39 (cons 0x3a (cons 0x3b (cons 0x3c (cons 0x3d (cons 0x3e (cons 0x3f (nil Bytes))))))))))))))))) : (List Bytes)) : (List Bytes)) (prim append (prim append (cons 0x40 (cons 0x41 (cons 0x42 (cons 0x43 (cons 0x44 (cons 0x45 (cons 0x46 (cons 0x47 (cons 0x48 (cons 0x49 (cons 0x4a (cons 0x4b (cons 0x4c (cons 0x4d (cons 0x4e (cons 0x4f (nil Bytes))))))))))))))))) (cons 0x50 (cons 0x51 (cons 0x52 (cons 0x53 (cons 0x54 (cons 0x55 (cons 0x56 (cons 0x57 (cons 0x58 (cons 0x59 (cons 0x5a (cons 0x5b (cons 0x5c (cons 0x5d (cons 0x5e (cons 0x5f (nil Bytes))))))))))))))))) : (List Bytes)) (prim append (cons 0x60 (cons 0x61 (cons 0x62 (cons 0x63 (cons 0x64 (cons 0x65 (cons 0x66 (cons 0x67 (cons 0x68 (cons 0x69 (cons 0x6a (cons 0x6b (cons 0x6c (cons 0x6d (cons 0x6e (cons 0x6f (nil Bytes))))))))))))))))) (cons 0x70 (cons 0x71 (cons 0x72 (cons 0x73 (cons 0x74 (cons 0x75 (cons 0x76 (cons 0x77 (cons 0x78 (cons 0x79 (cons 0x7a (cons 0x7b (cons 0x7c (cons 0x7d (cons 0x7e (cons 0x7f (nil Bytes))))))))))))))))) : (List Bytes)) : (List Bytes)) : (List Bytes)) (prim append (prim append (prim append (cons 0x80 (cons 0x81 (cons 0x82 (cons 0x83 (cons 0x84 (cons 0x85 (cons 0x86 (cons 0x87 (cons 0x88 (cons 0x89 (cons 0x8a (cons 0x8b (cons 0x8c (cons 0x8d (cons 0x8e (cons 0x8f (nil Bytes))))))))))))))))) (cons 0x90 (cons 0x91 (cons 0x92 (cons 0x93 (cons 0x94 (cons 0x95 (cons 0x96 (cons 0x97 (cons 0x98 (cons 0x99 (cons 0x9a (cons 0x9b (cons 0x9c (cons 0x9d (cons 0x9e (cons 0x9f (nil Bytes))))))))))))))))) : (List Bytes)) (prim append (cons 0xa0 (cons 0xa1 (cons 0xa2 (cons 0xa3 (cons 0xa4 (cons 0xa5 (cons 0xa6 (cons 0xa7 (cons 0xa8 (cons 0xa9 (cons 0xaa (cons 0xab (cons 0xac (cons 0xad (cons 0xae (cons 0xaf (nil Bytes))))))))))))))))) (cons 0xb0 (cons 0xb1 (cons 0xb2 (cons 0xb3 (cons 0xb4 (cons 0xb5 (cons 0xb6 (cons 0xb7 (cons 0xb8 (cons 0xb9 (cons 0xba (cons 0xbb (cons 0xbc (cons 0xbd (cons 0xbe (cons 0xbf (nil Bytes))))))))))))))))) : (List Bytes)) : (List Bytes)) (prim append (prim append (cons 0xc0 (cons 0xc1 (cons 0xc2 (cons 0xc3 (cons 0xc4 (cons 0xc5 (cons 0xc6 (cons 0xc7 (cons 0xc8 (cons 0xc9 (cons 0xca (cons 0xcb (cons 0xcc (cons 0xcd (cons 0xce (cons 0xcf (nil Bytes))))))))))))))))) (cons 0xd0 (cons 0xd1 (cons 0xd2 (cons 0xd3 (cons 0xd4 (cons 0xd5 (cons 0xd6 (cons 0xd7 (cons 0xd8 (cons 0xd9 (cons 0xda (cons 0xdb (cons 0xdc (cons 0xdd (cons 0xde (cons 0xdf (nil Bytes))))))))))))))))) : (List Bytes)) (prim append (cons 0xe0 (cons 0xe1 (cons 0xe2 (cons 0xe3 (cons 0xe4 (cons 0xe5 (cons 0xe6 (cons 0xe7 (cons 0xe8 (cons 0xe9 (cons 0xea (cons 0xeb (cons 0xec (cons 0xed (cons 0xee (cons 0xef (nil Bytes))))))))))))))))) (cons 0xf0 (cons 0xf1 (cons 0xf2 (cons 0xf3 (cons 0xf4 (cons 0xf5 (cons 0xf6 (cons 0xf7 (cons 0xf8 (cons 0xf9 (cons 0xfa (cons 0xfb (cons 0xfc (cons 0xfd (cons 0xfe (cons 0xff (nil Bytes))))))))))))))))) : (List Bytes)) : (List Bytes)) : (List Bytes)) : (List Bytes)) } +definition{ + name: byteCell, + parameters: [value : UInt8], + result: (Option Bytes), + body: (prim update 0x00 0 value : (Option Bytes)), + axioms: [] +} + +definition{ + name: singletonCell, + parameters: [cell : (Option Bytes)], + result: Bytes, + body: (match cell | Option.none => 0x | Option.some single => single), + axioms: [] +} + definition{ name: singletonSequence, parameters: [value : UInt8], result: Bytes, - body: (if (byteLess value (128 : UInt8)) then (if (byteLess value (64 : UInt8)) then (if (byteLess value (32 : UInt8)) then (if (byteLess value (16 : UInt8)) then (if (byteLess value (8 : UInt8)) then (if (byteLess value (4 : UInt8)) then (if (byteLess value (2 : UInt8)) then (if (byteLess value (1 : UInt8)) then 0x00 else 0x01) else (if (byteLess value (3 : UInt8)) then 0x02 else 0x03)) else (if (byteLess value (6 : UInt8)) then (if (byteLess value (5 : UInt8)) then 0x04 else 0x05) else (if (byteLess value (7 : UInt8)) then 0x06 else 0x07))) else (if (byteLess value (12 : UInt8)) then (if (byteLess value (10 : UInt8)) then (if (byteLess value (9 : UInt8)) then 0x08 else 0x09) else (if (byteLess value (11 : UInt8)) then 0x0a else 0x0b)) else (if (byteLess value (14 : UInt8)) then (if (byteLess value (13 : UInt8)) then 0x0c else 0x0d) else (if (byteLess value (15 : UInt8)) then 0x0e else 0x0f)))) else (if (byteLess value (24 : UInt8)) then (if (byteLess value (20 : UInt8)) then (if (byteLess value (18 : UInt8)) then (if (byteLess value (17 : UInt8)) then 0x10 else 0x11) else (if (byteLess value (19 : UInt8)) then 0x12 else 0x13)) else (if (byteLess value (22 : UInt8)) then (if (byteLess value (21 : UInt8)) then 0x14 else 0x15) else (if (byteLess value (23 : UInt8)) then 0x16 else 0x17))) else (if (byteLess value (28 : UInt8)) then (if (byteLess value (26 : UInt8)) then (if (byteLess value (25 : UInt8)) then 0x18 else 0x19) else (if (byteLess value (27 : UInt8)) then 0x1a else 0x1b)) else (if (byteLess value (30 : UInt8)) then (if (byteLess value (29 : UInt8)) then 0x1c else 0x1d) else (if (byteLess value (31 : UInt8)) then 0x1e else 0x1f))))) else (if (byteLess value (48 : UInt8)) then (if (byteLess value (40 : UInt8)) then (if (byteLess value (36 : UInt8)) then (if (byteLess value (34 : UInt8)) then (if (byteLess value (33 : UInt8)) then 0x20 else 0x21) else (if (byteLess value (35 : UInt8)) then 0x22 else 0x23)) else (if (byteLess value (38 : UInt8)) then (if (byteLess value (37 : UInt8)) then 0x24 else 0x25) else (if (byteLess value (39 : UInt8)) then 0x26 else 0x27))) else (if (byteLess value (44 : UInt8)) then (if (byteLess value (42 : UInt8)) then (if (byteLess value (41 : UInt8)) then 0x28 else 0x29) else (if (byteLess value (43 : UInt8)) then 0x2a else 0x2b)) else (if (byteLess value (46 : UInt8)) then (if (byteLess value (45 : UInt8)) then 0x2c else 0x2d) else (if (byteLess value (47 : UInt8)) then 0x2e else 0x2f)))) else (if (byteLess value (56 : UInt8)) then (if (byteLess value (52 : UInt8)) then (if (byteLess value (50 : UInt8)) then (if (byteLess value (49 : UInt8)) then 0x30 else 0x31) else (if (byteLess value (51 : UInt8)) then 0x32 else 0x33)) else (if (byteLess value (54 : UInt8)) then (if (byteLess value (53 : UInt8)) then 0x34 else 0x35) else (if (byteLess value (55 : UInt8)) then 0x36 else 0x37))) else (if (byteLess value (60 : UInt8)) then (if (byteLess value (58 : UInt8)) then (if (byteLess value (57 : UInt8)) then 0x38 else 0x39) else (if (byteLess value (59 : UInt8)) then 0x3a else 0x3b)) else (if (byteLess value (62 : UInt8)) then (if (byteLess value (61 : UInt8)) then 0x3c else 0x3d) else (if (byteLess value (63 : UInt8)) then 0x3e else 0x3f)))))) else (if (byteLess value (96 : UInt8)) then (if (byteLess value (80 : UInt8)) then (if (byteLess value (72 : UInt8)) then (if (byteLess value (68 : UInt8)) then (if (byteLess value (66 : UInt8)) then (if (byteLess value (65 : UInt8)) then 0x40 else 0x41) else (if (byteLess value (67 : UInt8)) then 0x42 else 0x43)) else (if (byteLess value (70 : UInt8)) then (if (byteLess value (69 : UInt8)) then 0x44 else 0x45) else (if (byteLess value (71 : UInt8)) then 0x46 else 0x47))) else (if (byteLess value (76 : UInt8)) then (if (byteLess value (74 : UInt8)) then (if (byteLess value (73 : UInt8)) then 0x48 else 0x49) else (if (byteLess value (75 : UInt8)) then 0x4a else 0x4b)) else (if (byteLess value (78 : UInt8)) then (if (byteLess value (77 : UInt8)) then 0x4c else 0x4d) else (if (byteLess value (79 : UInt8)) then 0x4e else 0x4f)))) else (if (byteLess value (88 : UInt8)) then (if (byteLess value (84 : UInt8)) then (if (byteLess value (82 : UInt8)) then (if (byteLess value (81 : UInt8)) then 0x50 else 0x51) else (if (byteLess value (83 : UInt8)) then 0x52 else 0x53)) else (if (byteLess value (86 : UInt8)) then (if (byteLess value (85 : UInt8)) then 0x54 else 0x55) else (if (byteLess value (87 : UInt8)) then 0x56 else 0x57))) else (if (byteLess value (92 : UInt8)) then (if (byteLess value (90 : UInt8)) then (if (byteLess value (89 : UInt8)) then 0x58 else 0x59) else (if (byteLess value (91 : UInt8)) then 0x5a else 0x5b)) else (if (byteLess value (94 : UInt8)) then (if (byteLess value (93 : UInt8)) then 0x5c else 0x5d) else (if (byteLess value (95 : UInt8)) then 0x5e else 0x5f))))) else (if (byteLess value (112 : UInt8)) then (if (byteLess value (104 : UInt8)) then (if (byteLess value (100 : UInt8)) then (if (byteLess value (98 : UInt8)) then (if (byteLess value (97 : UInt8)) then 0x60 else 0x61) else (if (byteLess value (99 : UInt8)) then 0x62 else 0x63)) else (if (byteLess value (102 : UInt8)) then (if (byteLess value (101 : UInt8)) then 0x64 else 0x65) else (if (byteLess value (103 : UInt8)) then 0x66 else 0x67))) else (if (byteLess value (108 : UInt8)) then (if (byteLess value (106 : UInt8)) then (if (byteLess value (105 : UInt8)) then 0x68 else 0x69) else (if (byteLess value (107 : UInt8)) then 0x6a else 0x6b)) else (if (byteLess value (110 : UInt8)) then (if (byteLess value (109 : UInt8)) then 0x6c else 0x6d) else (if (byteLess value (111 : UInt8)) then 0x6e else 0x6f)))) else (if (byteLess value (120 : UInt8)) then (if (byteLess value (116 : UInt8)) then (if (byteLess value (114 : UInt8)) then (if (byteLess value (113 : UInt8)) then 0x70 else 0x71) else (if (byteLess value (115 : UInt8)) then 0x72 else 0x73)) else (if (byteLess value (118 : UInt8)) then (if (byteLess value (117 : UInt8)) then 0x74 else 0x75) else (if (byteLess value (119 : UInt8)) then 0x76 else 0x77))) else (if (byteLess value (124 : UInt8)) then (if (byteLess value (122 : UInt8)) then (if (byteLess value (121 : UInt8)) then 0x78 else 0x79) else (if (byteLess value (123 : UInt8)) then 0x7a else 0x7b)) else (if (byteLess value (126 : UInt8)) then (if (byteLess value (125 : UInt8)) then 0x7c else 0x7d) else (if (byteLess value (127 : UInt8)) then 0x7e else 0x7f))))))) else (if (byteLess value (192 : UInt8)) then (if (byteLess value (160 : UInt8)) then (if (byteLess value (144 : UInt8)) then (if (byteLess value (136 : UInt8)) then (if (byteLess value (132 : UInt8)) then (if (byteLess value (130 : UInt8)) then (if (byteLess value (129 : UInt8)) then 0x80 else 0x81) else (if (byteLess value (131 : UInt8)) then 0x82 else 0x83)) else (if (byteLess value (134 : UInt8)) then (if (byteLess value (133 : UInt8)) then 0x84 else 0x85) else (if (byteLess value (135 : UInt8)) then 0x86 else 0x87))) else (if (byteLess value (140 : UInt8)) then (if (byteLess value (138 : UInt8)) then (if (byteLess value (137 : UInt8)) then 0x88 else 0x89) else (if (byteLess value (139 : UInt8)) then 0x8a else 0x8b)) else (if (byteLess value (142 : UInt8)) then (if (byteLess value (141 : UInt8)) then 0x8c else 0x8d) else (if (byteLess value (143 : UInt8)) then 0x8e else 0x8f)))) else (if (byteLess value (152 : UInt8)) then (if (byteLess value (148 : UInt8)) then (if (byteLess value (146 : UInt8)) then (if (byteLess value (145 : UInt8)) then 0x90 else 0x91) else (if (byteLess value (147 : UInt8)) then 0x92 else 0x93)) else (if (byteLess value (150 : UInt8)) then (if (byteLess value (149 : UInt8)) then 0x94 else 0x95) else (if (byteLess value (151 : UInt8)) then 0x96 else 0x97))) else (if (byteLess value (156 : UInt8)) then (if (byteLess value (154 : UInt8)) then (if (byteLess value (153 : UInt8)) then 0x98 else 0x99) else (if (byteLess value (155 : UInt8)) then 0x9a else 0x9b)) else (if (byteLess value (158 : UInt8)) then (if (byteLess value (157 : UInt8)) then 0x9c else 0x9d) else (if (byteLess value (159 : UInt8)) then 0x9e else 0x9f))))) else (if (byteLess value (176 : UInt8)) then (if (byteLess value (168 : UInt8)) then (if (byteLess value (164 : UInt8)) then (if (byteLess value (162 : UInt8)) then (if (byteLess value (161 : UInt8)) then 0xa0 else 0xa1) else (if (byteLess value (163 : UInt8)) then 0xa2 else 0xa3)) else (if (byteLess value (166 : UInt8)) then (if (byteLess value (165 : UInt8)) then 0xa4 else 0xa5) else (if (byteLess value (167 : UInt8)) then 0xa6 else 0xa7))) else (if (byteLess value (172 : UInt8)) then (if (byteLess value (170 : UInt8)) then (if (byteLess value (169 : UInt8)) then 0xa8 else 0xa9) else (if (byteLess value (171 : UInt8)) then 0xaa else 0xab)) else (if (byteLess value (174 : UInt8)) then (if (byteLess value (173 : UInt8)) then 0xac else 0xad) else (if (byteLess value (175 : UInt8)) then 0xae else 0xaf)))) else (if (byteLess value (184 : UInt8)) then (if (byteLess value (180 : UInt8)) then (if (byteLess value (178 : UInt8)) then (if (byteLess value (177 : UInt8)) then 0xb0 else 0xb1) else (if (byteLess value (179 : UInt8)) then 0xb2 else 0xb3)) else (if (byteLess value (182 : UInt8)) then (if (byteLess value (181 : UInt8)) then 0xb4 else 0xb5) else (if (byteLess value (183 : UInt8)) then 0xb6 else 0xb7))) else (if (byteLess value (188 : UInt8)) then (if (byteLess value (186 : UInt8)) then (if (byteLess value (185 : UInt8)) then 0xb8 else 0xb9) else (if (byteLess value (187 : UInt8)) then 0xba else 0xbb)) else (if (byteLess value (190 : UInt8)) then (if (byteLess value (189 : UInt8)) then 0xbc else 0xbd) else (if (byteLess value (191 : UInt8)) then 0xbe else 0xbf)))))) else (if (byteLess value (224 : UInt8)) then (if (byteLess value (208 : UInt8)) then (if (byteLess value (200 : UInt8)) then (if (byteLess value (196 : UInt8)) then (if (byteLess value (194 : UInt8)) then (if (byteLess value (193 : UInt8)) then 0xc0 else 0xc1) else (if (byteLess value (195 : UInt8)) then 0xc2 else 0xc3)) else (if (byteLess value (198 : UInt8)) then (if (byteLess value (197 : UInt8)) then 0xc4 else 0xc5) else (if (byteLess value (199 : UInt8)) then 0xc6 else 0xc7))) else (if (byteLess value (204 : UInt8)) then (if (byteLess value (202 : UInt8)) then (if (byteLess value (201 : UInt8)) then 0xc8 else 0xc9) else (if (byteLess value (203 : UInt8)) then 0xca else 0xcb)) else (if (byteLess value (206 : UInt8)) then (if (byteLess value (205 : UInt8)) then 0xcc else 0xcd) else (if (byteLess value (207 : UInt8)) then 0xce else 0xcf)))) else (if (byteLess value (216 : UInt8)) then (if (byteLess value (212 : UInt8)) then (if (byteLess value (210 : UInt8)) then (if (byteLess value (209 : UInt8)) then 0xd0 else 0xd1) else (if (byteLess value (211 : UInt8)) then 0xd2 else 0xd3)) else (if (byteLess value (214 : UInt8)) then (if (byteLess value (213 : UInt8)) then 0xd4 else 0xd5) else (if (byteLess value (215 : UInt8)) then 0xd6 else 0xd7))) else (if (byteLess value (220 : UInt8)) then (if (byteLess value (218 : UInt8)) then (if (byteLess value (217 : UInt8)) then 0xd8 else 0xd9) else (if (byteLess value (219 : UInt8)) then 0xda else 0xdb)) else (if (byteLess value (222 : UInt8)) then (if (byteLess value (221 : UInt8)) then 0xdc else 0xdd) else (if (byteLess value (223 : UInt8)) then 0xde else 0xdf))))) else (if (byteLess value (240 : UInt8)) then (if (byteLess value (232 : UInt8)) then (if (byteLess value (228 : UInt8)) then (if (byteLess value (226 : UInt8)) then (if (byteLess value (225 : UInt8)) then 0xe0 else 0xe1) else (if (byteLess value (227 : UInt8)) then 0xe2 else 0xe3)) else (if (byteLess value (230 : UInt8)) then (if (byteLess value (229 : UInt8)) then 0xe4 else 0xe5) else (if (byteLess value (231 : UInt8)) then 0xe6 else 0xe7))) else (if (byteLess value (236 : UInt8)) then (if (byteLess value (234 : UInt8)) then (if (byteLess value (233 : UInt8)) then 0xe8 else 0xe9) else (if (byteLess value (235 : UInt8)) then 0xea else 0xeb)) else (if (byteLess value (238 : UInt8)) then (if (byteLess value (237 : UInt8)) then 0xec else 0xed) else (if (byteLess value (239 : UInt8)) then 0xee else 0xef)))) else (if (byteLess value (248 : UInt8)) then (if (byteLess value (244 : UInt8)) then (if (byteLess value (242 : UInt8)) then (if (byteLess value (241 : UInt8)) then 0xf0 else 0xf1) else (if (byteLess value (243 : UInt8)) then 0xf2 else 0xf3)) else (if (byteLess value (246 : UInt8)) then (if (byteLess value (245 : UInt8)) then 0xf4 else 0xf5) else (if (byteLess value (247 : UInt8)) then 0xf6 else 0xf7))) else (if (byteLess value (252 : UInt8)) then (if (byteLess value (250 : UInt8)) then (if (byteLess value (249 : UInt8)) then 0xf8 else 0xf9) else (if (byteLess value (251 : UInt8)) then 0xfa else 0xfb)) else (if (byteLess value (254 : UInt8)) then (if (byteLess value (253 : UInt8)) then 0xfc else 0xfd) else (if (byteLess value (255 : UInt8)) then 0xfe else 0xff)))))))), - axioms: [Quot.sound, propext] + body: (singletonCell (byteCell value)), + axioms: [] } theorem{ name: word_nat_vector_0, parameters: [], statement: ((wordToNat (0 : UInt64)) = 0), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -335,7 +351,7 @@ name: nat_word_vector_0, parameters: [], statement: ((wordOfNat 0) = (ctor Option.some [UInt64] (0 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -343,7 +359,7 @@ name: word_nat_vector_1, parameters: [], statement: ((wordToNat (1 : UInt64)) = 1), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -351,7 +367,7 @@ name: nat_word_vector_1, parameters: [], statement: ((wordOfNat 1) = (ctor Option.some [UInt64] (1 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -359,7 +375,7 @@ name: word_nat_vector_127, parameters: [], statement: ((wordToNat (127 : UInt64)) = 127), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -367,7 +383,7 @@ name: nat_word_vector_127, parameters: [], statement: ((wordOfNat 127) = (ctor Option.some [UInt64] (127 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -375,7 +391,7 @@ name: word_nat_vector_128, parameters: [], statement: ((wordToNat (128 : UInt64)) = 128), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -383,7 +399,7 @@ name: nat_word_vector_128, parameters: [], statement: ((wordOfNat 128) = (ctor Option.some [UInt64] (128 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -391,7 +407,7 @@ name: word_nat_vector_255, parameters: [], statement: ((wordToNat (255 : UInt64)) = 255), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -399,7 +415,7 @@ name: nat_word_vector_255, parameters: [], statement: ((wordOfNat 255) = (ctor Option.some [UInt64] (255 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -407,7 +423,7 @@ name: word_nat_vector_256, parameters: [], statement: ((wordToNat (256 : UInt64)) = 256), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -415,7 +431,7 @@ name: nat_word_vector_256, parameters: [], statement: ((wordOfNat 256) = (ctor Option.some [UInt64] (256 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -423,7 +439,7 @@ name: word_nat_vector_4096, parameters: [], statement: ((wordToNat (4096 : UInt64)) = 4096), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -431,7 +447,7 @@ name: nat_word_vector_4096, parameters: [], statement: ((wordOfNat 4096) = (ctor Option.some [UInt64] (4096 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -439,7 +455,7 @@ name: word_nat_vector_4294967295, parameters: [], statement: ((wordToNat (4294967295 : UInt64)) = 4294967295), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -447,7 +463,7 @@ name: nat_word_vector_4294967295, parameters: [], statement: ((wordOfNat 4294967295) = (ctor Option.some [UInt64] (4294967295 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -455,7 +471,7 @@ name: word_nat_vector_9223372036854775808, parameters: [], statement: ((wordToNat (9223372036854775808 : UInt64)) = 9223372036854775808), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -463,7 +479,7 @@ name: nat_word_vector_9223372036854775808, parameters: [], statement: ((wordOfNat 9223372036854775808) = (ctor Option.some [UInt64] (9223372036854775808 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -471,7 +487,7 @@ name: word_nat_vector_18446744073709551615, parameters: [], statement: ((wordToNat (18446744073709551615 : UInt64)) = 18446744073709551615), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -479,7 +495,7 @@ name: nat_word_vector_18446744073709551615, parameters: [], statement: ((wordOfNat 18446744073709551615) = (ctor Option.some [UInt64] (18446744073709551615 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -487,7 +503,7 @@ name: nat_word_overflow_18446744073709551616, parameters: [], statement: ((wordOfNat 18446744073709551616) = (ctor Option.none [UInt64])), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -495,7 +511,7 @@ name: nat_word_overflow_1208925819614629174706176, parameters: [], statement: ((wordOfNat 1208925819614629174706176) = (ctor Option.none [UInt64])), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -503,7 +519,7 @@ name: add_overflow, parameters: [], statement: ((checkedAdd (18446744073709551615 : UInt64) (1 : UInt64)) = (ctor Result.error [UInt64, SemanticError] (ctor SemanticError.arithmeticOverflow))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -511,7 +527,7 @@ name: subtract_underflow, parameters: [], statement: ((checkedSubtract (0 : UInt64) (1 : UInt64)) = (ctor Result.error [UInt64, SemanticError] (ctor SemanticError.negativeDifference))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -519,7 +535,7 @@ name: multiply_overflow, parameters: [], statement: ((checkedMultiply (9223372036854775808 : UInt64) (2 : UInt64)) = (ctor Result.error [UInt64, SemanticError] (ctor SemanticError.arithmeticOverflow))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -527,7 +543,7 @@ name: divide_zero, parameters: [], statement: ((checkedDivide (1 : UInt64) (0 : UInt64)) = (ctor Result.error [UInt64, SemanticError] (ctor SemanticError.divisionByZero))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -535,7 +551,7 @@ name: remainder_zero, parameters: [], statement: ((checkedRemainder (1 : UInt64) (0 : UInt64)) = (ctor Result.error [UInt64, SemanticError] (ctor SemanticError.divisionByZero))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -543,7 +559,7 @@ name: remainder_value, parameters: [], statement: ((checkedRemainder (17 : UInt64) (5 : UInt64)) = (ctor Result.ok [UInt64, SemanticError] (2 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -551,7 +567,7 @@ name: byte_overflow, parameters: [], statement: ((naturalToByte (256 : UInt64)) = (ctor Result.error [UInt8, SemanticError] (ctor SemanticError.byteOutOfRange))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -559,7 +575,7 @@ name: index_end, parameters: [], statement: ((sequenceIndex 0x00ff (2 : UInt64)) = (ctor Result.error [UInt8, SemanticError] (ctor SemanticError.indexOutOfBounds))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -567,7 +583,7 @@ name: slice_end_empty, parameters: [], statement: ((sequenceSlice 0x00ff (2 : UInt64) (0 : UInt64)) = (ctor Result.ok [Bytes, SemanticError] 0x)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -575,7 +591,7 @@ name: slice_overrun, parameters: [], statement: ((sequenceSlice 0x00ff (1 : UInt64) (2 : UInt64)) = (ctor Result.error [Bytes, SemanticError] (ctor SemanticError.sliceOutOfBounds))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -583,7 +599,7 @@ name: slice_arithmetic_no_wrap, parameters: [], statement: ((sequenceSlice 0x00ff (18446744073709551615 : UInt64) (2 : UInt64)) = (ctor Result.error [Bytes, SemanticError] (ctor SemanticError.sliceOutOfBounds))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -591,8 +607,8 @@ name: singleton_non_utf8, parameters: [], statement: ((singletonSequence (255 : UInt8)) = 0xff), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } \end{semanticmodule} \end{lexlean} diff --git a/src/Uorc/Core/Validation.lex.tex b/src/Uorc/Core/Validation.lex.tex index d6df9a06..d268d382 100644 --- a/src/Uorc/Core/Validation.lex.tex +++ b/src/Uorc/Core/Validation.lex.tex @@ -994,7 +994,7 @@ name: literal_graph_checked_incrementally, parameters: [], statement: ((accepted (run 500 (ctor Step.pending (start (Uorc.Core.Graph::literalGraph 0x00ff))))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1002,7 +1002,7 @@ name: zero_validation_effort_never_accepts, parameters: [], statement: ((accepted (run 0 (ctor Step.pending (start (Uorc.Core.Graph::literalGraph 0x00ff))))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1010,7 +1010,7 @@ name: empty_graph_rejected, parameters: [], statement: ((accepted (run 500 (ctor Step.pending (start (record Uorc.Core.Graph::Graph {blocks := (nil Uorc.Core.Graph::Block), entry := 0}))))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Integrity/Sha256.lex.tex b/src/Uorc/Integrity/Sha256.lex.tex index b9735feb..9f645326 100644 --- a/src/Uorc/Integrity/Sha256.lex.tex +++ b/src/Uorc/Integrity/Sha256.lex.tex @@ -1362,7 +1362,7 @@ name: wrapping_overflow, parameters: [], statement: ((wrappingAdd (4294967295 : UInt32) (1 : UInt32)) = (0 : UInt32)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1370,7 +1370,7 @@ name: wrapping_double_max, parameters: [], statement: ((wrappingAdd (4294967295 : UInt32) (4294967295 : UInt32)) = (4294967294 : UInt32)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1378,7 +1378,7 @@ name: length_bytes_max, parameters: [], statement: ((bitLengthBytes (2305843009213693951 : UInt64)) = 0xfffffffffffffff8), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1386,7 +1386,7 @@ name: unfinished_digest, parameters: [], statement: ((digest (init)) = (ctor Result.error [Bytes, Error] (ctor Error.notFinalized))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1394,7 +1394,7 @@ name: finalize_step_requires_start, parameters: [], statement: ((finalizeStep (init)) = (ctor Result.error [State, Error] (ctor Error.notFinalized))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1402,7 +1402,7 @@ name: zero_update_fuel, parameters: [], statement: ((runUpdate 0 (record Update {state := (init), input := 0x, offset := 0})) = (ctor Result.error [State, Error] (ctor Error.fuelExhausted))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1410,7 +1410,7 @@ name: invalid_offset, parameters: [], statement: ((updateStep (record Update {state := (init), input := 0x, offset := 1})) = (ctor Result.error [UpdateEvent, Error] (ctor Error.invalidOffset))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1418,7 +1418,7 @@ name: oversized_buffer, parameters: [], statement: ((digest (record State {chain := (project (init) chain), buffer := 0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, count := (project (init) count), work := (project (init) work), phase := (project (init) phase)})) = (ctor Result.error [Bytes, Error] (ctor Error.invalidState))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1426,7 +1426,7 @@ name: standard_length_domain, parameters: [], statement: ((absorbByte (record State {chain := (project (init) chain), buffer := 0x000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, count := (2305843009213693951 : UInt64), work := (project (init) work), phase := (project (init) phase)}) (0 : UInt8)) = (ctor Result.error [State, Error] (ctor Error.lengthDomainExceeded))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1434,7 +1434,7 @@ name: invalid_length_domain, parameters: [], statement: ((finalize (record State {chain := (project (init) chain), buffer := (project (init) buffer), count := (2305843009213693952 : UInt64), work := (project (init) work), phase := (project (init) phase)})) = (ctor Result.error [State, Error] (ctor Error.invalidState))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/Charts.lex.tex b/src/Uorc/Search/Charts.lex.tex index efd43317..ec471896 100644 --- a/src/Uorc/Search/Charts.lex.tex +++ b/src/Uorc/Search/Charts.lex.tex @@ -145,7 +145,7 @@ name: parameters_inferred_from_bytes, parameters: [], statement: ((infer 0xfa0b1c2d) = (ctor Result.ok [AffineParameters, Error] (record AffineParameters {base := (250 : UInt64), slope := (17 : UInt64)}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -153,7 +153,7 @@ name: arbitrary_byte_wrap_is_ring_arithmetic, parameters: [], statement: ((ringDifference (11 : UInt64) (250 : UInt64)) = (ctor Result.ok [UInt64, Error] (17 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -161,7 +161,7 @@ name: empty_has_typed_no_proposal, parameters: [], statement: ((infer 0x) = (ctor Result.error [AffineParameters, Error] (ctor Error.emptyInput))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/DictionaryFit.lex.tex b/src/Uorc/Search/DictionaryFit.lex.tex index 85ed43c1..720e9f30 100644 --- a/src/Uorc/Search/DictionaryFit.lex.tex +++ b/src/Uorc/Search/DictionaryFit.lex.tex @@ -199,7 +199,7 @@ statement: ((match (proposal (run 300 (start (Uorc.Core.Bytes::fromBytes 0x616263646162636458) 2))) | Option.none => (ctor Result.error [Unit, Uorc.Core.Types::StaticError] (ctor Uorc.Core.Types::StaticError.emptyGraph)) | Option.some graph => (Uorc.Core.Graph::validateGraph graph)) = (ctor Result.ok [Unit, Uorc.Core.Types::StaticError] ())), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/Effort.lex.tex b/src/Uorc/Search/Effort.lex.tex index 399e50fb..4fd7b75b 100644 --- a/src/Uorc/Search/Effort.lex.tex +++ b/src/Uorc/Search/Effort.lex.tex @@ -202,7 +202,7 @@ name: overflow_rejected, parameters: [], statement: ((nativeDefault 18446744073709551615 1) = (ctor Result.error [UInt64, Error] (ctor Error.defaultOverflow))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -217,7 +217,7 @@ name: native_checked_16MiB, parameters: [], statement: ((nativeDefault 16777216 1) = (ctor Result.ok [UInt64, Error] (34360791040 : UInt64))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -225,7 +225,7 @@ name: object_scale_overflow_rejected_without_nat_formula, parameters: [], statement: ((nativeDefault 0 18446744073709551615) = (ctor Result.error [UInt64, Error] (ctor Error.defaultOverflow))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/Enumerate.lex.tex b/src/Uorc/Search/Enumerate.lex.tex index f2c25a08..83c2935a 100644 --- a/src/Uorc/Search/Enumerate.lex.tex +++ b/src/Uorc/Search/Enumerate.lex.tex @@ -1,4 +1,5 @@ \begin{lexlean}{Uorc.Search.Enumerate} +\importmodule{Uorc.Core.Types} \title{Parameters} \begin{semanticmodule} structure{ @@ -80,11 +81,32 @@ body: (ctor Build.reverse (project word reversedDigits) (nil Nat)) } +definition{ + name: octetCell, + parameters: [octet : (Option UInt8)], + result: (Option Bytes), + body: (match octet + | Option.none => (ctor Option.none [Bytes]) + | Option.some byte => (Uorc.Core.Types::byteCell byte)), + axioms: [] +} + +definition{ + name: digitCell, + parameters: [digit : (Option UInt64)], + result: (Option Bytes), + body: (match digit + | Option.none => (ctor Option.none [Bytes]) + | Option.some word => (octetCell (prim checked_convert word : (Option UInt8)))), + axioms: [Quot.sound, propext] +} + definition{ name: natByteSlice, parameters: [n : Nat], result: (Option Bytes), - body: (if (256 <=? n) then (ctor Option.none [Bytes]) else (if (n (ctor Build.invalidDigit) | Option.some singleton => (ctor Build.emit tail (prim append output singleton : Bytes))) else (ctor Build.invalidDigit))) | Build.done output => (ctor Build.done output) - | Build.invalidDigit => (ctor Build.invalidDigit)) + | Build.invalidDigit => (ctor Build.invalidDigit)), + axioms: [Quot.sound, propext] } definition{ @@ -111,6 +134,7 @@ body: (match fuel | Nat.zero => build | Nat.succ restFuel => (runBuild restFuel (buildStep build))), + axioms: [Quot.sound, propext], recursive_argument: fuel } @@ -139,14 +163,16 @@ name: word_materialization_is_unsigned_big_endian, parameters: [], statement: ((runBuild 20 (beginBuild (record Word {reversedDigits := (cons 255 (cons 128 (cons 0 (nil Nat)))), length := 3}))) = (ctor Build.done 0x0080ff)), - proof: reflexivity{} + proof: reflexivity{}, + axioms: [Quot.sound, propext] } theorem{ name: bad_digit_is_not_syntax_rejection, parameters: [], statement: ((buildStep (ctor Build.emit (cons 256 (nil Nat)) 0x)) = (ctor Build.invalidDigit)), - proof: reflexivity{} + proof: reflexivity{}, + axioms: [Quot.sound, propext] } \end{semanticmodule} \end{lexlean} diff --git a/src/Uorc/Search/ExecutionAccountingControls.lex.tex b/src/Uorc/Search/ExecutionAccountingControls.lex.tex index 6c542e32..a3ef7548 100644 --- a/src/Uorc/Search/ExecutionAccountingControls.lex.tex +++ b/src/Uorc/Search/ExecutionAccountingControls.lex.tex @@ -87,7 +87,7 @@ name: semantic_failure_retains_exact_execution_ledger, parameters: [], statement: ((retainedDivisionFailure (Uorc.Search.ProgramTrial::run 10000 (trial))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -95,7 +95,7 @@ name: semantic_failure_is_never_eligible, parameters: [], statement: ((Uorc.Search.ProgramTrial::accepted (Uorc.Search.ProgramTrial::run 10000 (trial))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -220,7 +220,7 @@ name: initialization_has_no_machine_one_unit_before_payment, parameters: [], statement: ((initializationIsStillUnmaterialized (Uorc.Search.ProgramTrial::run 5838 (trial))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -228,7 +228,7 @@ name: initialization_materializes_only_after_exact_payment, parameters: [], statement: ((initializationCommitsAfterExactPayment (Uorc.Search.ProgramTrial::run 5839 (trial))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -294,7 +294,7 @@ name: step_does_not_execute_with_one_escrow_unit_missing, parameters: [], statement: ((firstStepNotExecutedWithOneEscrowUnitMissing (Uorc.Search.ProgramTrial::run 6480 (trial))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -302,7 +302,7 @@ name: step_commits_only_after_declared_escrow_is_paid, parameters: [], statement: ((firstStepCommitsFromPaidEscrow (Uorc.Search.ProgramTrial::run 6482 (trial))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/HuffmanControls.lex.tex b/src/Uorc/Search/HuffmanControls.lex.tex index 33f81785..18f2ec87 100644 --- a/src/Uorc/Search/HuffmanControls.lex.tex +++ b/src/Uorc/Search/HuffmanControls.lex.tex @@ -33,7 +33,7 @@ name: empty_has_no_tree_or_payload, parameters: [], statement: ((Uorc.Search.PackedControls::meaningFits (Uorc.Search.HuffmanProgram::emptyProgram) 0x) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -41,7 +41,7 @@ name: single_symbol_has_zero_payload_bits, parameters: [], statement: ((Uorc.Search.PackedControls::meaningFits (Uorc.Search.HuffmanProgram::singleProgram (4 : UInt64) (255 : UInt8)) 0xffffffff) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -49,7 +49,7 @@ name: two_symbol_lsb_first_reconstruction, parameters: [], statement: ((Uorc.Search.PackedControls::meaningFits (Uorc.Search.HuffmanProgram::branchProgram (4 : UInt64) (4 : UInt64) (1 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x06) (Uorc.Core.Bytes::fromBytes 0x61016201)) 0x61626261) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -57,7 +57,7 @@ name: three_symbol_variable_length_reconstruction, parameters: [], statement: ((Uorc.Search.PackedControls::meaningFits (Uorc.Search.HuffmanProgram::branchProgram (4 : UInt64) (6 : UInt64) (2 : UInt64) (1 : UInt64) (Uorc.Core.Bytes::fromBytes 0x1a) (Uorc.Core.Bytes::fromBytes 0x6201630161010000)) 0x61626361) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -65,7 +65,7 @@ name: truncated_code_fails, parameters: [], statement: ((isSemanticFailure (Uorc.Search.HuffmanProgram::branchProgram (2 : UInt64) (1 : UInt64) (1 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0x61016201))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -73,7 +73,7 @@ name: nonzero_high_padding_fails, parameters: [], statement: ((isSemanticFailure (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (1 : UInt64) (1 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x02) (Uorc.Core.Bytes::fromBytes 0x61016201))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -81,7 +81,7 @@ name: trailing_payload_byte_fails, parameters: [], statement: ((isSemanticFailure (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (1 : UInt64) (1 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x0000) (Uorc.Core.Bytes::fromBytes 0x61016201))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -89,7 +89,7 @@ name: extra_declared_bit_fails_final_update, parameters: [], statement: ((isSemanticFailure (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (2 : UInt64) (1 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0x61016201))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -97,7 +97,7 @@ name: out_of_range_child_fails, parameters: [], statement: ((isSemanticFailure (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (1 : UInt64) (1 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0xffff6201))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -105,7 +105,7 @@ name: out_of_range_branch_fails, parameters: [], statement: ((isSemanticFailure (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (1 : UInt64) (2 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0xff006201))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -113,7 +113,7 @@ name: cyclic_tree_fails_at_finite_depth, parameters: [], statement: ((isSemanticFailure (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (1 : UInt64) (1 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0x00006201))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -121,7 +121,7 @@ name: out_of_range_root_is_not_truncated, parameters: [], statement: ((isSemanticFailure (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (1 : UInt64) (1 : UInt64) (65536 : UInt64) (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0x61016201))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -129,7 +129,7 @@ name: insufficient_fold_depth_fails, parameters: [], statement: ((isSemanticFailure (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (1 : UInt64) (0 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0x61016201))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -137,7 +137,7 @@ name: alphabet_127_reconstructs_boundary_byte, parameters: [], statement: ((Uorc.Search.PackedControls::meaningFits (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (6 : UInt64) (7 : UInt64) (125 : UInt64) (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0x00010101020103010401050106010701080109010a010b010c010d010e010f0110011101120113011401150116011701180119011a011b011c011d011e011f0120012101220123012401250126012701280129012a012b012c012d012e012f0130013101320133013401350136013701380139013a013b013c013d013e013f0140014101420143014401450146014701480149014a014b014c014d014e014f0150015101520153015401550156015701580159015a015b015c015d015e015f0160016101620163016401650166016701680169016a016b016c016d016e016f0170017101720173017401750176017701780179017a017b017c017d017e0100000100020003000400050006000700080009000a000b000c000d000e000f0010001100120013001400150016001700180019001a001b001c001d001e001f0020002100220023002400250026002700280029002a002b002c002d002e002f0030003100320033003400350036003700380039003a003b003c003d003e003f0040004100420043004400450046004700480049004a004b004c004d004e004f0050005100520053005400550056005700580059005a005b005c005d005e005f0060006100620063006400650066006700680069006a006b006c006d006e006f0070007100720073007400750076007700780079007a007b007c00)) 0x7e) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -145,7 +145,7 @@ name: alphabet_128_reconstructs_boundary_byte, parameters: [], statement: ((Uorc.Search.PackedControls::meaningFits (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (7 : UInt64) (7 : UInt64) (126 : UInt64) (Uorc.Core.Bytes::fromBytes 0x7f) (Uorc.Core.Bytes::fromBytes 0x00010101020103010401050106010701080109010a010b010c010d010e010f0110011101120113011401150116011701180119011a011b011c011d011e011f0120012101220123012401250126012701280129012a012b012c012d012e012f0130013101320133013401350136013701380139013a013b013c013d013e013f0140014101420143014401450146014701480149014a014b014c014d014e014f0150015101520153015401550156015701580159015a015b015c015d015e015f0160016101620163016401650166016701680169016a016b016c016d016e016f0170017101720173017401750176017701780179017a017b017c017d017e017f0100000100020003000400050006000700080009000a000b000c000d000e000f0010001100120013001400150016001700180019001a001b001c001d001e001f0020002100220023002400250026002700280029002a002b002c002d002e002f0030003100320033003400350036003700380039003a003b003c003d003e003f0040004100420043004400450046004700480049004a004b004c004d004e004f0050005100520053005400550056005700580059005a005b005c005d005e005f0060006100620063006400650066006700680069006a006b006c006d006e006f0070007100720073007400750076007700780079007a007b007c007d00)) 0x7f) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -153,7 +153,7 @@ name: alphabet_129_reconstructs_boundary_byte, parameters: [], statement: ((Uorc.Search.PackedControls::meaningFits (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (7 : UInt64) (8 : UInt64) (127 : UInt64) (Uorc.Core.Bytes::fromBytes 0x3f) (Uorc.Core.Bytes::fromBytes 0x00010101020103010401050106010701080109010a010b010c010d010e010f0110011101120113011401150116011701180119011a011b011c011d011e011f0120012101220123012401250126012701280129012a012b012c012d012e012f0130013101320133013401350136013701380139013a013b013c013d013e013f0140014101420143014401450146014701480149014a014b014c014d014e014f0150015101520153015401550156015701580159015a015b015c015d015e015f0160016101620163016401650166016701680169016a016b016c016d016e016f0170017101720173017401750176017701780179017a017b017c017d017e017f01800100000100020003000400050006000700080009000a000b000c000d000e000f0010001100120013001400150016001700180019001a001b001c001d001e001f0020002100220023002400250026002700280029002a002b002c002d002e002f0030003100320033003400350036003700380039003a003b003c003d003e003f0040004100420043004400450046004700480049004a004b004c004d004e004f0050005100520053005400550056005700580059005a005b005c005d005e005f0060006100620063006400650066006700680069006a006b006c006d006e006f0070007100720073007400750076007700780079007a007b007c007d007e00)) 0x80) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -161,7 +161,7 @@ name: alphabet_256_reconstructs_boundary_byte, parameters: [], statement: ((Uorc.Search.PackedControls::meaningFits (Uorc.Search.HuffmanProgram::branchProgram (1 : UInt64) (8 : UInt64) (8 : UInt64) (254 : UInt64) (Uorc.Core.Bytes::fromBytes 0xff) (Uorc.Core.Bytes::fromBytes 0x00010101020103010401050106010701080109010a010b010c010d010e010f0110011101120113011401150116011701180119011a011b011c011d011e011f0120012101220123012401250126012701280129012a012b012c012d012e012f0130013101320133013401350136013701380139013a013b013c013d013e013f0140014101420143014401450146014701480149014a014b014c014d014e014f0150015101520153015401550156015701580159015a015b015c015d015e015f0160016101620163016401650166016701680169016a016b016c016d016e016f0170017101720173017401750176017701780179017a017b017c017d017e017f0180018101820183018401850186018701880189018a018b018c018d018e018f0190019101920193019401950196019701980199019a019b019c019d019e019f01a001a101a201a301a401a501a601a701a801a901aa01ab01ac01ad01ae01af01b001b101b201b301b401b501b601b701b801b901ba01bb01bc01bd01be01bf01c001c101c201c301c401c501c601c701c801c901ca01cb01cc01cd01ce01cf01d001d101d201d301d401d501d601d701d801d901da01db01dc01dd01de01df01e001e101e201e301e401e501e601e701e801e901ea01eb01ec01ed01ee01ef01f001f101f201f301f401f501f601f701f801f901fa01fb01fc01fd01fe01ff0100000100020003000400050006000700080009000a000b000c000d000e000f0010001100120013001400150016001700180019001a001b001c001d001e001f0020002100220023002400250026002700280029002a002b002c002d002e002f0030003100320033003400350036003700380039003a003b003c003d003e003f0040004100420043004400450046004700480049004a004b004c004d004e004f0050005100520053005400550056005700580059005a005b005c005d005e005f0060006100620063006400650066006700680069006a006b006c006d006e006f0070007100720073007400750076007700780079007a007b007c007d007e007f0080008100820083008400850086008700880089008a008b008c008d008e008f0090009100920093009400950096009700980099009a009b009c009d009e009f00a000a100a200a300a400a500a600a700a800a900aa00ab00ac00ad00ae00af00b000b100b200b300b400b500b600b700b800b900ba00bb00bc00bd00be00bf00c000c100c200c300c400c500c600c700c800c900ca00cb00cc00cd00ce00cf00d000d100d200d300d400d500d600d700d800d900da00db00dc00dd00de00df00e000e100e200e300e400e500e600e700e800e900ea00eb00ec00ed00ee00ef00f000f100f200f300f400f500f600f700f800f900fa00fb00fc00fd00)) 0xff) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -172,7 +172,7 @@ | Uorc.Search.HuffmanFit::Step.pending observedCursor => (((Uorc.Core.Lifetime::natRead 9 (project observedCursor frequencies) (97 : UInt64)) =? 2) && (((project observedCursor completedEvents) =? 96) && ((project observedCursor tableUnits) =? 96))) | Uorc.Search.HuffmanFit::Step.proposal graph stats => false | Uorc.Search.HuffmanFit::Step.rejected failure stats => false) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -183,7 +183,7 @@ | Uorc.Search.HuffmanFit::Step.pending observedCursor => (((project observedCursor eventCredit) =? 18) && (((Uorc.Core.Lifetime::natRead 9 (project observedCursor frequencies) (97 : UInt64)) =? 0) && ((project observedCursor tableUnits) =? 18))) | Uorc.Search.HuffmanFit::Step.proposal graph stats => false | Uorc.Search.HuffmanFit::Step.rejected failure stats => false) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -194,7 +194,7 @@ | Uorc.Search.HuffmanFit::Step.pending observedCursor => (((Uorc.Core.Lifetime::natRead 9 (project observedCursor parents) (97 : UInt64)) =? 513) && (((Uorc.Core.Lifetime::natRead 9 (project observedCursor parents) (98 : UInt64)) =? 514) && ((Uorc.Core.Lifetime::natRead 9 (project observedCursor frequencies) (256 : UInt64)) =? 2))) | Uorc.Search.HuffmanFit::Step.proposal graph stats => false | Uorc.Search.HuffmanFit::Step.rejected failure stats => false) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -205,7 +205,7 @@ | Uorc.Search.HuffmanFit::Step.pending unexpected => false | Uorc.Search.HuffmanFit::Step.proposal graph stats => false | Uorc.Search.HuffmanFit::Step.rejected failure stats => ((project stats events) =? 18446744073709551615)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -474,7 +474,7 @@ name: pause_resume_preserves_exact_event_state, parameters: [], statement: ((Uorc.Search.HuffmanFit::runWork 1 (Uorc.Search.HuffmanFit::runWork 1 (Uorc.Search.HuffmanFit::start (Uorc.Core.Bytes::fromBytes 0x6162)))) = (Uorc.Search.HuffmanFit::runWork 2 (Uorc.Search.HuffmanFit::start (Uorc.Core.Bytes::fromBytes 0x6162)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/Normalize.lex.tex b/src/Uorc/Search/Normalize.lex.tex index 43e8c153..f8546d25 100644 --- a/src/Uorc/Search/Normalize.lex.tex +++ b/src/Uorc/Search/Normalize.lex.tex @@ -192,7 +192,7 @@ | Uorc.Core.ByteBuilder::Event.appended builder => (ctor Step.pending (ctor Cursor.blockReading (ctor BlockRead.state source builder totalBytes (logicalSteps + (Uorc.Core.ByteBuilder::eventWork work)) physicalSteps))) | Uorc.Core.ByteBuilder::Event.finished rope => (ctor Step.rejected (ctor Error.invalidCursor)) | Uorc.Core.ByteBuilder::Event.failed builderError => (ctor Step.rejected (ctor Error.builder builderError)))), - axioms: [Quot.sound, propext] + axioms: [] } definition{ @@ -205,7 +205,7 @@ | Uorc.Core.ByteBuilder::Event.appended builder => (ctor Step.rejected (ctor Error.invalidCursor)) | Uorc.Core.ByteBuilder::Event.finished rope => (ctor Step.done (record Normalized {rope := rope, totalBytes := totalBytes, blockBytes := (project policy blockBytes), logicalSteps := (logicalSteps + (Uorc.Core.ByteBuilder::eventWork work))}) physicalSteps) | Uorc.Core.ByteBuilder::Event.failed builderError => (ctor Step.rejected (ctor Error.builder builderError)))), - axioms: [Quot.sound, propext] + axioms: [] } definition{ @@ -219,7 +219,7 @@ | Cursor.blockReading state => (blockReadStep state) | Cursor.blockAppending state => (blockAppendStep policy state) | Cursor.blockFinishing state => (blockFinishStep policy state))), - axioms: [Quot.sound, propext] + axioms: [] } definition{ @@ -233,7 +233,7 @@ | Step.done normalized physical => (ctor Step.done normalized physical) | Step.rejected error => (ctor Step.rejected error) | Step.ropeFailure error => (ctor Step.ropeFailure error))), - axioms: [Quot.sound, propext], + axioms: [], recursive_argument: fuel } @@ -252,32 +252,32 @@ name: transport_partition_does_not_change_canonical_snapshot, parameters: [], statement: ((canonicalResult (run 300 (record Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Core.Bytes::fromBytes 0x0001ff80))))) = (canonicalResult (run 300 (record Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x) (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x01ff) (Uorc.Core.Bytes::fromBytes 0x80))))))))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ name: empty_chunks_dont_change_canonical_snapshot, parameters: [], statement: ((canonicalResult (run 300 (record Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Core.Bytes::fromBytes 0x))))) = (canonicalResult (run 300 (record Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x) (Uorc.Core.Bytes::fromBytes 0x))))))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ name: zero_block_policy_is_configuration_error, parameters: [], statement: ((step (record Policy {blockBytes := 0}) (start (Uorc.Core.Bytes::fromBytes 0x0001ff80))) = (ctor Step.rejected (ctor Error.zeroBlockSize))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ name: canonical_block_tree_and_logical_events, parameters: [], statement: ((canonicalResult (run 300 (record Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Core.Bytes::fromBytes 0x0001ff80))))) = (ctor Option.some [Normalized] (record Normalized {rope := (Uorc.Core.Bytes::node (Uorc.Core.Bytes::fromBytes 0x0001) (Uorc.Core.Bytes::fromBytes 0xff80)), totalBytes := 4, blockBytes := 2, logicalSteps := 59}))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } structure{ @@ -312,8 +312,8 @@ name: equal_work_search_state_ignores_transport_partition, parameters: [], statement: ((seedAfterWork 23 (record Uorc.Search.Schedule::Policy {quantum := 2, sourceBinding := 0x01, seedInventoryBinding := 0x02}) (record Uorc.Search.Schedule::Availability {typedGeneration := true, addressCharts := true, antiUnification := true, sharingLayout := true, stateGenerators := true, completeEnumeration := true}) (run 300 (record Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Core.Bytes::fromBytes 0x0001ff80))))) = (seedAfterWork 23 (record Uorc.Search.Schedule::Policy {quantum := 2, sourceBinding := 0x01, seedInventoryBinding := 0x02}) (record Uorc.Search.Schedule::Availability {typedGeneration := true, addressCharts := true, antiUnification := true, sharingLayout := true, stateGenerators := true, completeEnumeration := true}) (run 300 (record Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x) (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x01ff) (Uorc.Core.Bytes::fromBytes 0x80))))))))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } structure{ @@ -373,7 +373,7 @@ | Step.done normalized physical => (record WorkPrefix {logicalSteps := (project normalized logicalSteps), physicalSteps := physical}) | Step.rejected failure => (if ((project policy blockBytes) =? 0) then (workPrefix cursor) else (attemptPrefix cursor)) | Step.ropeFailure failure => (attemptPrefix cursor))})), - axioms: [Quot.sound, propext] + axioms: [] } theorem{ @@ -381,7 +381,7 @@ parameters: [cursor : Cursor], statement: ((project (observe (record Policy {blockBytes := 0}) cursor) prefix) = (workPrefix cursor)), proof: reflexivity{}, - axioms: [Quot.sound, propext] + axioms: [] } \end{semanticmodule} \end{lexlean} diff --git a/src/Uorc/Search/NormalizeCredit.lex.tex b/src/Uorc/Search/NormalizeCredit.lex.tex index 1eadc816..b291f7b5 100644 --- a/src/Uorc/Search/NormalizeCredit.lex.tex +++ b/src/Uorc/Search/NormalizeCredit.lex.tex @@ -75,7 +75,7 @@ | Uorc.Search.Normalize::Step.done normalized physical => (ctor Step.done normalized physical ((project cursor consumedCredits) + 1)) | Uorc.Search.Normalize::Step.rejected failure => (ctor Step.rejected failure (project observation prefix) ((project cursor consumedCredits) + 1)) | Uorc.Search.Normalize::Step.ropeFailure failure => (ctor Step.ropeFailure failure (project observation prefix) ((project cursor consumedCredits) + 1))))), - axioms: [Quot.sound, propext] + axioms: [] } definition{ @@ -102,7 +102,7 @@ | Uorc.Search.Normalize::Step.done normalized physical => (ctor Step.done normalized physical (consumedCredits + 1)) | Uorc.Search.Normalize::Step.rejected failure => (ctor Step.rejected failure (project observation prefix) (consumedCredits + 1)) | Uorc.Search.Normalize::Step.ropeFailure failure => (ctor Step.ropeFailure failure (project observation prefix) (consumedCredits + 1)))))), - axioms: [Quot.sound, propext], + axioms: [], recursive_argument: work } @@ -115,23 +115,23 @@ | Step.done normalized physical credits => (ctor Step.done normalized physical credits) | Step.rejected failure prefix credits => (ctor Step.rejected failure prefix credits) | Step.ropeFailure failure prefix credits => (ctor Step.ropeFailure failure prefix credits)), - axioms: [Quot.sound, propext] + axioms: [] } theorem{ name: copy_credit_resume_is_exact, parameters: [], statement: ((runWork 17 (record Uorc.Search.Normalize::Policy {blockBytes := 2}) (runWork 13 (record Uorc.Search.Normalize::Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Search.Normalize::start (Uorc.Core.Bytes::fromBytes 0x0001ff80)))))) = (runWork 30 (record Uorc.Search.Normalize::Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Search.Normalize::start (Uorc.Core.Bytes::fromBytes 0x0001ff80)))))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ name: zero_normalization_credit_never_completes, parameters: [], statement: ((runWork 0 (record Uorc.Search.Normalize::Policy {blockBytes := 2}) (ctor Step.pending (start (Uorc.Search.Normalize::start (Uorc.Core.Bytes::fromBytes 0x0001ff80))))) = (ctor Step.pending (start (Uorc.Search.Normalize::start (Uorc.Core.Bytes::fromBytes 0x0001ff80))))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ diff --git a/src/Uorc/Search/NormalizeObjects.lex.tex b/src/Uorc/Search/NormalizeObjects.lex.tex index 54b53613..1447ea71 100644 --- a/src/Uorc/Search/NormalizeObjects.lex.tex +++ b/src/Uorc/Search/NormalizeObjects.lex.tex @@ -107,7 +107,7 @@ | Phase.reversing => (match reversed | List.nil => (ctor Step.done (record Snapshot {objects := forward, objectCount := objectsCompleted, canonicalWork := canonicalWork, physicalWork := physicalWork, consumedCredits := (consumedCredits + 1)})) | List.cons headObject remainingObjects => (ctor Step.pending (ctor Cursor.state remaining remainingObjects (cons headObject forward) phase objectsCompleted canonicalWork physicalWork (consumedCredits + 1)))))), - axioms: [Quot.sound, propext] + axioms: [] } definition{ @@ -131,7 +131,7 @@ | Step.pending cursor => (runWork remainingWork policy (tick policy cursor)) | Step.done snapshot => (ctor Step.done snapshot) | Step.failed failure cursor => (ctor Step.failed failure cursor))), - axioms: [Quot.sound, propext], + axioms: [], recursive_argument: work } @@ -149,24 +149,24 @@ name: ordered_empty_basis_objects_are_preserved, parameters: [], statement: ((canonicalObjects (runWork 500 (record Uorc.Search.Normalize::Policy {blockBytes := 2}) (ctor Step.pending (start (cons (Uorc.Core.Bytes::fromBytes 0x) (cons (Uorc.Core.Bytes::fromBytes 0x00ff) (cons (Uorc.Core.Bytes::fromBytes 0x) (nil Uorc.Core.Bytes::Rope)))))))) = (ctor Option.some [(List Uorc.Core.Bytes::Rope)] (cons (Uorc.Core.Bytes::fromBytes 0x) (cons (Uorc.Core.Bytes::fromBytes 0x00ff) (cons (Uorc.Core.Bytes::fromBytes 0x) (nil Uorc.Core.Bytes::Rope)))))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ name: basis_transport_partition_has_one_canonical_snapshot, parameters: [], statement: ((canonicalObjects (runWork 500 (record Uorc.Search.Normalize::Policy {blockBytes := 2}) (ctor Step.pending (start (cons (Uorc.Core.Bytes::fromBytes 0x0001ff80) (nil Uorc.Core.Bytes::Rope)))))) = (canonicalObjects (runWork 500 (record Uorc.Search.Normalize::Policy {blockBytes := 2}) (ctor Step.pending (start (cons (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0x01ff80)) (nil Uorc.Core.Bytes::Rope))))))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } theorem{ name: basis_object_order_is_not_sorted, parameters: [], statement: ((canonicalObjects (runWork 500 (record Uorc.Search.Normalize::Policy {blockBytes := 2}) (ctor Step.pending (start (cons (Uorc.Core.Bytes::fromBytes 0xff) (cons (Uorc.Core.Bytes::fromBytes 0x00) (nil Uorc.Core.Bytes::Rope))))))) = (ctor Option.some [(List Uorc.Core.Bytes::Rope)] (cons (Uorc.Core.Bytes::fromBytes 0xff) (cons (Uorc.Core.Bytes::fromBytes 0x00) (nil Uorc.Core.Bytes::Rope))))), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } \end{semanticmodule} \end{lexlean} diff --git a/src/Uorc/Search/Order.lex.tex b/src/Uorc/Search/Order.lex.tex index 061d8543..90703a23 100644 --- a/src/Uorc/Search/Order.lex.tex +++ b/src/Uorc/Search/Order.lex.tex @@ -82,7 +82,7 @@ name: shorter_wins, parameters: [], statement: ((run 20 (start (record Uorc.Search.Verify::CheckedArchive {wire := 0x0000, bytesCompared := 4, boundariesChecked := 1}) (record Uorc.Search.Verify::CheckedArchive {wire := 0xff, bytesCompared := 4, boundariesChecked := 1}))) = (ctor Step.selected (record Uorc.Search.Verify::CheckedArchive {wire := 0xff, bytesCompared := 4, boundariesChecked := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -90,7 +90,7 @@ name: longer_never_wins, parameters: [], statement: ((run 20 (start (record Uorc.Search.Verify::CheckedArchive {wire := 0x00, bytesCompared := 4, boundariesChecked := 1}) (record Uorc.Search.Verify::CheckedArchive {wire := 0x0000, bytesCompared := 4, boundariesChecked := 1}))) = (ctor Step.selected (record Uorc.Search.Verify::CheckedArchive {wire := 0x00, bytesCompared := 4, boundariesChecked := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -98,7 +98,7 @@ name: unsigned_full_archive_lex_tie, parameters: [], statement: ((run 20 (start (record Uorc.Search.Verify::CheckedArchive {wire := 0xff00, bytesCompared := 4, boundariesChecked := 1}) (record Uorc.Search.Verify::CheckedArchive {wire := 0x80ff, bytesCompared := 4, boundariesChecked := 1}))) = (ctor Step.selected (record Uorc.Search.Verify::CheckedArchive {wire := 0x80ff, bytesCompared := 4, boundariesChecked := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -106,7 +106,7 @@ name: lex_later_byte, parameters: [], statement: ((run 20 (start (record Uorc.Search.Verify::CheckedArchive {wire := 0x01020304, bytesCompared := 4, boundariesChecked := 1}) (record Uorc.Search.Verify::CheckedArchive {wire := 0x010202ff, bytesCompared := 4, boundariesChecked := 1}))) = (ctor Step.selected (record Uorc.Search.Verify::CheckedArchive {wire := 0x010202ff, bytesCompared := 4, boundariesChecked := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -114,7 +114,7 @@ name: identical_keeps_incumbent, parameters: [], statement: ((run 20 (start (record Uorc.Search.Verify::CheckedArchive {wire := 0x0102, bytesCompared := 4, boundariesChecked := 1}) (record Uorc.Search.Verify::CheckedArchive {wire := 0x0102, bytesCompared := 4, boundariesChecked := 1}))) = (ctor Step.selected (record Uorc.Search.Verify::CheckedArchive {wire := 0x0102, bytesCompared := 4, boundariesChecked := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -122,7 +122,7 @@ name: byte_00_lt_ff, parameters: [], statement: ((byteLess (0 : UInt8) (255 : UInt8)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -130,7 +130,7 @@ name: byte_ff_not_lt_00, parameters: [], statement: ((byteLess (255 : UInt8) (0 : UInt8)) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Search/OrderRope.lex.tex b/src/Uorc/Search/OrderRope.lex.tex index 9d6b9ce4..aa123d16 100644 --- a/src/Uorc/Search/OrderRope.lex.tex +++ b/src/Uorc/Search/OrderRope.lex.tex @@ -89,7 +89,7 @@ name: segmented_full_archive_lex, parameters: [], statement: ((run 150 (start (record Uorc.Search.VerifyRope::CheckedArchive {wire := (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x0102) (Uorc.Core.Bytes::fromBytes 0x03ff)), bytesCompared := 4, boundariesChecked := 1}) (record Uorc.Search.VerifyRope::CheckedArchive {wire := (Uorc.Core.Bytes::fromBytes 0x01020380), bytesCompared := 4, boundariesChecked := 1}))) = (ctor Step.selected (record Uorc.Search.VerifyRope::CheckedArchive {wire := (Uorc.Core.Bytes::fromBytes 0x01020380), bytesCompared := 4, boundariesChecked := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -97,7 +97,7 @@ name: same_wire_different_partitions_keeps_incumbent, parameters: [], statement: ((run 150 (start (record Uorc.Search.VerifyRope::CheckedArchive {wire := (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0xff)), bytesCompared := 4, boundariesChecked := 1}) (record Uorc.Search.VerifyRope::CheckedArchive {wire := (Uorc.Core.Bytes::fromBytes 0x00ff), bytesCompared := 4, boundariesChecked := 1}))) = (ctor Step.selected (record Uorc.Search.VerifyRope::CheckedArchive {wire := (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0xff)), bytesCompared := 4, boundariesChecked := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/PackedControls.lex.tex b/src/Uorc/Search/PackedControls.lex.tex index 414b6f66..44c52219 100644 --- a/src/Uorc/Search/PackedControls.lex.tex +++ b/src/Uorc/Search/PackedControls.lex.tex @@ -37,7 +37,7 @@ name: alphabet_1_lookup_is_byte_order_independent, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (0 : UInt64) (Uorc.Core.Bytes::fromBytes 0x) (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0x)) 0x00) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -45,7 +45,7 @@ name: alphabet_2_lookup_is_byte_order_independent, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (1 : UInt64) (Uorc.Core.Bytes::fromBytes 0x01) (Uorc.Core.Bytes::fromBytes 0x0001) (Uorc.Core.Bytes::fromBytes 0x)) 0x01) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -53,7 +53,7 @@ name: alphabet_3_lookup_is_byte_order_independent, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (2 : UInt64) (Uorc.Core.Bytes::fromBytes 0x02) (Uorc.Core.Bytes::fromBytes 0x000102) (Uorc.Core.Bytes::fromBytes 0x)) 0x02) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -61,7 +61,7 @@ name: alphabet_127_lookup_is_byte_order_independent, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (7 : UInt64) (Uorc.Core.Bytes::fromBytes 0x7e) (Uorc.Core.Bytes::fromBytes 0x000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e) (Uorc.Core.Bytes::fromBytes 0x)) 0x7e) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -69,7 +69,7 @@ name: alphabet_128_lookup_is_byte_order_independent, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (7 : UInt64) (Uorc.Core.Bytes::fromBytes 0x7f) (Uorc.Core.Bytes::fromBytes 0x000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e7f) (Uorc.Core.Bytes::fromBytes 0x)) 0x7f) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -77,7 +77,7 @@ name: alphabet_129_lookup_is_byte_order_independent, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (8 : UInt64) (Uorc.Core.Bytes::fromBytes 0x80) (Uorc.Core.Bytes::fromBytes 0x000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e7f80) (Uorc.Core.Bytes::fromBytes 0x)) 0x80) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -85,7 +85,7 @@ name: alphabet_256_lookup_is_byte_order_independent, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (8 : UInt64) (Uorc.Core.Bytes::fromBytes 0xff) (Uorc.Core.Bytes::fromBytes 0x000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e7f808182838485868788898a8b8c8d8e8f909192939495969798999a9b9c9d9e9fa0a1a2a3a4a5a6a7a8a9aaabacadaeafb0b1b2b3b4b5b6b7b8b9babbbcbdbebfc0c1c2c3c4c5c6c7c8c9cacbcccdcecfd0d1d2d3d4d5d6d7d8d9dadbdcdddedfe0e1e2e3e4e5e6e7e8e9eaebecedeeeff0f1f2f3f4f5f6f7f8f9fafbfcfdfeff) (Uorc.Core.Bytes::fromBytes 0x)) 0xff) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -93,7 +93,7 @@ name: alphabet_257_uses_same_closed_program_family, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (2 : UInt64) (2 : UInt64) (9 : UInt64) (Uorc.Core.Bytes::fromBytes 0x0001) (Uorc.Core.Bytes::fromBytes 0x00000100020003000400050006000700080009000a000b000c000d000e000f0010001100120013001400150016001700180019001a001b001c001d001e001f0020002100220023002400250026002700280029002a002b002c002d002e002f0030003100320033003400350036003700380039003a003b003c003d003e003f0040004100420043004400450046004700480049004a004b004c004d004e004f0050005100520053005400550056005700580059005a005b005c005d005e005f0060006100620063006400650066006700680069006a006b006c006d006e006f0070007100720073007400750076007700780079007a007b007c007d007e007f0080008100820083008400850086008700880089008a008b008c008d008e008f0090009100920093009400950096009700980099009a009b009c009d009e009f00a000a100a200a300a400a500a600a700a800a900aa00ab00ac00ad00ae00af00b000b100b200b300b400b500b600b700b800b900ba00bb00bc00bd00be00bf00c000c100c200c300c400c500c600c700c800c900ca00cb00cc00cd00ce00cf00d000d100d200d300d400d500d600d700d800d900da00db00dc00dd00de00df00e000e100e200e300e400e500e600e700e800e900ea00eb00ec00ed00ee00ef00f000f100f200f300f400f500f600f700f800f900fa00fb00fc00fd00fe00ff000001) (Uorc.Core.Bytes::fromBytes 0x)) 0x0001) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -101,7 +101,7 @@ name: truncated_code_fails_denotational_execution, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (1 : UInt64) (Uorc.Core.Bytes::fromBytes 0x) (Uorc.Core.Bytes::fromBytes 0x6162) (Uorc.Core.Bytes::fromBytes 0x)) 0x61) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -109,7 +109,7 @@ name: out_of_dictionary_ordinal_fails_execution, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (2 : UInt64) (Uorc.Core.Bytes::fromBytes 0x03) (Uorc.Core.Bytes::fromBytes 0x616263) (Uorc.Core.Bytes::fromBytes 0x)) 0x61) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -117,7 +117,7 @@ name: padding_is_a_model_canonicality_rule_not_archive_semantics, parameters: [], statement: ((meaningFits (Uorc.Search.PackedDictionary::program (1 : UInt64) (1 : UInt64) (7 : UInt64) (Uorc.Core.Bytes::fromBytes 0x80) (Uorc.Core.Bytes::fromBytes 0x000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e7f) (Uorc.Core.Bytes::fromBytes 0x)) 0x00) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -125,7 +125,7 @@ name: learned_zero_bit_alphabet_reconstructs_exactly, parameters: [], statement: ((learnedFits (Uorc.Search.PackedFit::runWork 2000 (Uorc.Search.PackedFit::start (Uorc.Core.Bytes::fromBytes 0x5a5a) 1)) 0x5a5a) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -133,7 +133,7 @@ name: learned_two_symbol_cross_byte_reconstructs_exactly, parameters: [], statement: ((learnedFits (Uorc.Search.PackedFit::runWork 2000 (Uorc.Search.PackedFit::start (Uorc.Core.Bytes::fromBytes 0x61626162616261626162) 1)) 0x61626162616261626162) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -141,7 +141,7 @@ name: learned_three_symbol_partial_byte_reconstructs_exactly, parameters: [], statement: ((learnedFits (Uorc.Search.PackedFit::runWork 2000 (Uorc.Search.PackedFit::start (Uorc.Core.Bytes::fromBytes 0x616263616263) 1)) 0x616263616263) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -149,7 +149,7 @@ name: learned_wide_symbols_exact_tail_reconstructs_exactly, parameters: [], statement: ((learnedFits (Uorc.Search.PackedFit::runWork 2000 (Uorc.Search.PackedFit::start (Uorc.Core.Bytes::fromBytes 0x616263646162636458) 2)) 0x616263646162636458) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -157,7 +157,7 @@ name: learned_binary_byte_values_reconstructs_exactly, parameters: [], statement: ((learnedFits (Uorc.Search.PackedFit::runWork 2000 (Uorc.Search.PackedFit::start (Uorc.Core.Bytes::fromBytes 0x00ff00ff) 1)) 0x00ff00ff) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -165,7 +165,7 @@ name: packed_proposal_resume_is_exact, parameters: [], statement: ((Uorc.Search.PackedFit::runWork 31 (Uorc.Search.PackedFit::runWork 17 (Uorc.Search.PackedFit::start (Uorc.Core.Bytes::fromBytes 0x616263616263) 1))) = (Uorc.Search.PackedFit::runWork 48 (Uorc.Search.PackedFit::start (Uorc.Core.Bytes::fromBytes 0x616263616263) 1))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Search/PackedLayout.lex.tex b/src/Uorc/Search/PackedLayout.lex.tex index 37c99720..2fc99597 100644 --- a/src/Uorc/Search/PackedLayout.lex.tex +++ b/src/Uorc/Search/PackedLayout.lex.tex @@ -157,7 +157,7 @@ name: alphabet1_canonical_layout, parameters: [], statement: ((accepted (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x) 17 0))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -165,7 +165,7 @@ name: alphabet2_canonical_layout, parameters: [], statement: ((accepted (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x55) 8 1))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -173,7 +173,7 @@ name: alphabet3_canonical_layout, parameters: [], statement: ((accepted (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x24) 3 2))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -181,7 +181,7 @@ name: alphabet127_canonical_layout, parameters: [], statement: ((accepted (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x7e) 1 7))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -189,7 +189,7 @@ name: alphabet128_canonical_layout, parameters: [], statement: ((accepted (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x7f) 1 7))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -197,7 +197,7 @@ name: alphabet129_canonical_layout, parameters: [], statement: ((accepted (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x80) 1 8))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -205,7 +205,7 @@ name: alphabet256_canonical_layout, parameters: [], statement: ((accepted (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0xff) 1 8))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -213,7 +213,7 @@ name: alphabet257_canonical_layout, parameters: [], statement: ((accepted (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x0001) 1 9))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -221,7 +221,7 @@ name: alphabet65537_canonical_layout, parameters: [], statement: ((accepted (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x000001) 1 17))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -229,7 +229,7 @@ name: truncated_rejected, parameters: [], statement: ((rejection (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x) 1 1))) = (ctor Option.some [Error] (ctor Error.truncatedPayload))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -237,7 +237,7 @@ name: truncated_partial_code_rejected, parameters: [], statement: ((rejection (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0xff) 1 9))) = (ctor Option.some [Error] (ctor Error.truncatedPayload))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -245,7 +245,7 @@ name: trailing_rejected, parameters: [], statement: ((rejection (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x0000) 1 8))) = (ctor Option.some [Error] (ctor Error.trailingPayload))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -253,7 +253,7 @@ name: zero_width_nonempty_rejected, parameters: [], statement: ((rejection (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x00) 8 0))) = (ctor Option.some [Error] (ctor Error.trailingPayload))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -261,7 +261,7 @@ name: high_padding_rejected, parameters: [], statement: ((rejection (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x80) 1 7))) = (ctor Option.some [Error] (ctor Error.nonzeroPadding))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -269,7 +269,7 @@ name: partial_padding_rejected, parameters: [], statement: ((rejection (runWork 100 (start (Uorc.Core.Bytes::fromBytes 0x0402) 1 9))) = (ctor Option.some [Error] (ctor Error.nonzeroPadding))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -277,7 +277,7 @@ name: layout_resume_is_exact, parameters: [], statement: ((runWork 7 (runWork 3 (start (Uorc.Core.Bytes::fromBytes 0x0001) 1 9))) = (runWork 10 (start (Uorc.Core.Bytes::fromBytes 0x0001) 1 9))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -285,7 +285,7 @@ name: native_product_exhaustion_is_operational, parameters: [], statement: ((rejection (start (Uorc.Core.Bytes::fromBytes 0x) 18446744073709551615 2)) = (ctor Option.some [Error] (ctor Error.addressSpaceExhausted))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Search/ProgramTrial.lex.tex b/src/Uorc/Search/ProgramTrial.lex.tex index d2ed548b..1ac2e93c 100644 --- a/src/Uorc/Search/ProgramTrial.lex.tex +++ b/src/Uorc/Search/ProgramTrial.lex.tex @@ -254,7 +254,7 @@ name: literal_round_trip_reparses_validates_executes_and_checks, parameters: [], statement: ((outcome (run 6000 (ctor Step.pending (start (record Query {target := (Uorc.Core.Bytes::fromBytes 0x0001ff), basis := (ctor Uorc.Core.Basis::Input.roots (nil Uorc.Core.Bytes::Rope)), budget := (record Uorc.Core.Resources::Budget {maxSteps := 10000, maxLiveCells := 10000, maxOutputBytes := 10000, maxFrames := 100}), initialUsage := (Uorc.Core.Resources::zeroUsage)}) (Uorc.Core.Graph::literalGraph 0x0001ff))))) = (ctor Outcome.accepted)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -262,7 +262,7 @@ name: changed_decoded_byte_is_rejected, parameters: [], statement: ((outcome (run 6000 (ctor Step.pending (start (record Query {target := (Uorc.Core.Bytes::fromBytes 0x0001ff), basis := (ctor Uorc.Core.Basis::Input.roots (nil Uorc.Core.Bytes::Rope)), budget := (record Uorc.Core.Resources::Budget {maxSteps := 10000, maxLiveCells := 10000, maxOutputBytes := 10000, maxFrames := 100}), initialUsage := (Uorc.Core.Resources::zeroUsage)}) (Uorc.Core.Graph::literalGraph 0x0001fe))))) = (ctor Outcome.rejected)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -270,7 +270,7 @@ name: unfunded_trial_never_supplies_checked_program, parameters: [], statement: ((outcome (run 0 (ctor Step.pending (start (record Query {target := (Uorc.Core.Bytes::fromBytes 0x0001ff), basis := (ctor Uorc.Core.Basis::Input.roots (nil Uorc.Core.Bytes::Rope)), budget := (record Uorc.Core.Resources::Budget {maxSteps := 10000, maxLiveCells := 10000, maxOutputBytes := 10000, maxFrames := 100}), initialUsage := (Uorc.Core.Resources::zeroUsage)}) (Uorc.Core.Graph::literalGraph 0x0001ff))))) = (ctor Outcome.waiting)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -278,7 +278,7 @@ name: trial_resume_preserves_exact_state, parameters: [], statement: ((run 73 (run 41 (ctor Step.pending (start (record Query {target := (Uorc.Core.Bytes::fromBytes 0x0001ff), basis := (ctor Uorc.Core.Basis::Input.roots (nil Uorc.Core.Bytes::Rope)), budget := (record Uorc.Core.Resources::Budget {maxSteps := 10000, maxLiveCells := 10000, maxOutputBytes := 10000, maxFrames := 100}), initialUsage := (Uorc.Core.Resources::zeroUsage)}) (Uorc.Core.Graph::literalGraph 0x0001ff))))) = (run 114 (ctor Step.pending (start (record Query {target := (Uorc.Core.Bytes::fromBytes 0x0001ff), basis := (ctor Uorc.Core.Basis::Input.roots (nil Uorc.Core.Bytes::Rope)), budget := (record Uorc.Core.Resources::Budget {maxSteps := 10000, maxLiveCells := 10000, maxOutputBytes := 10000, maxFrames := 100}), initialUsage := (Uorc.Core.Resources::zeroUsage)}) (Uorc.Core.Graph::literalGraph 0x0001ff))))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/ReplayControls.lex.tex b/src/Uorc/Search/ReplayControls.lex.tex index dfeae3c1..db806127 100644 --- a/src/Uorc/Search/ReplayControls.lex.tex +++ b/src/Uorc/Search/ReplayControls.lex.tex @@ -160,7 +160,7 @@ name: changed_original_is_rejected_before_winner_metadata, parameters: [], statement: ((Uorc.Search.Replay::outcome (Uorc.Search.Replay::run 1000 (ctor Uorc.Search.Replay::Step.pending (Uorc.Search.Replay::start (record Uorc.Search.Replay::Request {seal := (record Uorc.Search.Replay::Seal {query := (record Uorc.Search.Identity::Snapshot {archiveFormat := 2, machineProfile := 1, scope := (ctor Uorc.Wire.Frame::Scope.selfContained), objectLengths := (cons 2 (nil Nat)), target := (Uorc.Core.Bytes::fromBytes 0x00ff), basis := (nil Uorc.Core.Bytes::Rope), budget := (record Uorc.Core.Resources::Budget {maxSteps := 10000000, maxLiveCells := 10000000, maxOutputBytes := 10000000, maxFrames := 1000}), objective := (ctor Uorc.Search.Identity::Objective.wireLengthThenUnsignedLex)}), wireProfile := (Uorc.Core.Bytes::fromBytes 0x02), machineSource := (Uorc.Core.Bytes::fromBytes 0x01), basisSemantics := (Uorc.Core.Bytes::fromBytes 0x62617369732d7631), outputSemantics := (Uorc.Core.Bytes::fromBytes 0x6f7264657265642d656d7074792d6f626a65637473), objectiveSemantics := (Uorc.Core.Bytes::fromBytes 0x6c656e6774682d756e7369676e65642d6c6578), operationalAddressing := (Uorc.Search.Replay::operationalAddressingIdentity)}), winnerWire := (Uorc.Core.Bytes::fromBytes 0x)}) (record Uorc.Search.Replay::Seal {query := (record Uorc.Search.Identity::Snapshot {archiveFormat := 2, machineProfile := 1, scope := (ctor Uorc.Wire.Frame::Scope.selfContained), objectLengths := (cons 2 (nil Nat)), target := (Uorc.Core.Bytes::fromBytes 0x00fe), basis := (nil Uorc.Core.Bytes::Rope), budget := (record Uorc.Core.Resources::Budget {maxSteps := 10000000, maxLiveCells := 10000000, maxOutputBytes := 10000000, maxFrames := 1000}), objective := (ctor Uorc.Search.Identity::Objective.wireLengthThenUnsignedLex)}), wireProfile := (Uorc.Core.Bytes::fromBytes 0x02), machineSource := (Uorc.Core.Bytes::fromBytes 0x01), basisSemantics := (Uorc.Core.Bytes::fromBytes 0x62617369732d7631), outputSemantics := (Uorc.Core.Bytes::fromBytes 0x6f7264657265642d656d7074792d6f626a65637473), objectiveSemantics := (Uorc.Core.Bytes::fromBytes 0x6c656e6774682d756e7369676e65642d6c6578), operationalAddressing := (Uorc.Search.Replay::operationalAddressingIdentity)}))))) = (ctor Uorc.Search.Replay::Outcome.incomplete)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -168,7 +168,7 @@ name: native_addressing_identity_is_checked_not_advisory, parameters: [], statement: ((Uorc.Search.Replay::outcome (Uorc.Search.Replay::run 1000 (ctor Uorc.Search.Replay::Step.pending (Uorc.Search.Replay::start (record Uorc.Search.Replay::Request {seal := (record Uorc.Search.Replay::Seal {query := (record Uorc.Search.Identity::Snapshot {archiveFormat := 2, machineProfile := 1, scope := (ctor Uorc.Wire.Frame::Scope.selfContained), objectLengths := (nil Nat), target := (Uorc.Core.Bytes::fromBytes 0x), basis := (nil Uorc.Core.Bytes::Rope), budget := (record Uorc.Core.Resources::Budget {maxSteps := 10000000, maxLiveCells := 10000000, maxOutputBytes := 10000000, maxFrames := 1000}), objective := (ctor Uorc.Search.Identity::Objective.wireLengthThenUnsignedLex)}), wireProfile := (Uorc.Core.Bytes::fromBytes 0x02), machineSource := (Uorc.Core.Bytes::fromBytes 0x01), basisSemantics := (Uorc.Core.Bytes::fromBytes 0x62617369732d7631), outputSemantics := (Uorc.Core.Bytes::fromBytes 0x6f7264657265642d656d7074792d6f626a65637473), objectiveSemantics := (Uorc.Core.Bytes::fromBytes 0x6c656e6774682d756e7369676e65642d6c6578), operationalAddressing := (Uorc.Core.Bytes::fromBytes 0x00)}), winnerWire := (Uorc.Core.Bytes::fromBytes 0x)}) (record Uorc.Search.Replay::Seal {query := (record Uorc.Search.Identity::Snapshot {archiveFormat := 2, machineProfile := 1, scope := (ctor Uorc.Wire.Frame::Scope.selfContained), objectLengths := (nil Nat), target := (Uorc.Core.Bytes::fromBytes 0x), basis := (nil Uorc.Core.Bytes::Rope), budget := (record Uorc.Core.Resources::Budget {maxSteps := 10000000, maxLiveCells := 10000000, maxOutputBytes := 10000000, maxFrames := 1000}), objective := (ctor Uorc.Search.Identity::Objective.wireLengthThenUnsignedLex)}), wireProfile := (Uorc.Core.Bytes::fromBytes 0x02), machineSource := (Uorc.Core.Bytes::fromBytes 0x01), basisSemantics := (Uorc.Core.Bytes::fromBytes 0x62617369732d7631), outputSemantics := (Uorc.Core.Bytes::fromBytes 0x6f7264657265642d656d7074792d6f626a65637473), objectiveSemantics := (Uorc.Core.Bytes::fromBytes 0x6c656e6774682d756e7369676e65642d6c6578), operationalAddressing := (Uorc.Core.Bytes::fromBytes 0x00)}))))) = (ctor Uorc.Search.Replay::Outcome.incomplete)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/Residual.lex.tex b/src/Uorc/Search/Residual.lex.tex index fb879209..5ee3c8f9 100644 --- a/src/Uorc/Search/Residual.lex.tex +++ b/src/Uorc/Search/Residual.lex.tex @@ -164,7 +164,7 @@ name: residual_records_ff_and_zero_exactly, parameters: [], statement: ((runCollect 8 (beginCollect 0x00ff0200 0x00010203)) = (ctor CollectStep.done (cons (record Exception {coordinate := (3 : UInt64), value := (0 : UInt8)}) (cons (record Exception {coordinate := (1 : UInt64), value := (255 : UInt8)}) (nil Exception))) 4)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/ResidualRope.lex.tex b/src/Uorc/Search/ResidualRope.lex.tex index 1a621256..f7e4200f 100644 --- a/src/Uorc/Search/ResidualRope.lex.tex +++ b/src/Uorc/Search/ResidualRope.lex.tex @@ -141,7 +141,7 @@ name: full_rope_fit_preserves_zero_and_ff_residuals, parameters: [], statement: ((exceptions (run 100 (ctor Step.pending (start (Uorc.Core.Bytes::fromBytes 0x00ff0200) (Uorc.Core.Bytes::fromBytes 0x00010203))))) = (ctor Option.some [(List Uorc.Search.Residual::Exception)] (cons (record Uorc.Search.Residual::Exception {coordinate := (3 : UInt64), value := (0 : UInt8)}) (cons (record Uorc.Search.Residual::Exception {coordinate := (1 : UInt64), value := (255 : UInt8)}) (nil Uorc.Search.Residual::Exception))))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -149,7 +149,7 @@ name: residual_fit_ignores_transport_partition, parameters: [], statement: ((exceptions (run 100 (ctor Step.pending (start (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x00ff) (Uorc.Core.Bytes::fromBytes 0x0200)) (Uorc.Core.Bytes::fromBytes 0x00010203))))) = (exceptions (run 100 (ctor Step.pending (start (Uorc.Core.Bytes::fromBytes 0x00ff0200) (Uorc.Core.Bytes::fromBytes 0x00010203)))))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Search/RopeBuilder.lex.tex b/src/Uorc/Search/RopeBuilder.lex.tex index 62eb7dc3..dd55b2a2 100644 --- a/src/Uorc/Search/RopeBuilder.lex.tex +++ b/src/Uorc/Search/RopeBuilder.lex.tex @@ -56,8 +56,8 @@ statement: ((match (Uorc.Search.Normalize::canonicalResult (Uorc.Search.Normalize::run 80 (record Uorc.Search.Normalize::Policy {blockBytes := 1}) (ctor Uorc.Search.Normalize::Step.pending (finish (appendChunk (appendChunk (empty) 0x0001) 0xff80))))) | Option.none => false | Option.some normalized => (Uorc.Core.Bytes::valid (project normalized rope))) = true), - proof: reflexivity{}, - axioms: [Quot.sound, propext] + proof: evaluation{}, + axioms: [] } \end{semanticmodule} \end{lexlean} diff --git a/src/Uorc/Search/RopeQueue.lex.tex b/src/Uorc/Search/RopeQueue.lex.tex index d6b560d3..1f883556 100644 --- a/src/Uorc/Search/RopeQueue.lex.tex +++ b/src/Uorc/Search/RopeQueue.lex.tex @@ -94,7 +94,7 @@ name: full_wire_size_precedes_metadata, parameters: [], statement: ((run 80 (ctor Step.pending (beginInsert (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0xff), canonicalTask := 0xff}) (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x00ff), canonicalTask := 0x01}) (nil Task))))) = (ctor Step.done (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0xff), canonicalTask := 0xff}) (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x00ff), canonicalTask := 0x01}) (nil Task))))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -102,7 +102,7 @@ name: colliding_task_key_uses_exact_full_wire, parameters: [], statement: ((run 80 (ctor Step.pending (beginInsert (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x0080), canonicalTask := 0x01}) (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x00ff), canonicalTask := 0x01}) (nil Task))))) = (ctor Step.done (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x0080), canonicalTask := 0x01}) (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x00ff), canonicalTask := 0x01}) (nil Task))))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -110,7 +110,7 @@ name: whole_wire_equality_deduplicates, parameters: [], statement: ((run 80 (ctor Step.pending (beginInsert (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x00ff), canonicalTask := 0x01}) (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x00ff), canonicalTask := 0x01}) (nil Task))))) = (ctor Step.done (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x00ff), canonicalTask := 0x01}) (nil Task)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -118,7 +118,7 @@ name: fair_round_precedes_wire_size, parameters: [], statement: ((run 80 (ctor Step.pending (beginInsert (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 1, wire := (Uorc.Core.Bytes::fromBytes 0x00), canonicalTask := 0x00}) (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x00ff), canonicalTask := 0x01}) (nil Task))))) = (ctor Step.done (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 0, wire := (Uorc.Core.Bytes::fromBytes 0x00ff), canonicalTask := 0x01}) (cons (record Task {phase := (ctor Uorc.Search.Schedule::Phase.typedGeneration), round := 1, wire := (Uorc.Core.Bytes::fromBytes 0x00), canonicalTask := 0x00}) (nil Task))))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Search/RopeWords.lex.tex b/src/Uorc/Search/RopeWords.lex.tex index 1c926d6b..18848535 100644 --- a/src/Uorc/Search/RopeWords.lex.tex +++ b/src/Uorc/Search/RopeWords.lex.tex @@ -115,7 +115,7 @@ name: empty_word_is_a_real_rope_candidate, parameters: [], statement: ((wordLength (firstWord 30 (start 2))) = (ctor Option.some [Nat] 0)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Search/State.lex.tex b/src/Uorc/Search/State.lex.tex index f0c1dce2..1f28577f 100644 --- a/src/Uorc/Search/State.lex.tex +++ b/src/Uorc/Search/State.lex.tex @@ -142,7 +142,7 @@ name: transition_parameters_are_input_derived, parameters: [], statement: ((infer 0x0726c1c8 (5 : UInt64)) = (ctor Result.ok [Parameters, Error] (record Parameters {initial := (7 : UInt64), multiplier := (5 : UInt64), increment := (3 : UInt64)}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -157,7 +157,7 @@ name: all_256_multipliers_only_priority_not_universe, parameters: [], statement: ((step 0x0001 (record Cursor {nextMultiplier := 256})) = (ctor Step.finished)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } diff --git a/src/Uorc/Search/StreamBuilder.lex.tex b/src/Uorc/Search/StreamBuilder.lex.tex index c0f017f3..c2c3994b 100644 --- a/src/Uorc/Search/StreamBuilder.lex.tex +++ b/src/Uorc/Search/StreamBuilder.lex.tex @@ -100,7 +100,7 @@ | Uorc.Core.ByteBuilder::Event.appended builder => (ctor Step.failed (ctor Error.invalidState)) | Uorc.Core.ByteBuilder::Event.finished rope => (ctor Step.finished rope byteCount) | Uorc.Core.ByteBuilder::Event.failed error => (ctor Step.failed (ctor Error.builder error)))), - axioms: [Quot.sound, propext] + axioms: [] } definition{ @@ -108,7 +108,7 @@ parameters: [cursor : Cursor], result: Step, body: (if (((project cursor eventCredit) + 1) (ctor Option.none [Cursor]) | Option.some prefix => (advance 13 prefix)) = (advance 20 (start (Uorc.Core.Bytes::fromBytes 0x00010203) (record Uorc.Core.Resources::Budget {maxSteps := 1000000, maxLiveCells := 1000000, maxOutputBytes := 1000000, maxFrames := 100}) 12 (record Uorc.Search.Schedule::Policy {quantum := 1, sourceBinding := 0x01, seedInventoryBinding := 0x02}) (emptyInventory) (nil Uorc.Search.SharingJob::Spec)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -396,7 +396,7 @@ name: zero_effort_keeps_all_candidate_families, parameters: [], statement: ((advance 0 (start (Uorc.Core.Bytes::fromBytes 0x00010203) (record Uorc.Core.Resources::Budget {maxSteps := 1000000, maxLiveCells := 1000000, maxOutputBytes := 1000000, maxFrames := 100}) 12 (record Uorc.Search.Schedule::Policy {quantum := 1, sourceBinding := 0x01, seedInventoryBinding := 0x02}) (emptyInventory) (nil Uorc.Search.SharingJob::Spec))) = (ctor Option.some [Cursor] (start (Uorc.Core.Bytes::fromBytes 0x00010203) (record Uorc.Core.Resources::Budget {maxSteps := 1000000, maxLiveCells := 1000000, maxOutputBytes := 1000000, maxFrames := 100}) 12 (record Uorc.Search.Schedule::Policy {quantum := 1, sourceBinding := 0x01, seedInventoryBinding := 0x02}) (emptyInventory) (nil Uorc.Search.SharingJob::Spec)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -406,7 +406,7 @@ statement: ((match (advance 200 (start (Uorc.Core.Bytes::fromBytes 0x) (record Uorc.Core.Resources::Budget {maxSteps := 1000000, maxLiveCells := 1000000, maxOutputBytes := 1000000, maxFrames := 100}) 0 (record Uorc.Search.Schedule::Policy {quantum := 1, sourceBinding := 0x01, seedInventoryBinding := 0x02}) (emptyInventory) (nil Uorc.Search.SharingJob::Spec))) | Option.none => false | Option.some cursor => (proposalsFinished cursor)) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Wire/Cursor.lex.tex b/src/Uorc/Wire/Cursor.lex.tex index 259db12a..3ac5208d 100644 --- a/src/Uorc/Wire/Cursor.lex.tex +++ b/src/Uorc/Wire/Cursor.lex.tex @@ -146,7 +146,7 @@ name: empty_cursor, parameters: [], statement: ((readStep (start (nil Bytes))) = (ctor ReadEvent.end (start (nil Bytes)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -154,7 +154,7 @@ name: empty_chunk_advances, parameters: [], statement: ((readStep (start (cons 0x (nil Bytes)))) = (ctor ReadEvent.advanced (start (nil Bytes)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -162,7 +162,7 @@ name: uleb_0, parameters: [], statement: ((runUleb 30 (startUleb (start (cons 0x00 (nil Bytes))))) = (ctor UlebEvent.done 0 (record Cursor {parts := (cons 0x00 (nil Bytes)), offset := 1, position := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -170,7 +170,7 @@ name: uleb_1, parameters: [], statement: ((runUleb 30 (startUleb (start (cons 0x01 (nil Bytes))))) = (ctor UlebEvent.done 1 (record Cursor {parts := (cons 0x01 (nil Bytes)), offset := 1, position := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -178,7 +178,7 @@ name: uleb_127, parameters: [], statement: ((runUleb 30 (startUleb (start (cons 0x7f (nil Bytes))))) = (ctor UlebEvent.done 127 (record Cursor {parts := (cons 0x7f (nil Bytes)), offset := 1, position := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -186,7 +186,7 @@ name: uleb_128, parameters: [], statement: ((runUleb 30 (startUleb (start (cons 0x8001 (nil Bytes))))) = (ctor UlebEvent.done 128 (record Cursor {parts := (cons 0x8001 (nil Bytes)), offset := 2, position := 2}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -194,7 +194,7 @@ name: uleb_16384, parameters: [], statement: ((runUleb 30 (startUleb (start (cons 0x808001 (nil Bytes))))) = (ctor UlebEvent.done 16384 (record Cursor {parts := (cons 0x808001 (nil Bytes)), offset := 3, position := 3}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -202,7 +202,7 @@ name: uleb_18446744073709551615, parameters: [], statement: ((runUleb 30 (startUleb (start (cons 0xffffffffffffffffff01 (nil Bytes))))) = (ctor UlebEvent.done 18446744073709551615 (record Cursor {parts := (cons 0xffffffffffffffffff01 (nil Bytes)), offset := 10, position := 10}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -210,7 +210,7 @@ name: uleb_across_empty_partitions, parameters: [], statement: ((runUleb 30 (startUleb (start (cons 0x (cons 0x80 (cons 0x (cons 0x01 (nil Bytes)))))))) = (ctor UlebEvent.done 128 (record Cursor {parts := (cons 0x01 (nil Bytes)), offset := 1, position := 2}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -218,7 +218,7 @@ name: truncated, parameters: [], statement: ((runUleb 40 (startUleb (start (cons 0x (nil Bytes))))) = (ctor UlebEvent.failed (record LocatedError {kind := (ctor ReadError.truncated), offset := 0}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -226,7 +226,7 @@ name: truncated_continuation, parameters: [], statement: ((runUleb 40 (startUleb (start (cons 0x80 (nil Bytes))))) = (ctor UlebEvent.failed (record LocatedError {kind := (ctor ReadError.truncated), offset := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -234,7 +234,7 @@ name: overlong, parameters: [], statement: ((runUleb 40 (startUleb (start (cons 0x8000 (nil Bytes))))) = (ctor UlebEvent.failed (record LocatedError {kind := (ctor ReadError.nonShortest), offset := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -242,7 +242,7 @@ name: terminal_overflow, parameters: [], statement: ((runUleb 40 (startUleb (start (cons 0xffffffffffffffffff02 (nil Bytes))))) = (ctor UlebEvent.failed (record LocatedError {kind := (ctor ReadError.overflow), offset := 9}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -250,7 +250,7 @@ name: continuation_overflow, parameters: [], statement: ((runUleb 40 (startUleb (start (cons 0x80808080808080808080 (nil Bytes))))) = (ctor UlebEvent.failed (record LocatedError {kind := (ctor ReadError.overflow), offset := 10}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Wire/Frame.lex.tex b/src/Uorc/Wire/Frame.lex.tex index 050ae322..c4ea9392 100644 --- a/src/Uorc/Wire/Frame.lex.tex +++ b/src/Uorc/Wire/Frame.lex.tex @@ -165,7 +165,7 @@ name: prepare_empty_collection, parameters: [], statement: ((prepareFixture 30 (startPreparation (record Frame {objectLengths := (nil Nat), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x))}))) = (ctor PrepareEvent.complete (record Prepared {frame := (record Frame {objectLengths := (nil Nat), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x))}), objectCount := 0, outputLength := 0, bodyLength := 0}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -173,7 +173,7 @@ name: preimage_empty_collection, parameters: [], statement: ((Uorc.Wire.GraphEmit::collectFixture 300 (preimageStart (record Prepared {frame := (record Frame {objectLengths := (nil Nat), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x))}), objectCount := 0, outputLength := 0, bodyLength := 0})) 0x) = (ctor Option.some [Bytes] 0x554f5243020100000000)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -181,7 +181,7 @@ name: prepare_empty_object, parameters: [], statement: ((prepareFixture 30 (startPreparation (record Frame {objectLengths := (cons 0 (nil Nat)), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x))}))) = (ctor PrepareEvent.complete (record Prepared {frame := (record Frame {objectLengths := (cons 0 (nil Nat)), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x))}), objectCount := 1, outputLength := 0, bodyLength := 0}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -189,7 +189,7 @@ name: preimage_empty_object, parameters: [], statement: ((Uorc.Wire.GraphEmit::collectFixture 300 (preimageStart (record Prepared {frame := (record Frame {objectLengths := (cons 0 (nil Nat)), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x))}), objectCount := 1, outputLength := 0, bodyLength := 0})) 0x) = (ctor Option.some [Bytes] 0x554f524302010000010000)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -197,7 +197,7 @@ name: prepare_binary, parameters: [], statement: ((prepareFixture 30 (startPreparation (record Frame {objectLengths := (cons 3 (nil Nat)), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x00ff80))}))) = (ctor PrepareEvent.complete (record Prepared {frame := (record Frame {objectLengths := (cons 3 (nil Nat)), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x00ff80))}), objectCount := 1, outputLength := 3, bodyLength := 3}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -205,7 +205,7 @@ name: preimage_binary, parameters: [], statement: ((Uorc.Wire.GraphEmit::collectFixture 300 (preimageStart (record Prepared {frame := (record Frame {objectLengths := (cons 3 (nil Nat)), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x00ff80))}), objectCount := 1, outputLength := 3, bodyLength := 3})) 0x) = (ctor Option.some [Bytes] 0x554f52430201000001030300ff80)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -213,7 +213,7 @@ name: prepare_empty_boundaries, parameters: [], statement: ((prepareFixture 30 (startPreparation (record Frame {objectLengths := (cons 0 (cons 1 (cons 0 (cons 1 (cons 0 (nil Nat)))))), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x00ff))}))) = (ctor PrepareEvent.complete (record Prepared {frame := (record Frame {objectLengths := (cons 0 (cons 1 (cons 0 (cons 1 (cons 0 (nil Nat)))))), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x00ff))}), objectCount := 5, outputLength := 2, bodyLength := 2}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -221,7 +221,7 @@ name: preimage_empty_boundaries, parameters: [], statement: ((Uorc.Wire.GraphEmit::collectFixture 300 (preimageStart (record Prepared {frame := (record Frame {objectLengths := (cons 0 (cons 1 (cons 0 (cons 1 (cons 0 (nil Nat)))))), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x00ff))}), objectCount := 5, outputLength := 2, bodyLength := 2})) 0x) = (ctor Option.some [Bytes] 0x554f5243020100000500010001000200ff)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -229,7 +229,7 @@ name: reject_raw_mismatch, parameters: [], statement: ((prepareFixture 30 (startPreparation (record Frame {objectLengths := (cons 2 (nil Nat)), scope := (ctor Scope.selfContained), body := (ctor Body.raw (Uorc.Core.Bytes::fromBytes 0x00))}))) = (ctor PrepareEvent.failed (ctor PrepareError.rawLengthMismatch))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } \end{semanticmodule} diff --git a/src/Uorc/Wire/FrameParse.lex.tex b/src/Uorc/Wire/FrameParse.lex.tex index 11babc2f..735d450d 100644 --- a/src/Uorc/Wire/FrameParse.lex.tex +++ b/src/Uorc/Wire/FrameParse.lex.tex @@ -325,7 +325,7 @@ name: syntax_empty_collection, parameters: [], statement: ((accepted (runFixture 4000 (fixtureStart 0x554f52430201000000000000000000000000000000000000000000000000000000000000000000000000))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -333,7 +333,7 @@ name: syntax_empty_object, parameters: [], statement: ((accepted (runFixture 4000 (fixtureStart 0x554f5243020100000100000000000000000000000000000000000000000000000000000000000000000000))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -341,7 +341,7 @@ name: syntax_binary, parameters: [], statement: ((accepted (runFixture 4000 (fixtureStart 0x554f52430201000001030300ff800000000000000000000000000000000000000000000000000000000000000000))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -349,7 +349,7 @@ name: syntax_empty_boundaries, parameters: [], statement: ((accepted (runFixture 4000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -357,7 +357,7 @@ name: syntax_program, parameters: [], statement: ((accepted (runFixture 4000 (fixtureStart 0x554f52430201000101030b01000301030300ff8001000000000000000000000000000000000000000000000000000000000000000000))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -365,7 +365,7 @@ name: reject_truncated, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x))) = (ctor Option.some [ParseError] (ctor ParseError.truncated))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -373,7 +373,7 @@ name: reject_wrong_magic, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x00))) = (ctor Option.some [ParseError] (ctor ParseError.wrongMagic))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -381,7 +381,7 @@ name: reject_legacy_format, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x554f524301))) = (ctor Option.some [ParseError] (ctor ParseError.unsupportedFormat))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -389,7 +389,7 @@ name: reject_legacy_profile, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x554f52430202))) = (ctor Option.some [ParseError] (ctor ParseError.unsupportedProfile))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -397,7 +397,7 @@ name: reject_scope, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x554f5243020102))) = (ctor Option.some [ParseError] (ctor ParseError.invalidScope))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -405,7 +405,7 @@ name: reject_representation, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x554f524302010002))) = (ctor Option.some [ParseError] (ctor ParseError.invalidRepresentation))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -413,7 +413,7 @@ name: reject_overlong, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x554f5243020100008000))) = (ctor Option.some [ParseError] (ctor ParseError.nonShortest))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -421,7 +421,7 @@ name: reject_raw_length, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x554f524302010000010201))) = (ctor Option.some [ParseError] (ctor ParseError.rawLengthMismatch))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -429,7 +429,7 @@ name: reject_short_integrity, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x554f524302010000000000000000000000000000000000000000000000000000000000000000000000))) = (ctor Option.some [ParseError] (ctor ParseError.truncated))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -437,7 +437,7 @@ name: reject_trailing, parameters: [], statement: ((errorKind (runFixture 4000 (fixtureStart 0x554f5243020100000000000000000000000000000000000000000000000000000000000000000000000000))) = (ctor Option.some [ParseError] (ctor ParseError.trailingBytes))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -481,7 +481,7 @@ name: partition_0, parameters: [], statement: ((parsedValue (runChunksFixture 8000 (start) (cons 0x (cons 0x (cons 0x (cons 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000 (cons 0x (nil Bytes)))))))) = (parsedValue (runFixture 8000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -489,7 +489,7 @@ name: partition_1, parameters: [], statement: ((parsedValue (runChunksFixture 8000 (start) (cons 0x (cons 0x55 (cons 0x (cons 0x4f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000 (cons 0x (nil Bytes)))))))) = (parsedValue (runFixture 8000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -497,7 +497,7 @@ name: partition_4, parameters: [], statement: ((parsedValue (runChunksFixture 8000 (start) (cons 0x (cons 0x554f5243 (cons 0x (cons 0x020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000 (cons 0x (nil Bytes)))))))) = (parsedValue (runFixture 8000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -505,7 +505,7 @@ name: partition_8, parameters: [], statement: ((parsedValue (runChunksFixture 8000 (start) (cons 0x (cons 0x554f524302010000 (cons 0x (cons 0x0500010001000200ff0000000000000000000000000000000000000000000000000000000000000000 (cons 0x (nil Bytes)))))))) = (parsedValue (runFixture 8000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -513,7 +513,7 @@ name: partition_9, parameters: [], statement: ((parsedValue (runChunksFixture 8000 (start) (cons 0x (cons 0x554f52430201000005 (cons 0x (cons 0x00010001000200ff0000000000000000000000000000000000000000000000000000000000000000 (cons 0x (nil Bytes)))))))) = (parsedValue (runFixture 8000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -521,7 +521,7 @@ name: partition_15, parameters: [], statement: ((parsedValue (runChunksFixture 8000 (start) (cons 0x (cons 0x554f52430201000005000100010002 (cons 0x (cons 0x00ff0000000000000000000000000000000000000000000000000000000000000000 (cons 0x (nil Bytes)))))))) = (parsedValue (runFixture 8000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -529,7 +529,7 @@ name: partition_17, parameters: [], statement: ((parsedValue (runChunksFixture 8000 (start) (cons 0x (cons 0x554f5243020100000500010001000200ff (cons 0x (cons 0x0000000000000000000000000000000000000000000000000000000000000000 (cons 0x (nil Bytes)))))))) = (parsedValue (runFixture 8000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -537,7 +537,7 @@ name: partition_48, parameters: [], statement: ((parsedValue (runChunksFixture 8000 (start) (cons 0x (cons 0x554f5243020100000500010001000200ff00000000000000000000000000000000000000000000000000000000000000 (cons 0x (cons 0x00 (cons 0x (nil Bytes)))))))) = (parsedValue (runFixture 8000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -545,7 +545,7 @@ name: partition_49, parameters: [], statement: ((parsedValue (runChunksFixture 8000 (start) (cons 0x (cons 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000 (cons 0x (cons 0x (cons 0x (nil Bytes)))))))) = (parsedValue (runFixture 8000 (fixtureStart 0x554f5243020100000500010001000200ff0000000000000000000000000000000000000000000000000000000000000000)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -553,7 +553,7 @@ name: feed_without_demand_rejected, parameters: [], statement: ((errorKind (feed (start) 0x)) = (ctor Option.some [ParseError] (ctor ParseError.invalidState))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -561,7 +561,7 @@ name: eof_without_demand_rejected, parameters: [], statement: ((errorKind (finishInput (start))) = (ctor Option.some [ParseError] (ctor ParseError.invalidState))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -569,7 +569,7 @@ name: raw_copy_waits_for_credit_0, parameters: [], statement: ((step (let s : State := (start); (record State {cursor := (project s cursor), ended := (project s ended), waiting := (project s waiting), header := (project s header), body := (project s body), preimageLength := (project s preimageLength), stage := (ctor Stage.rawWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 0), work := 0})) 1) = (ctor Event.advanced (let s : State := (start); (record State {cursor := (project s cursor), ended := (project s ended), waiting := (project s waiting), header := (project s header), body := (project s body), preimageLength := (project s preimageLength), stage := (ctor Stage.rawWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 1), work := 1})))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -577,7 +577,7 @@ name: raw_copy_waits_for_credit_1, parameters: [], statement: ((step (let s : State := (start); (record State {cursor := (project s cursor), ended := (project s ended), waiting := (project s waiting), header := (project s header), body := (project s body), preimageLength := (project s preimageLength), stage := (ctor Stage.rawWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 1), work := 1})) 1) = (ctor Event.advanced (let s : State := (start); (record State {cursor := (project s cursor), ended := (project s ended), waiting := (project s waiting), header := (project s header), body := (project s body), preimageLength := (project s preimageLength), stage := (ctor Stage.rawWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 2), work := 2})))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -585,7 +585,7 @@ name: raw_copy_executes_only_after_three_units, parameters: [], statement: ((step (let s : State := (start); (record State {cursor := (project s cursor), ended := (project s ended), waiting := (project s waiting), header := (project s header), body := (project s body), preimageLength := (project s preimageLength), stage := (ctor Stage.rawWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 2), work := 2})) 1) = (ctor Event.advanced (let s : State := (start); (record State {cursor := (project s cursor), ended := (project s ended), waiting := (project s waiting), header := (project s header), body := (project s body), preimageLength := (project s preimageLength), stage := (ctor Stage.rawWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x0102 (nil (Option Bytes)) 1 2 4096) 0), work := 3})))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -593,7 +593,7 @@ name: parser_event_cost_is_one, parameters: [], statement: ((eventWork (start) 4096) = 1), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } diff --git a/src/Uorc/Wire/GraphEmit.lex.tex b/src/Uorc/Wire/GraphEmit.lex.tex index 995ba96a..2a042f9f 100644 --- a/src/Uorc/Wire/GraphEmit.lex.tex +++ b/src/Uorc/Wire/GraphEmit.lex.tex @@ -324,7 +324,7 @@ name: literal_empty, parameters: [], statement: ((collectFixture 1000 (start (Uorc.Core.Graph::literalGraph 0x)) 0x) = (ctor Option.some [Bytes] 0x0100030103000100)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -332,7 +332,7 @@ name: literal_00, parameters: [], statement: ((collectFixture 1000 (start (Uorc.Core.Graph::literalGraph 0x00)) 0x) = (ctor Option.some [Bytes] 0x010003010301000100)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -340,7 +340,7 @@ name: literal_00ff80, parameters: [], statement: ((collectFixture 1000 (start (Uorc.Core.Graph::literalGraph 0x00ff80)) 0x) = (ctor Option.some [Bytes] 0x01000301030300ff800100)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -348,7 +348,7 @@ name: literal_00017f80ff, parameters: [], statement: ((collectFixture 1000 (start (Uorc.Core.Graph::literalGraph 0x00017f80ff)) 0x) = (ctor Option.some [Bytes] 0x01000301030500017f80ff0100)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -356,7 +356,7 @@ name: partition_independent_literal, parameters: [], statement: ((collectFixture 1000 (start (Uorc.Core.Graph::literalRopeGraph (Uorc.Core.Bytes::join (Uorc.Core.Bytes::fromBytes 0x00) (Uorc.Core.Bytes::fromBytes 0xff80)))) 0x) = (ctor Option.some [Bytes] 0x01000301030300ff800100)), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -364,7 +364,7 @@ name: opcode_naturalConstant, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalConstant (0 : UInt64))) = 0), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -372,7 +372,7 @@ name: opcode_byteConstant, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.byteConstant (0 : UInt8))) = 1), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -380,7 +380,7 @@ name: opcode_predicateConstant, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.predicateConstant false)) = 2), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -388,7 +388,7 @@ name: opcode_sequenceConstant, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.sequenceConstant 0x)) = 3), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -396,7 +396,7 @@ name: opcode_naturalAdd, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalAdd 0 0)) = 4), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -404,7 +404,7 @@ name: opcode_naturalSubtract, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalSubtract 0 0)) = 5), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -412,7 +412,7 @@ name: opcode_naturalMultiply, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalMultiply 0 0)) = 6), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -420,7 +420,7 @@ name: opcode_naturalDivide, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalDivide 0 0)) = 7), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -428,7 +428,7 @@ name: opcode_naturalRemainder, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalRemainder 0 0)) = 8), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -436,7 +436,7 @@ name: opcode_naturalAnd, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalAnd 0 0)) = 9), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -444,7 +444,7 @@ name: opcode_naturalOr, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalOr 0 0)) = 10), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -452,7 +452,7 @@ name: opcode_naturalXor, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalXor 0 0)) = 11), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -460,7 +460,7 @@ name: opcode_naturalNot, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalNot 0)) = 12), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -468,7 +468,7 @@ name: opcode_naturalShiftLeft, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalShiftLeft 0 0)) = 13), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -476,7 +476,7 @@ name: opcode_naturalShiftRight, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalShiftRight 0 0)) = 14), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -484,7 +484,7 @@ name: opcode_naturalEqual, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalEqual 0 0)) = 15), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -492,7 +492,7 @@ name: opcode_naturalLess, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalLess 0 0)) = 16), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -500,7 +500,7 @@ name: opcode_byteEqual, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.byteEqual 0 0)) = 17), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -508,7 +508,7 @@ name: opcode_byteLess, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.byteLess 0 0)) = 18), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -516,7 +516,7 @@ name: opcode_naturalToByte, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.naturalToByte 0)) = 19), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -524,7 +524,7 @@ name: opcode_byteToNatural, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.byteToNatural 0)) = 20), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -532,7 +532,7 @@ name: opcode_predicateNot, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.predicateNot 0)) = 21), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -540,7 +540,7 @@ name: opcode_predicateAnd, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.predicateAnd 0 0)) = 22), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -548,7 +548,7 @@ name: opcode_predicateOr, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.predicateOr 0 0)) = 23), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -556,7 +556,7 @@ name: opcode_sequenceLength, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.sequenceLength 0)) = 24), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -564,7 +564,7 @@ name: opcode_sequenceIndex, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.sequenceIndex 0 0)) = 25), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -572,7 +572,7 @@ name: opcode_sequenceSlice, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.sequenceSlice 0 0 0)) = 26), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -580,7 +580,7 @@ name: opcode_sequenceConcat, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.sequenceConcat 0 0)) = 27), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -588,7 +588,7 @@ name: opcode_sequenceEqual, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.sequenceEqual 0 0)) = 28), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -596,7 +596,7 @@ name: opcode_singletonSequence, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.singletonSequence 0)) = 29), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -604,7 +604,7 @@ name: opcode_basisGet, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.basisGet 0)) = 30), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -612,7 +612,7 @@ name: opcode_storeNew, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.storeNew 0)) = 31), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -620,7 +620,7 @@ name: opcode_storeRead, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.storeRead 0 0)) = 32), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -628,7 +628,7 @@ name: opcode_storeWrite, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.storeWrite 0 0 0)) = 33), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -636,7 +636,7 @@ name: opcode_choose, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.choose 0 0 0)) = 34), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -644,7 +644,7 @@ name: opcode_apply, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.apply 0 (nil Nat))) = 35), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -652,7 +652,7 @@ name: opcode_tabulate, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.tabulate 0 0 (nil Nat))) = 36), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -660,7 +660,7 @@ name: opcode_fold, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.fold 0 0 0 (nil Nat))) = 37), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -668,7 +668,7 @@ name: opcode_scan, parameters: [], statement: ((opcode (ctor Uorc.Core.Graph::Instruction.scan 0 0 0 (nil Nat) 0 (nil Nat))) = 38), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } diff --git a/src/Uorc/Wire/GraphParse.lex.tex b/src/Uorc/Wire/GraphParse.lex.tex index 64a54381..cdef6917 100644 --- a/src/Uorc/Wire/GraphParse.lex.tex +++ b/src/Uorc/Wire/GraphParse.lex.tex @@ -1557,7 +1557,7 @@ name: empty_object, parameters: [], statement: ((accepted (runFixture 2000 (fixtureStart 0x0100030103000100))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1565,7 +1565,7 @@ name: binary_object, parameters: [], statement: ((accepted (runFixture 2000 (fixtureStart 0x01000301030300ff800100))) = true), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1573,7 +1573,7 @@ name: reject_truncated, parameters: [], statement: ((accepted (runFixture 2000 (fixtureStart 0x))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1581,7 +1581,7 @@ name: reject_unknown_type, parameters: [], statement: ((accepted (runFixture 2000 (fixtureStart 0x010005))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1589,7 +1589,7 @@ name: reject_unknown_opcode, parameters: [], statement: ((accepted (runFixture 2000 (fixtureStart 0x0100030127))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1597,7 +1597,7 @@ name: reject_overlong_count, parameters: [], statement: ((accepted (runFixture 2000 (fixtureStart 0x8000))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1605,7 +1605,7 @@ name: reject_trailing, parameters: [], statement: ((accepted (runFixture 2000 (fixtureStart 0x000000))) = false), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1613,7 +1613,7 @@ name: literal_copy_waits_for_credit_0, parameters: [], statement: ((step (record State {cursor := (Uorc.Wire.Cursor::start (nil Bytes)), ended := true, waiting := false, pending := (cons (ctor Task.literalWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 0) (nil Task)), values := (nil Atom), work := 0}) 1) = (ctor Event.advanced (record State {cursor := (Uorc.Wire.Cursor::start (nil Bytes)), ended := true, waiting := false, pending := (cons (ctor Task.literalWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 1) (nil Task)), values := (nil Atom), work := 1}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1621,7 +1621,7 @@ name: literal_copy_waits_for_credit_1, parameters: [], statement: ((step (record State {cursor := (Uorc.Wire.Cursor::start (nil Bytes)), ended := true, waiting := false, pending := (cons (ctor Task.literalWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 1) (nil Task)), values := (nil Atom), work := 1}) 1) = (ctor Event.advanced (record State {cursor := (Uorc.Wire.Cursor::start (nil Bytes)), ended := true, waiting := false, pending := (cons (ctor Task.literalWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 2) (nil Task)), values := (nil Atom), work := 2}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1629,7 +1629,7 @@ name: literal_copy_executes_only_after_three_units, parameters: [], statement: ((step (record State {cursor := (Uorc.Wire.Cursor::start (nil Bytes)), ended := true, waiting := false, pending := (cons (ctor Task.literalWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x02 (cons (ctor Option.some [Bytes] 0x01) (nil (Option Bytes))) 0 2 4096) 2) (nil Task)), values := (nil Atom), work := 2}) 1) = (ctor Event.advanced (record State {cursor := (Uorc.Wire.Cursor::start (nil Bytes)), ended := true, waiting := false, pending := (cons (ctor Task.literalWork 0 (ctor Uorc.Core.ByteBuilder::Work.merging (ctor Uorc.Core.Bytes::Rope.empty) 0x0102 (nil (Option Bytes)) 1 2 4096) 0) (nil Task)), values := (nil Atom), work := 3}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [Quot.sound, propext] } @@ -1637,7 +1637,7 @@ name: parser_event_cost_is_one, parameters: [], statement: ((eventWork (start) 4096) = 1), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } diff --git a/src/Uorc/Wire/ObjectSplit.lex.tex b/src/Uorc/Wire/ObjectSplit.lex.tex index 20ab94ae..52ad1160 100644 --- a/src/Uorc/Wire/ObjectSplit.lex.tex +++ b/src/Uorc/Wire/ObjectSplit.lex.tex @@ -166,7 +166,7 @@ name: zero_objects, parameters: [], statement: ((runFixture (nil Nat) (nil Bytes) 2) = (ctor FixtureResult.done (nil Bytes))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -174,7 +174,7 @@ name: one_empty, parameters: [], statement: ((runFixture (cons 0 (nil Nat)) (nil Bytes) 2) = (ctor FixtureResult.done (cons 0x (nil Bytes)))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -182,7 +182,7 @@ name: three_empty, parameters: [], statement: ((runFixture (cons 0 (cons 0 (cons 0 (nil Nat)))) (cons 0x (cons 0x (nil Bytes))) 2) = (ctor FixtureResult.done (cons 0x (cons 0x (cons 0x (nil Bytes)))))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -397,7 +397,7 @@ name: feed_requires_demand, parameters: [], statement: ((feed (start (cons 1 (nil Nat))) 0x00) = (ctor Event.failed (record Error {kind := (ctor SplitError.inputNotRequested), objectIndex := 0, objectOffset := 0}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -405,7 +405,7 @@ name: end_requires_demand, parameters: [], statement: ((finishInput (start (cons 1 (nil Nat)))) = (ctor Event.failed (record Error {kind := (ctor SplitError.inputNotRequested), objectIndex := 0, objectOffset := 0}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -413,7 +413,7 @@ name: positive_quantum_required, parameters: [], statement: ((step (start (cons 1 (nil Nat))) 0) = (ctor Event.failed (record Error {kind := (ctor SplitError.invalidQuantum), objectIndex := 0, objectOffset := 0}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -421,7 +421,7 @@ name: end_is_one_shot, parameters: [], statement: ((finishInput (record State {lengths := (nil Nat), phase := (ctor Phase.awaitingEnd), objectIndex := 0, objectLength := 0, remaining := 0, input := 0x, offset := 0, waiting := false, ended := true})) = (ctor Event.failed (record Error {kind := (ctor SplitError.endAlreadySeen), objectIndex := 0, objectOffset := 0}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -429,7 +429,7 @@ name: invalid_cursor_rejected, parameters: [], statement: ((step (record State {lengths := (nil Nat), phase := (ctor Phase.awaitingEnd), objectIndex := 0, objectLength := 0, remaining := 0, input := 0x, offset := 1, waiting := false, ended := false}) 1) = (ctor Event.failed (record Error {kind := (ctor SplitError.invalidCursor), objectIndex := 0, objectOffset := 0}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } @@ -437,7 +437,7 @@ name: object_counter_exhaustion_is_operational, parameters: [], statement: ((step (record State {lengths := (nil Nat), phase := (ctor Phase.closing), objectIndex := 18446744073709551615, objectLength := 0, remaining := 0, input := 0x, offset := 0, waiting := false, ended := false}) 1) = (ctor Event.failed (record Error {kind := (ctor SplitError.addressSpaceExhausted), objectIndex := 18446744073709551615, objectOffset := 0}))), - proof: reflexivity{}, + proof: evaluation{}, axioms: [] } diff --git a/xtask/Cargo.toml b/xtask/Cargo.toml index 72600bbd..5a385043 100644 --- a/xtask/Cargo.toml +++ b/xtask/Cargo.toml @@ -11,7 +11,7 @@ publish = false repo-model = { workspace = true } serde_json = "1.0.151" sha2 = "0.11.1" -lexlean = "=0.4.0" +lexlean = { workspace = true } [lints] workspace = true