Kim Morrison
c7b8c5c6a6
chore: alignment of Array and List lemmas ( #6342 )
...
Further alignment of `Array` and `List` lemmas. Moved lemmas about
`List.toArray` to a separate file, and aligned lemmas about membership.
2024-12-09 11:30:45 +00:00
Kyle Miller
3f791933f1
chore: release notes for 4.14.0 ( #6339 )
2024-12-09 05:30:50 +00:00
Kyle Miller
63791f0177
feat: _ separators in numeric literals ( #6204 )
...
This PR lets `_` be used in numeric literals as a separator. For
example, `1_000_000`, `0xff_ff` or `0b_10_11_01_00`. New lexical syntax:
```text
numeral10 : [0-9]+ ("_"+ [0-9]+)*
numeral2 : "0" [bB] ("_"* [0-1]+)+
numeral8 : "0" [oO] ("_"* [0-7]+)+
numeral16 : "0" [xX] ("_"* hex_char+)+
float : numeral10 "." numeral10? [eE[+-]numeral10]
```
Closes #6199
2024-12-08 22:23:12 +00:00
Kim Morrison
6abb8aad43
chore: cleanup of Array lemmas ( #6337 )
...
This PRs continues cleaning up Array lemmas and improving alignment with
List.
2024-12-08 22:03:23 +00:00
Kim Morrison
4dd182c554
chore: remove deprecated aliases for Int.tdiv and Int.tmod ( #6322 )
...
This PR removes the deprecated aliases `Int.div := Int.tdiv` and
`Int.mod := Int.tmod`. Later we will rename `Int.ediv` to `Int.div` and
`Int.emod` to `Int.mod`.
2024-12-08 05:19:42 +00:00
jsr-p
762c5758f5
doc: missing (type := true) in reader monad example ( #6196 )
...
This PR adds missing `(types := true)` to `#reduce` example in [Readers
example](https://lean-lang.org/lean4/doc/monads/readers.lean.html ).
Since [4.10](https://lean-lang.org/blog/2024-8-1-lean-4100/ ) the `(types
:= true)` is necessary for the `ReaderM Environment String` type to be
reduced into `Environment → String`.
2024-12-07 15:59:36 +00:00
Joachim Breitner
6447fda253
feat: FunInd: omit unused parameters ( #6330 )
...
This PR removes unnecessary parameters from the funcion induction
principles. This is a breaking change; broken code can typically be adjusted
simply by passing fewer parameters.
Part 2, adjusting after stage0 update.
Closes #6320
2024-12-07 04:19:21 +01:00
Joachim Breitner
279f36b4cc
chore: update stage0
2024-12-07 04:19:21 +01:00
Joachim Breitner
d2853ecbc4
feat: FunInd: omit unused parameters ( #6330 )
...
This PR removes unnecessary parameters from the funcion induction
principles. This is a breaking change; broken code can typically be adjusted
simply by passing fewer parameters.
Part 1, before stage0 update.
Closes #6320
2024-12-07 04:19:21 +01:00
Kim Morrison
6e60d13084
feat: getElem lemmas for Vector operations ( #6324 )
...
This PR adds `GetElem` lemmas for the basic `Vector` operations.
The `Vector` API is still very sparse, but I'm hoping to infill rapidly.
2024-12-06 01:45:19 +00:00
Kim Morrison
019f8e175f
chore: protect Fin.cast and BitVec.cast ( #6315 )
...
This PR adds `protected` to `Fin.cast` and `BitVec.cast`, to avoid
confusion with `_root_.cast`. These should mostly be used via
dot-notation in any case.
2024-12-05 06:11:45 +00:00
Kim Morrison
c366a291ca
chore: generalize universe in Array.find? ( #6318 )
...
This PR generalizes the universe level for `Array.find?`, by giving it a
separate implementation from `Array.findM?`.
2024-12-05 06:11:40 +00:00
Alex Keizer
1400b95ffb
feat: upstream ToLevel from mathlib ( #6285 )
...
This PR upstreams the `ToLevel` typeclass from mathlib and uses it to
fix the existing `ToExpr` instances so that they are truly universe
polymorphic (previously it generated malformed expressions when the
universe level was nonzero). We improve on the mathlib definition of
`ToLevel` to ensure the class always lives in `Type`, irrespective of
the universe parameter.
This implements part one of the plan to upstream a derive handler for
`ToExpr`, as discussed in #5906 and #5909 .
---------
Co-authored-by: Kyle Miller <kmill31415@gmail.com>
Co-authored-by: Tobias Grosser <tobias@grosser.es>
2024-12-05 05:50:32 +00:00
Kim Morrison
00c7b85261
feat: lemmas about for loops over Option ( #6316 )
...
This PR adds lemmas simplifying `for` loops over `Option` into
`Option.pelim`, giving parity with lemmas simplifying `for` loops of
`List` into `List.fold`.
2024-12-05 05:09:07 +00:00
Leonardo de Moura
f6e88e5a05
fix: missing HEq support at ToLCNF ( #6311 )
...
This PR adds support for `HEq` to the new code generator.
2024-12-04 19:49:16 +00:00
Sebastian Ullrich
88573c802d
test: do not filter output for non-diff tests ( #6308 )
2024-12-04 17:49:35 +00:00
Henrik Böving
faf07e58db
chore: remove unused imports ( #6305 )
...
This PR removes an unused import in the time library that can yield to
import cycles when building stuff that gets imported by `Std.Internal`
but also wants to import `Std.Time`.
2024-12-04 12:46:08 +00:00
Tobias Grosser
c5181569f9
feat: BitVec.[toInt|toFin]_concat and Bool.toInt ( #6182 )
...
This PR adds `BitVec.[toInt|toFin]_concat` and moves a couple of
theorems into the concat section, as `BitVec.msb_concat` is needed for
the `toInt_concat` proof.
We also add `Bool.toInt`.
2024-12-04 01:53:30 +00:00
Siddharth
77211029da
feat: BitVec.toFin/ToInt BitVec.ushiftRight ( #6238 )
...
This PR adds theorems characterizing the value of the unsigned shift
right of a bitvector in terms of its 2s complement interpretation as an
integer.
Unsigned shift right by at least one bit makes the value of the
bitvector less than or equal to `2^(w-1)`,
makes the interpretation of the bitvector `Int` and `Nat` agree.
In the case when `n = 0`, then the shift right value equals the integer
interpretation.
```lean
theorem toInt_ushiftRight_eq_ite {x : BitVec w} {n : Nat} :
(x >>> n).toInt = if n = 0 then x.toInt else x.toNat >>> n
```
```lean
theorem toFin_uShiftRight {x : BitVec w} {n : Nat} :
(x >>> n).toFin = x.toFin / (Fin.ofNat' (2^w) (2^n))
```
---------
Co-authored-by: Harun Khan <harun19@stanford.edu>
Co-authored-by: Tobias Grosser <github@grosser.es>
2024-12-04 01:49:58 +00:00
Lean stage0 autoupdater
da9a0c4190
chore: update stage0
2024-12-04 00:04:00 +00:00
Leonardo de Moura
b9bf94313a
feat: add debug.proofAsSorry ( #6300 )
...
This PR adds the `debug.proofAsSorry` option. When enabled, the proofs
of theorems are ignored and replaced with `sorry`.
2024-12-03 23:21:38 +00:00
Sebastian Ullrich
2a891a3889
chore: CMAKE_CXX_SYSROOT_FLAG is also needed for linking ( #6297 )
...
Fixes #6296
2024-12-03 16:14:22 +00:00
Sebastian Ullrich
00718c3959
chore: clean up Elab.async handling ( #6299 )
...
* Make sure metaprogramming users cannot be surprised by its
introduction
* Make `#guard_msgs` compatible with its use
2024-12-03 12:42:02 +00:00
Sebastian Ullrich
473274f145
chore: update stage0
2024-12-03 13:59:37 +01:00
Kim Morrison
7b98fbece4
feat: reverse HashMap.toList, so it agrees with HashMap.toArray ( #6244 )
...
This PR changes the implementation of `HashMap.toList`, so the ordering
agrees with `HashMap.toArray`.
Currently there are no verification lemmas about `HashMap.toList`, so no
contract is being broken yet!
2024-12-03 12:25:35 +00:00
Henrik Böving
24b412ebe3
refactor: move IO.Channel and IO.Mutex to Std.Sync ( #6282 )
...
This PR moves `IO.Channel` and `IO.Mutex` from `Init` to `Std.Sync` and
renames them to `Std.Channel` and `Std.Mutex`.
Note that the original files are retained and the deprecation is written
manually as we cannot import `Std` from `Init` so this is the only way
to deprecate without a hard breaking change. In particular we do not yet
move `Std.Queue` from `Init` to `Std` both because it needs to be
retained for this deprecation to work but also because it is already
within the `Std` namespace and as such we cannot maintain two copies of
the file at once. After the deprecation period is finished `Std.Queue`
will find a new home in `Std.Data.Queue`.
2024-12-03 09:36:50 +00:00
Kim Morrison
cb600ed9b4
chore: restore broken proofs
...
This reverts commit d099f560f72b5f18695c7fb586a9da93af0cb17e.
2024-12-03 17:59:23 +11:00
Kim Morrison
57d83c835e
feat: add simp configuration to norm_cast macros
2024-12-03 17:59:23 +11:00
Kim Morrison
ce27d49e31
chore: update stage0
2024-12-03 17:59:23 +11:00
Kim Morrison
8a7889d602
chore: temporarily sorry broken proofs
2024-12-03 17:59:23 +11:00
Kim Morrison
69340297be
chore: add simp configuration to norm_cast syntax
...
chore: define NormCastConfig earlier
2024-12-03 17:59:23 +11:00
Kim Morrison
222abdd43d
feat: simprocs for other Fin operations ( #6295 )
...
This PR sets up simprocs for all the remaining operations defined in
`Init.Data.Fin.Basic`
2024-12-03 04:42:17 +00:00
François G. Dorais
490be9282e
chore: specialize fold loops ( #6293 )
...
This PR adds `specialize` and `semireducible` attributes to loops for
`Fin.fold[lr]M?`
2024-12-03 02:44:19 +00:00
Kim Morrison
cda6d5c67a
chore: upstream List.length_flatMap ( #6294 )
...
This PR upstreams `List.length_flatMap`, `countP_flatMap` and
`count_flatMap` from Mathlib. These were not possible to state before we
upstreamed `List.sum`.
2024-12-03 01:59:32 +00:00
Kim Morrison
904404303b
chore: robustify for byAsSorry ( #6287 )
...
This PR makes some proofs more robust so they will still work with
`byAsSorry`. Unfortunately, they are not a complete fix and there are
remaining problems building with `byAsSorry`.
2024-12-02 23:53:16 +00:00
Mac Malone
f6bc6b2eb1
fix: lake: properly prepend job log in ensureJob ( #6291 )
...
This PR ensures the the log error position is properly preserved when
prepending stray log entries to the job log. It also adds comparison
support for `Log.Pos`.
2024-12-02 23:43:12 +00:00
Mac Malone
d9d54c1f99
chore: lake: use & check prelude ( #6289 )
...
This PR adapts Lake modules to use `prelude` and includes them in the
`check-prelude` CI.
2024-12-02 19:55:05 +00:00
Henrik Böving
b2336fd980
perf: speed up bv_decide reflection using Lean.RArray ( #6288 )
...
This PR uses Lean.RArray in bv_decide's reflection proofs. Giving
speedups on problems with lots of variables.
Implement like #6068 , speedup:
```
# before
λ hyperfine "lean +nightly-2024-12-02 tests/lean/run/bv_reflection_stress.lean"
Benchmark 1: lean +nightly-2024-12-02 tests/lean/run/bv_reflection_stress.lean
Time (mean ± σ): 1.939 s ± 0.007 s [User: 1.549 s, System: 0.104 s]
Range (min … max): 1.928 s … 1.947 s 10 runs
# after
λ hyperfine "lean tests/lean/run/bv_reflection_stress.lean"
Benchmark 1: lean tests/lean/run/bv_reflection_stress.lean
Time (mean ± σ): 1.409 s ± 0.006 s [User: 1.058 s, System: 0.073 s]
Range (min … max): 1.401 s … 1.419 s 10 runs
```
2024-12-02 17:44:58 +00:00
Mac Malone
f156f22d7c
feat: lake: build without leanc ( #6176 )
...
This PR changes Lake's build process to no longer use `leanc` for
compiling C files or linking shared libraries and executables. Instead,
it directly invokes the bundled compiler (or the native compiler if
none) using the necessary flags.
2024-12-02 17:11:27 +00:00
dependabot[bot]
3c348d4526
chore: CI: bump dawidd6/action-download-artifact from 6 to 7 ( #6274 )
...
Bumps
[dawidd6/action-download-artifact](https://github.com/dawidd6/action-download-artifact )
from 6 to 7.
<details>
<summary>Release notes</summary>
<p><em>Sourced from <a
href="https://github.com/dawidd6/action-download-artifact/releases ">dawidd6/action-download-artifact's
releases</a>.</em></p>
<blockquote>
<h2>v7</h2>
<h2>What's Changed</h2>
<ul>
<li>build(deps): bump fast-xml-parser from 4.4.0 to 4.4.1 by <a
href="https://github.com/dependabot "><code>@dependabot</code></a> in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/299 ">dawidd6/action-download-artifact#299</a></li>
<li>build(deps): bump <code>@actions/artifact</code> from 2.1.7 to
2.1.9 by <a
href="https://github.com/dependabot "><code>@dependabot</code></a> in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/300 ">dawidd6/action-download-artifact#300</a></li>
<li>build(deps): bump adm-zip from 0.5.14 to 0.5.15 by <a
href="https://github.com/dependabot "><code>@dependabot</code></a> in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/301 ">dawidd6/action-download-artifact#301</a></li>
<li>build(deps): bump adm-zip from 0.5.15 to 0.5.16 by <a
href="https://github.com/dependabot "><code>@dependabot</code></a> in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/306 ">dawidd6/action-download-artifact#306</a></li>
<li>build(deps): bump path-to-regexp from 6.2.2 to 6.3.0 by <a
href="https://github.com/dependabot "><code>@dependabot</code></a> in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/307 ">dawidd6/action-download-artifact#307</a></li>
<li>build(deps): bump <code>@actions/artifact</code> from 2.1.9 to
2.1.10 by <a
href="https://github.com/dependabot "><code>@dependabot</code></a> in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/311 ">dawidd6/action-download-artifact#311</a></li>
<li>build(deps): bump <code>@actions/core</code> from 1.10.1 to 1.11.0
by <a href="https://github.com/dependabot "><code>@dependabot</code></a>
in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/310 ">dawidd6/action-download-artifact#310</a></li>
<li>build(deps): bump <code>@actions/core</code> from 1.11.0 to 1.11.1
by <a href="https://github.com/dependabot "><code>@dependabot</code></a>
in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/312 ">dawidd6/action-download-artifact#312</a></li>
<li>build(deps): bump <code>@actions/artifact</code> from 2.1.10 to
2.1.11 by <a
href="https://github.com/dependabot "><code>@dependabot</code></a> in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/313 ">dawidd6/action-download-artifact#313</a></li>
<li>build(deps): Fix cross-spawn >=7.0.0 <= 7.0.5 vulnerability by
<a href="https://github.com/alexcouret "><code>@alexcouret</code></a> in
<a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/317 ">dawidd6/action-download-artifact#317</a></li>
</ul>
<h2>New Contributors</h2>
<ul>
<li><a
href="https://github.com/alexcouret "><code>@alexcouret</code></a> made
their first contribution in <a
href="https://redirect.github.com/dawidd6/action-download-artifact/pull/317 ">dawidd6/action-download-artifact#317</a></li>
</ul>
<p><strong>Full Changelog</strong>: <a
href="https://github.com/dawidd6/action-download-artifact/compare/v6...v7 ">https://github.com/dawidd6/action-download-artifact/compare/v6...v7 </a></p>
</blockquote>
</details>
<details>
<summary>Commits</summary>
<ul>
<li><a
href="80620a5d27b15e003f461ee9a455fdhttps://redirect.github.com/dawidd6/action-download-artifact/issues/317 ">#317</a>)</li>
<li><a
href="b2f2706ac4https://redirect.github.com/dawidd6/action-download-artifact/issues/313 ">#313</a>)</li>
<li><a
href="fdbeba027chttps://redirect.github.com/dawidd6/action-download-artifact/issues/312 ">#312</a>)</li>
<li><a
href="a74b42987ahttps://redirect.github.com/dawidd6/action-download-artifact/issues/310 ">#310</a>)</li>
<li><a
href="24e807a70chttps://redirect.github.com/dawidd6/action-download-artifact/issues/311 ">#311</a>)</li>
<li><a
href="9592e3c4abhttps://redirect.github.com/dawidd6/action-download-artifact/issues/307 ">#307</a>)</li>
<li><a
href="5f966b63ebhttps://redirect.github.com/dawidd6/action-download-artifact/issues/306 ">#306</a>)</li>
<li><a
href="db9477a3ebhttps://redirect.github.com/dawidd6/action-download-artifact/issues/301 ">#301</a>)</li>
<li>Additional commits viewable in <a
href="https://github.com/dawidd6/action-download-artifact/compare/v6...v7 ">compare
view</a></li>
</ul>
</details>
<br />
[](https://docs.github.com/en/github/managing-security-vulnerabilities/about-dependabot-security-updates#about-compatibility-scores )
Dependabot will resolve any conflicts with this PR as long as you don't
alter it yourself. You can also trigger a rebase manually by commenting
`@dependabot rebase`.
[//]: # (dependabot-automerge-start)
[//]: # (dependabot-automerge-end)
---
<details>
<summary>Dependabot commands and options</summary>
<br />
You can trigger Dependabot actions by commenting on this PR:
- `@dependabot rebase` will rebase this PR
- `@dependabot recreate` will recreate this PR, overwriting any edits
that have been made to it
- `@dependabot merge` will merge this PR after your CI passes on it
- `@dependabot squash and merge` will squash and merge this PR after
your CI passes on it
- `@dependabot cancel merge` will cancel a previously requested merge
and block automerging
- `@dependabot reopen` will reopen this PR if it is closed
- `@dependabot close` will close this PR and stop Dependabot recreating
it. You can achieve the same result by closing it manually
- `@dependabot show <dependency name> ignore conditions` will show all
of the ignore conditions of the specified dependency
- `@dependabot ignore this major version` will close this PR and stop
Dependabot creating any more for this major version (unless you reopen
the PR or upgrade to it yourself)
- `@dependabot ignore this minor version` will close this PR and stop
Dependabot creating any more for this minor version (unless you reopen
the PR or upgrade to it yourself)
- `@dependabot ignore this dependency` will close this PR and stop
Dependabot creating any more for this dependency (unless you reopen the
PR or upgrade to it yourself)
</details>
Signed-off-by: dependabot[bot] <support@github.com>
Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>
2024-12-02 16:09:50 +00:00
Sebastian Ullrich
0b8f50f78d
feat: async linting ( #4460 )
...
This PR runs all linters for a single command (together) on a separate
thread from further elaboration, making a first step towards
parallelizing the elaborator.
2024-12-02 14:37:03 +00:00
Henrik Böving
0d89f0194b
perf: bv_decide uses rfl in reflection if possible ( #6286 )
...
This PR ensure `bv_decide` uses definitional equality in its reflection
procedure as much as possible. Previously it would build up explicit
congruence proofs for the kernel to check. This reduces the size of
proof terms passed to kernel speeds up checking of large reflection
proofs.
2024-12-02 14:27:49 +00:00
Kim Morrison
e157fcbcd1
chore: missing Array/Vector injectivity lemmas ( #6284 )
2024-12-02 11:00:03 +00:00
Henrik Böving
95dbac26cf
chore: shake Std.Time ( #6283 )
...
This PR reduces the import closure of `Std.Time` such that it doesn't
have to be rebuilt on every change in `Init.Data`.
Noticed while working on `Init` refactorings.
2024-12-02 10:52:43 +00:00
dependabot[bot]
be63c8280e
chore: CI: bump dcarbone/install-jq-action from 2.1.0 to 3.0.1 ( #6275 )
...
Bumps
[dcarbone/install-jq-action](https://github.com/dcarbone/install-jq-action )
from 2.1.0 to 3.0.1.
<details>
<summary>Release notes</summary>
<p><em>Sourced from <a
href="https://github.com/dcarbone/install-jq-action/releases ">dcarbone/install-jq-action's
releases</a>.</em></p>
<blockquote>
<h2>v3.0.1</h2>
<h2>What's Changed</h2>
<ul>
<li>Use sh in action by <a
href="https://github.com/dcarbone "><code>@dcarbone</code></a> in <a
href="https://redirect.github.com/dcarbone/install-jq-action/pull/15 ">dcarbone/install-jq-action#15</a></li>
</ul>
<p><strong>Full Changelog</strong>: <a
href="https://github.com/dcarbone/install-jq-action/compare/v3.0.0...v3.0.1 ">https://github.com/dcarbone/install-jq-action/compare/v3.0.0...v3.0.1 </a></p>
<h2>v3.0.0</h2>
<h2>What's Changed</h2>
<ul>
<li>updating matrix versions by <a
href="https://github.com/dcarbone "><code>@dcarbone</code></a> in <a
href="https://redirect.github.com/dcarbone/install-jq-action/pull/12 ">dcarbone/install-jq-action#12</a></li>
<li>trying out posix sh by <a
href="https://github.com/dcarbone "><code>@dcarbone</code></a> in <a
href="https://redirect.github.com/dcarbone/install-jq-action/pull/14 ">dcarbone/install-jq-action#14</a></li>
</ul>
<p><strong>Full Changelog</strong>: <a
href="https://github.com/dcarbone/install-jq-action/compare/v2...v3.0.0 ">https://github.com/dcarbone/install-jq-action/compare/v2...v3.0.0 </a></p>
</blockquote>
</details>
<details>
<summary>Commits</summary>
<ul>
<li><a
href="e397bd8743https://redirect.github.com/dcarbone/install-jq-action/issues/15 ">#15</a>)</li>
<li><a
href="36b228ee68d5935278d5ca8101273ehttps://redirect.github.com/dcarbone/install-jq-action/issues/14 ">#14</a>)</li>
<li><a
href="de7c0d1fb1https://redirect.github.com/dcarbone/install-jq-action/issues/12 ">#12</a>)</li>
<li>See full diff in <a
href="https://github.com/dcarbone/install-jq-action/compare/v2.1.0...v3.0.1 ">compare
view</a></li>
</ul>
</details>
<br />
[](https://docs.github.com/en/github/managing-security-vulnerabilities/about-dependabot-security-updates#about-compatibility-scores )
Dependabot will resolve any conflicts with this PR as long as you don't
alter it yourself. You can also trigger a rebase manually by commenting
`@dependabot rebase`.
[//]: # (dependabot-automerge-start)
[//]: # (dependabot-automerge-end)
---
<details>
<summary>Dependabot commands and options</summary>
<br />
You can trigger Dependabot actions by commenting on this PR:
- `@dependabot rebase` will rebase this PR
- `@dependabot recreate` will recreate this PR, overwriting any edits
that have been made to it
- `@dependabot merge` will merge this PR after your CI passes on it
- `@dependabot squash and merge` will squash and merge this PR after
your CI passes on it
- `@dependabot cancel merge` will cancel a previously requested merge
and block automerging
- `@dependabot reopen` will reopen this PR if it is closed
- `@dependabot close` will close this PR and stop Dependabot recreating
it. You can achieve the same result by closing it manually
- `@dependabot show <dependency name> ignore conditions` will show all
of the ignore conditions of the specified dependency
- `@dependabot ignore this major version` will close this PR and stop
Dependabot creating any more for this major version (unless you reopen
the PR or upgrade to it yourself)
- `@dependabot ignore this minor version` will close this PR and stop
Dependabot creating any more for this minor version (unless you reopen
the PR or upgrade to it yourself)
- `@dependabot ignore this dependency` will close this PR and stop
Dependabot creating any more for this dependency (unless you reopen the
PR or upgrade to it yourself)
</details>
Signed-off-by: dependabot[bot] <support@github.com>
Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>
2024-12-02 10:33:27 +00:00
Sebastian Ullrich
6fcf35e930
chore: script/mathlib-bench ( #6280 )
...
A simple approach to benchmarking lean4 PRs against Mathlib
2024-12-02 10:00:57 +00:00
Marc Huisinga
b3e0c9c3fa
fix: use sensible notion of indentation in structure instance field completion ( #6279 )
...
This PR fixes a bug in structure instance field completion that caused
it to not function correctly for bracketed structure instances written
in Mathlib style.
2024-12-02 09:37:12 +00:00
Kim Morrison
3c5e612dc5
chore: begin development cycle for v4.16.0 ( #6277 )
2024-12-02 04:11:10 +00:00
Kim Morrison
29e84fa7ea
feat: omega doesn't get stuck on bare Int.negSucc ( #6276 )
...
This PR ensures `omega` doesn't get stuck on bare `Int.negSucc` terms in
goals.
This came up in https://github.com/ImperialCollegeLondon/FLT/pull/260 .
2024-12-01 23:57:15 +00:00
Mac Malone
6bf8ff32f0
feat: more UInt bitwise theorems ( #6188 )
...
This PR completes the `toNat` theorems for the bitwise operations
(`and`, `or`, `xor`, `shiftLeft`, `shiftRight`) of the UInt types and
adds `toBitVec` theorems as well. It also renames `and_toNat` to
`toNat_and` to fit with the current naming convention.
2024-12-01 22:38:49 +00:00
