Version
stringclasses 20
values | section
stringclasses 275
values | text
stringlengths 14
1.01k
| pull request
stringlengths 3
15
|
|---|---|---|---|
v4.15.0 | Server | fixes a performance issue where the Lean language server walked the full project file tree on every save, blocking all other requests and increasing latency. | 6246 |
v4.15.0 | Lake | update toolchain on `lake update` | 5684 |
v4.15.0 | Lake | adds a newline at end of each Lean file generated by `lake new` templates. | 6026 |
v4.15.0 | Lake | makes Lake no longer automatically fetch GitHub cloud releases if the package build directory is already present, preventing the cache from overwriting existing prebuilt artifacts unless manually fetched with `lake build <pkg>:release`. | 6218 |
v4.15.0 | Lake | makes `lake build` also print package materialization log lines eagerly. Previously only `lake update` did so. | 6225 |
v4.15.0 | Lake | improves errors when Lake fails to fetch from Reservoir, suggesting how to require it from GitHub if not indexed. | 6231 |
v4.16.0 | Language | makes all message constructors handle pretty printer errors. | 3696 |
v4.16.0 | Language | runs all linters for a single command (together) on a separate thread from further elaboration, making a first step towards parallelizing the elaborator. | 4460 |
v4.16.0 | Language | makes it harder to create "fake" theorems about definitions that are stubbed-out with sorry by ensuring that each sorry is not definitionally equal to any other. For example, this now fails:
lean
example : (sorry : Nat) = sorry := rfl -- fails
However, this still succeeds, since the sorry is a single indeterminate Nat:
lean
def f (n : Nat) : Nat := sorry
example : f 0 = f 1 := rfl -- succeeds
One can be more careful by putting parameters to the right of the colon:
lean
def f : (n : Nat) → Nat := sorry
example : f 0 = f 1 := rfl -- fails
Most sources of synthetic sorries (recall: a sorry that originates from the elaborator) are now unique, except for elaboration errors, since making these unique tends to cause a confusing cascade of errors. In general, however, such sorries are labeled. This enables "go to definition" on sorry in the Infoview, which brings you to its origin. The option set_option pp.sorrySource true causes the pretty printer to show source position information on sorries. | 5757 |
v4.16.0 | Language | ensures that the configuration in Simp.Config is used when reducing terms and checking definitional equality in simp. | 6123 |
v4.16.0 | Language | 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] | 6204 |
v4.16.0 | Language | fixes a bug that could cause the injectivity tactic to fail in reducible mode, which could cause unfolding lemma generation to fail (used by tactics such as unfold). In particular, Lean.Meta.isConstructorApp'? was not aware that n + 1 is equivalent to Nat.succ n. | 6270 |
v4.16.0 | Language | modifies the "foo has been deprecated: use betterFoo instead" warning so that foo and betterFoo are hoverable. | 6273 |
v4.16.0 | Language | enables simp configuration options to be passed to norm_cast. | 6278 |
v4.16.0 | Language | 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. | 6286 |
v4.16.0 | Language | uses Lean.RArray in bv_decide's reflection proofs. Giving speedups on problems with lots of variables. | 6288 |
v4.16.0 | Language | sets up simprocs for all the remaining operations defined in Init.Data.Fin.Basic | 6295 |
v4.16.0 | Language | adds the debug.proofAsSorry option. When enabled, the proofs of theorems are ignored and replaced with sorry. | 6300 |
v4.16.0 | Language | removes unnecessary parameters from the funcion induction principles. This is a breaking change; broken code can typically be adjusted simply by passing fewer parameters. | 6330 |
v4.16.0 | Language | removes unnecessary parameters from the funcion induction principles. This is a breaking change; broken code can typically be adjusted simply by passing fewer parameters. | 6330 |
v4.16.0 | Language | adds the --error=kind option (shorthand: -Ekind) to the lean CLI. When set, messages of kind (e.g., linter.unusedVariables) will be reported as errors. This setting does nothing in interactive contexts (e.g., the server). | 6362 |
v4.16.0 | Language | adds support for Float32 and fixes a bug in the runtime. | 6366 |
v4.16.0 | Language | fixes a bug in the simplifier. It was producing terms with loose bound variables when eliminating unused let_fun expressions. | 6375 |
v4.16.0 | Language | adds an explanation to the error message when cases and induction are applied to a term whose type is not an inductive type. For Prop, these tactics now suggest the by_cases tactic. Example:
tactic 'cases' failed, major premise type is not an inductive type
Prop | 6378 |
v4.16.0 | Language | fixes a bug in withTrackingZetaDelta and withTrackingZetaDeltaSet. The MetaM caches need to be reset. See new test. | 6381 |
v4.16.0 | Language | fixes a bug in simp_all? that caused some local declarations to be omitted from the Try this: suggestions. | 6385 |
v4.16.0 | Language | ensures that revertAll clears auxiliary declarations when invoked directly by users. | 6386 |
v4.16.0 | Language | fixes a type error in the proof generated by the contradiction tactic. | 6387 |
v4.16.0 | Language | ensures that simp and dsimp do not unfold definitions that are not intended to be unfolded by the user. See issue #5755 for an example affected by this issue. | 6397 |
v4.16.0 | Language | ensures Meta.check check projections. | 6398 |
v4.16.0 | Language | adds reserved names for congruence theorems used in the simplifier and grind tactics. The idea is prevent the same congruence theorems to be generated over and over again. | 6412 |
v4.16.0 | Language | introduces the following features to the WIP grind tactic:
- Expr internalization.
- Congruence theorem cache.
- Procedure for adding new facts
- New tracing options
- New preprocessing steps: fold projections and eliminate dangling Expr.mdata | 6413 |
v4.16.0 | Language | fixes a bug in Lean.Meta.Closure that would introduce under-applied delayed assignment metavariables, which would keep them from ever getting instantiated. This bug affected match elaboration when the expected type contained postponed elaboration problems, for example tactic blocks. | 6414 |
v4.16.0 | Language | fixes multiple bugs in the WIP grind tactic. It also adds support for printing the grind internal state. | 6419 |
v4.16.0 | Language | adds a new preprocessing step to the grind tactic: universe-level normalization. The goal is to avoid missing equalities in the congruence closure module. | 6428 |
v4.16.0 | Language | adds the predicate Expr.fvarsSet a b, which returns true if and only if the free variables in a are a subset of the free variables in b. | 6430 |
v4.16.0 | Language | adds a custom type and instance canonicalizer for the (WIP) grind tactic. The grind tactic uses congruence closure but disregards types, type formers, instances, and proofs. Proofs are ignored due to proof irrelevance. Types, type formers, and instances are considered supporting elements and are not factored into congruence detection. Instead, grind only checks whether elements are structurally equal, which, in the context of the grind tactic, is equivalent to pointer equality. See new tests for examples where the canonicalizer is important. | 6433 |
v4.16.0 | Language | implements the congruence table for the (WIP) grind tactic. It also fixes several bugs, and adds a new preprocessing step. | 6435 |
v4.16.0 | Language | adds support for detecting congruent terms in the (WIP) grind tactic. It also introduces the grind.debug option, which, when set to true, checks many invariants after each equivalence class is merged. This option is intended solely for debugging purposes. | 6437 |
v4.16.0 | Language | ensures norm_cast doesn't fail to act in the presence of no_index annotations | 6438 |
v4.16.0 | Language | adds basic truth value propagation rules to the (WIP) grind tactic. | 6441 |
v4.16.0 | Language | fixes the checkParents sanity check in grind. | 6442 |
v4.16.0 | Language | adds support for propagating the truth value of equalities in the (WIP) grind tactic. | 6443 |
v4.16.0 | Language | refactors grind and adds support for invoking the simplifier using the GrindM monad. | 6447 |
v4.16.0 | Language | declares the command builtin_grind_propagator for registering equation propagator for grind. It also declares the auxiliary the attribute. | 6448 |
v4.16.0 | Language | completes the implementation of the command builtin_grind_propagator. | 6449 |
v4.16.0 | Language | adds support for generating (small) proofs for any two expressions that belong to the same equivalence class in the grind tactic state. | 6452 |
v4.16.0 | Language | improves bv_decide's performance in the presence of large literals. | 6453 |
v4.16.0 | Language | fixes a bug in the equality proof generator in the (WIP) grind tactic. | 6455 |
v4.16.0 | Language | fixes another bug in the equality proof generator in the (WIP) grind tactic. | 6456 |
v4.16.0 | Language | adds support for generating congruence proofs for congruences detected by the grind tactic. | 6457 |
v4.16.0 | Language | adds support for compact congruence proofs in the (WIP) grind tactic. The mkCongrProof function now verifies whether the congruence proof can be constructed using only congr, congrFun, and congrArg, avoiding the need to generate the more complex hcongr auxiliary theorems. | 6458 |
v4.16.0 | Language | adds the (WIP) grind tactic. It currently generates a warning message to make it clear that the tactic is not ready for production. | 6459 |
v4.16.0 | Language | adds a new propagation rule for negation to the (WIP) grind tactic. | 6461 |
v4.16.0 | Language | adds support for constructors to the (WIP) grind tactic. When merging equivalence classes, grind checks for equalities between constructors. If they are distinct, it closes the goal; if they are the same, it applies injectivity. | 6463 |
v4.16.0 | Language | completes support for literal values in the (WIP) grind tactic. grind now closes the goal whenever it merges two equivalence classes with distinct literal values. | 6464 |
v4.16.0 | Language | adds support for projection functions to the (WIP) grind tactic. | 6465 |
v4.16.0 | Language | completes the implementation of addCongrTable in the (WIP) grind tactic. It also adds a new test to demonstrate why the extra check is needed. It also updates the field cgRoot (congruence root). | 6466 |
v4.16.0 | Language | fixes issue #6467 | 6468 |
v4.16.0 | Language | adds support code for implementing e-match in the (WIP) grind tactic. | 6469 |
v4.16.0 | Language | introduces a command for specifying patterns used in the heuristic instantiation of global theorems in the grind tactic. Note that this PR only adds the parser. | 6470 |
v4.16.0 | Language | implements the command grind_pattern. The new command allows users to associate patterns with theorems. These patterns are used for performing heuristic instantiation with e-matching. In the future, we will add the attributes @[grind_eq], @[grind_fwd], and @[grind_bwd] to compute the patterns automatically for theorems. | 6472 |
v4.16.0 | Language | adds a deriving handler for the ToExpr class. It can handle mutual and nested inductive types, however it falls back to creating partial instances in such cases. This is upstreamed from the Mathlib deriving handler written by @kmill, but has fixes to handle autoimplicit universe level variables. | 6473 |
v4.16.0 | Language | adds pattern validation to the grind_pattern command. The new checkCoverage function will also be used to implement the attributes @[grind_eq], @[grind_fwd], and @[grind_bwd]. | 6474 |
v4.16.0 | Language | adds support for activating relevant theorems for the (WIP) grind tactic. We say a theorem is relevant to a grind goal if the symbols occurring in its patterns also occur in the goal. | 6475 |
v4.16.0 | Language | internalize nested ground patterns when activating ematch theorems in the (WIP) grind tactic. | 6478 |
v4.16.0 | Language | implements E-matching for the (WIP) grind tactic. We still need to finalize and internalize the new instances. | 6481 |
v4.16.0 | Language | addresses a few error messages where diffs weren't being exposed. | 6484 |
v4.16.0 | Language | implements Grind.EMatch.instantiateTheorem in the (WIP) grind tactic. | 6485 |
v4.16.0 | Language | adds source position information for structure parent projections, supporting "go to definition". Closes #3063. | 6487 |
v4.16.0 | Language | fixes and refactors the E-matching module for the (WIP) grind tactic. | 6488 |
v4.16.0 | Language | adds basic configuration options for the grind tactic. | 6490 |
v4.16.0 | Language | fixes a bug in the theorem instantiation procedure in the (WIP) grind tactic. For example, it was missing the following instance in one of the tests: | 6492 |
v4.16.0 | Language | fixes another theorem instantiation bug in the grind tactic. It also moves new instances to be processed to Goal. | 6497 |
v4.16.0 | Language | adds support in the grind tactic for propagating dependent forall terms forall (h : p), q[h] where p is a proposition. | 6498 |
v4.16.0 | Language | fixes the proof canonicalizer for grind. | 6499 |
v4.16.0 | Language | fixes a bug in the markNestedProofs used in grind. See new test. | 6500 |
v4.16.0 | Language | fixes a bug in the proof assembly procedure utilized by the grind tactic. | 6502 |
v4.16.0 | Language | adds a simple strategy to the (WIP) grind tactic. It just keeps internalizing new theorem instances found by E-matching. The simple strategy can solve examples such as: | 6503 |
v4.16.0 | Language | adds the monotonicity tactic, intended to be used inside the partial_fixpoint feature. | 6506 |
v4.16.0 | Language | fixes a bug in the sanity checkers for the grind tactic. See the new test for an example of a case where it was panicking. | 6508 |
v4.16.0 | Language | fixes a bug in the congruence closure data structure used in the grind tactic. The new test includes an example that previously caused a panic. A similar panic was also occurring in the test grind_nested_proofs.lean. | 6509 |
v4.16.0 | Language | adds a custom congruence rule for equality in grind. The new rule takes into account that Eq is a symmetric relation. In the future, we will add support for arbitrary symmetric relations. The current rule is important for propagating disequalities effectively in grind. | 6510 |
v4.16.0 | Language | introduces support for user-defined fallback code in the grind tactic. The fallback code can be utilized to inspect the state of failing grind subgoals and/or invoke user-defined automation. Users can now write grind on_failure <code>, where <code> should have the type GoalM Unit. See the modified tests in this PR for examples. | 6512 |
v4.16.0 | Language | adds support for (dependent) if-then-else terms (i.e., ite and dite applications) in the grind tactic. | 6513 |
v4.16.0 | Language | enhances the assertion of new facts in grind by avoiding the creation of unnecessary metavariables. | 6514 |
v4.16.0 | Library | 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. | 6182 |
v4.16.0 | Library | 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. | 6188 |
v4.16.0 | Library | 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. | 6238 |
v4.16.0 | Library | changes the implementation of HashMap.toList, so the ordering agrees with HashMap.toArray. | 6244 |
v4.16.0 | Library | introduces the basic theory of permutations of Arrays and proves Array.swap_perm. | 6272 |
v4.16.0 | Library | moves IO.Channel and IO.Mutex from Init to Std.Sync and renames them to Std.Channel and Std.Mutex. | 6282 |
v4.16.0 | Library | upstreams List.length_flatMap, countP_flatMap and count_flatMap from Mathlib. These were not possible to state before we upstreamed List.sum. | 6294 |
v4.16.0 | Library | 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. | 6315 |
v4.16.0 | Library | adds lemmas simplifying for loops over Option into Option.pelim, giving parity with lemmas simplifying for loops of List into List.fold. | 6316 |
v4.16.0 | Library | completes the basic API for BitVec.ofBool. | 6317 |
v4.16.0 | Library | generalizes the universe level for Array.find?, by giving it a separate implementation from Array.findM?. | 6318 |
v4.16.0 | Library | adds GetElem lemmas for the basic Vector operations. | 6324 |
v4.16.0 | Library | generalizes the panic functions to a type of Sort u rather than Type u. This better supports universe polymorphic types and avoids confusing errors. | 6333 |
v4.16.0 | Library | adds Nat theorems for distributing >>> over bitwise operations, paralleling those of BitVec. | 6334 |