{"Version": "v4.15.0", "section": "Language", "text": "implements `Simp.Config.implicitDefEqsProofs`. When `true` (default: `true`), `simp` will **not** create a proof term for a rewriting rule associated with an `rfl`-theorem. Rewriting rules are provided by users by annotating theorems with the attribute `@[simp]`. If the proof of the theorem is just `rfl` (reflexivity), and `implicitDefEqProofs := true`, `simp` will **not** create a proof term which is an application of the annotated theorem.", "pull request": "4595"}
{"Version": "v4.15.0", "section": "Language", "text": "avoid negative environment lookup", "pull request": "5429"}
{"Version": "v4.15.0", "section": "Language", "text": "ensure `instantiateMVarsProfiling` adds a trace node", "pull request": "5501"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a feature to the the mutual def elaborator where the `instance` command yields theorems instead of definitions when the class is a `Prop`.", "pull request": "5856"}
{"Version": "v4.15.0", "section": "Language", "text": "unset trailing for `simpa?` \"try this\" suggestion", "pull request": "5907"}
{"Version": "v4.15.0", "section": "Language", "text": "changes the rule for which projections become instances. Before, all parents along with all indirect ancestors that were represented as subobject fields would have their projections become instances. Now only projections for direct parents become instances.", "pull request": "5920"}
{"Version": "v4.15.0", "section": "Language", "text": "make `all_goals` admit goals on failure", "pull request": "5934"}
{"Version": "v4.15.0", "section": "Language", "text": "introduce synthetic atoms in bv_decide", "pull request": "5942"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a new definition `Message.kind` which returns the top-level tag of a message. This is serialized as the new field `kind` in `SerialMessaege` so that i can be used by external consumers (e.g., Lake) to identify messages via `lean --json`.", "pull request": "5945"}
{"Version": "v4.15.0", "section": "Language", "text": "`arg` conv tactic misreported number of arguments on error", "pull request": "5968"}
{"Version": "v4.15.0", "section": "Language", "text": "BitVec.twoPow in bv_decide", "pull request": "5979"}
{"Version": "v4.15.0", "section": "Language", "text": "simplifies the implementation of `omega`.", "pull request": "5991"}
{"Version": "v4.15.0", "section": "Language", "text": "fix style in bv_decide normalizer", "pull request": "5992"}
{"Version": "v4.15.0", "section": "Language", "text": "adds configuration options for `decide`/`decide!`/`native_decide` and refactors the tactics to be frontends to the same backend. Adds a `+revert` option that cleans up the local context and reverts all local variables the goal depends on, along with indirect propositional hypotheses. Makes `native_decide` fail at elaboration time on failure without sacrificing performance (the decision procedure is still evaluated just once). Now `native_decide` supports universe polymorphism.", "pull request": "5999"}
{"Version": "v4.15.0", "section": "Language", "text": "changes `bv_decide`'s configuration from lots of `set_option` to an elaborated config like `simp` or `omega`. The notable exception is `sat.solver` which is still a `set_option` such that users can configure a custom SAT solver globally for an entire project or file. Additionally it introduces the ability to set `maxSteps` for the simp preprocessing run through the new config.", "pull request": "6010"}
{"Version": "v4.15.0", "section": "Language", "text": "improves the validation of new syntactic tokens. Previously, the validation code had inconsistencies: some atoms would be accepted only if they had a leading space as a pretty printer hint. Additionally, atoms with internal whitespace are no longer allowed.", "pull request": "6012"}
{"Version": "v4.15.0", "section": "Language", "text": "removes the `decide!` tactic in favor of `decide +kernel` (breaking change).", "pull request": "6016"}
{"Version": "v4.15.0", "section": "Language", "text": "removes @[specilize] from `MkBinding.mkBinding`, which is a function that cannot be specialized (as none of its arguments are functions). As a result, the specializable function `Nat.foldRevM.loop` doesn't get specialized, which leads to worse performing code.", "pull request": "6019"}
{"Version": "v4.15.0", "section": "Language", "text": "makes the `change` tactic and conv tactic use the same elaboration strategy. It works uniformly for both the target and local hypotheses. Now `change` can assign metavariables, for example:\n```lean\nexample (x y z : Nat) : x + y = z := by\n  change ?a = _\n  let w := ?a\n  -- now `w : Nat := x + y`\n```", "pull request": "6022"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes a bug where the monad lift coercion elaborator would partially unify expressions even if they were not monads. This could be taken advantage of to propagate information that could help elaboration make progress, for example the first `change` worked because the monad lift coercion elaborator was unifying `@Eq _ _` with `@Eq (Nat × Nat) p`. As such, this is a breaking change; you may need to adjust expressions to include additional implicit arguments.", "pull request": "6024"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a normalization rule to `bv_normalize` (which is used by `bv_decide`) that converts `x / 2^k` into `x >>> k` under suitable conditions, allowing cheaper shifting circuits instead of expensive division circuits.", "pull request": "6029"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes `simp only [· ∈ ·]` after #5020.", "pull request": "6030"}
{"Version": "v4.15.0", "section": "Language", "text": "introduces the and flattening pre processing pass from Bitwuzla to `bv_decide`. It splits hypotheses of the form `(a && b) = true` into `a = true` and `b = true` which synergizes with the existing embedded constraint substitution pass.", "pull request": "6035"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes `bv_decide`'s embedded constraint substitution to generate correct counter examples in the corner case where duplicate theorems are in the local context.", "pull request": "6037"}
{"Version": "v4.15.0", "section": "Language", "text": "add `LEAN_ALWAYS_INLINE` to some functions", "pull request": "6045"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes `simp?` suggesting output with invalid indentation", "pull request": "6048"}
{"Version": "v4.15.0", "section": "Language", "text": "mark `Meta.Context.config` as private", "pull request": "6051"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes the caching infrastructure for `whnf` and `isDefEq`, ensuring the cache accounts for all relevant configuration flags. Cleans up `WHNF.lean` and improves `whnf` configuration.", "pull request": "6053"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a simp_arith benchmark.", "pull request": "6061"}
{"Version": "v4.15.0", "section": "Language", "text": "optimize Nat.Linear.Expr.toPoly", "pull request": "6062"}
{"Version": "v4.15.0", "section": "Language", "text": "optimize Nat.Linear.Poly.norm", "pull request": "6064"}
{"Version": "v4.15.0", "section": "Language", "text": "improves the asymptotic performance of `simp_arith` when there are many variables to consider.", "pull request": "6068"}
{"Version": "v4.15.0", "section": "Language", "text": "adds options to `bv_decide`'s configuration so that all non mandatory preprocessing passes can be disabled.", "pull request": "6077"}
{"Version": "v4.15.0", "section": "Language", "text": "changes how the canonicalizer handles `forall` and `lambda`, replacing bvars with temporary fvars. Fixes a bug reported by @hrmacbeth on zulip about quantifiers in CanonM.", "pull request": "6082"}
{"Version": "v4.15.0", "section": "Language", "text": "use mkFreshUserName in ArgsPacker", "pull request": "6093"}
{"Version": "v4.15.0", "section": "Language", "text": "improves the `#print` command for structures to show all fields and which parents the fields were inherited from, hiding internal details such as which parents are represented as subobjects. The pretty printer for private constants is also improved. Private names from the current module are handled like other names; private names from other modules are hygienic.", "pull request": "6096"}
{"Version": "v4.15.0", "section": "Language", "text": "modifies the signature of `Nat.fold`, `Nat.foldRev`, `Nat.any`, `Nat.all`, so that the function is passed the upper bound, enabling compile time checks instead of runtime checks.", "pull request": "6139"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a primitive for creating temporary directories, akin to the existing functionality for creating temporary files.", "pull request": "6148"}
{"Version": "v4.15.0", "section": "Language", "text": "completes the elementwise accessors for `ofNatLt`, `allOnes`, and `not` by adding their implementations of `getMsbD`.", "pull request": "6149"}
{"Version": "v4.15.0", "section": "Language", "text": "completes the `toInt` interface for `BitVec` bitwise operations.", "pull request": "6151"}
{"Version": "v4.15.0", "section": "Language", "text": "implements `BitVec.toInt_abs`.", "pull request": "6154"}
{"Version": "v4.15.0", "section": "Language", "text": "adds `toNat` theorems for `BitVec.signExtend.`", "pull request": "6155"}
{"Version": "v4.15.0", "section": "Language", "text": "adds toInt theorems for BitVec.signExtend.", "pull request": "6157"}
{"Version": "v4.15.0", "section": "Language", "text": "adds theorem `mod_eq_sub`, makes theorem `sub_mul_eq_mod_of_lt_of_le` not private anymore and moves it within the `rotate*` section to use it in other proofs.", "pull request": "6160"}
{"Version": "v4.15.0", "section": "Language", "text": "uses `Array.findFinIdx?` in preference to `Array.findIdx?` where possible, converting runtime checks to compile time checks.", "pull request": "6184"}
{"Version": "v4.15.0", "section": "Language", "text": "completes the `toNat` theorems for bitwise operations (`and`, `or`, `xor`, `shiftLeft`, `shiftRight`) of the UInt types and adds `toBitVec` theorems as well; renames `and_toNat` to `toNat_and`.", "pull request": "6188"}
{"Version": "v4.15.0", "section": "Language", "text": "adds the builtin simproc `USize.reduceToNat` which reduces `USize.toNat` on literals less than `UInt32.size`.", "pull request": "6190"}
{"Version": "v4.15.0", "section": "Language", "text": "adds `Array.zipWithAll` and lemmas relating it to `List.zipWithAll`.", "pull request": "6191"}
{"Version": "v4.15.0", "section": "Language", "text": "adds deprecations for `Lean.HashMap` functions which did not receive deprecation attributes initially.", "pull request": "6192"}
{"Version": "v4.15.0", "section": "Language", "text": "completes the TODO in `Init.Data.Array.BinSearch`, removing `partial` and converting runtime checks to compile time checks.", "pull request": "6193"}
{"Version": "v4.15.0", "section": "Language", "text": "changes the signature of `Array.swap`, so it takes `Nat` with tactic-provided proofs of bounds. Renames `Array.swap!` to `Array.swapIfInBounds`.", "pull request": "6194"}
{"Version": "v4.15.0", "section": "Language", "text": "renames `Array.setD` to `Array.setIfInBounds`.", "pull request": "6195"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams the definition of `Vector` from Batteries, along with basic functions.", "pull request": "6197"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams `Nat.lt_pow_self` and `Nat.lt_two_pow` from Mathlib and uses them to prove the simp theorem `Nat.mod_two_pow`.", "pull request": "6200"}
{"Version": "v4.15.0", "section": "Language", "text": "makes `USize.toUInt64` a regular non-opaque definition.", "pull request": "6202"}
{"Version": "v4.15.0", "section": "Language", "text": "adds theorems `le_usize_size` and `usize_size_le`, simplifying inequalities about `USize.size`.", "pull request": "6203"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams some UInt theorems from Batteries and adds more `toNat`-related theorems. Also adds missing `UInt8` and `UInt16` to/from `USize` conversions.", "pull request": "6205"}
{"Version": "v4.15.0", "section": "Language", "text": "ensures `Fin.foldl` and `Fin.foldr` are semireducible so that certain defeqs (like `example (f : Fin 3 → ℕ) : List.ofFn f = [f 0, f 1, f 2] := rfl`) succeed.", "pull request": "6207"}
{"Version": "v4.15.0", "section": "Language", "text": "fix Vector.indexOf?", "pull request": "6208"}
{"Version": "v4.15.0", "section": "Language", "text": "adds `simp` lemmas about `List`'s `==` operation.", "pull request": "6217"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes problems in non-Ubuntu Linux distributions for `tzdata` directory by providing a fallback, and trims unnecessary characters from local time identifier.", "pull request": "6221"}
{"Version": "v4.15.0", "section": "Language", "text": "changes the definition of `HashSet.insertMany` so it is equivalent to repeated `HashSet.insert`. Also clarifies docstrings of `insert` and `insertMany`.", "pull request": "6222"}
{"Version": "v4.15.0", "section": "Language", "text": "copies some lemmas about `List.foldX` to `Array`.", "pull request": "6230"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams lemmas about `Vector` from Batteries.", "pull request": "6233"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams the definition and lemmas about `List.finRange` from Batteries.", "pull request": "6234"}
{"Version": "v4.15.0", "section": "Language", "text": "relates `Nat.fold`/`foldRev`/`any`/`all` to corresponding list operations over `List.finRange`.", "pull request": "6235"}
{"Version": "v4.15.0", "section": "Language", "text": "refactors `Array.qsort` to remove runtime array checks and avoid `partial`. Uses `Vector` API with auto_params. Benchmarks show no regression.", "pull request": "6241"}
{"Version": "v4.15.0", "section": "Language", "text": "deprecates `Fin.ofNat` in favor of `Fin.ofNat'` which takes `[NeZero]` instead of returning `Fin (n+1)`.", "pull request": "6242"}
{"Version": "v4.15.0", "section": "Language", "text": "adds `numBits_pos`, `le_numBits`, `numBits_le` to simplify inequalities about `System.Platform.numBits`.", "pull request": "6247"}
{"Version": "v4.15.0", "section": "Compiler", "text": "changes `lean_sharecommon_{eq,hash}` to only consider the salient bytes of an object, not uninitialized capacity bytes.", "pull request": "5840"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes a bug in the constant folding of `Nat.ble` and `Nat.blt` in the old code generator, preventing miscompilation.", "pull request": "6087"}
{"Version": "v4.15.0", "section": "Compiler", "text": "should make Lean better-behaved around sanitizers, addressing https://github.com/google/sanitizers/issues/1688. Taking the address of a local does not produce a monotonic measure of stack usage.", "pull request": "6143"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes an issue where edits to a command containing a nested docstring fail to reparse the entire command.", "pull request": "6236"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes `trace.profiler.pp` not using the term pretty printer.", "pull request": "6138"}
{"Version": "v4.15.0", "section": "Compiler", "text": "adds core metaprogramming functions for forking off background tasks from elaboration so that their results show up in reporting and the language server.", "pull request": "6170"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes a bug with the `structure`/`class` command where parents not represented as subobjects but used other parents as instances caused a kernel error. Closes #2611.", "pull request": "6175"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes a non-termination bug when generating match-expression equation theorems. The proof automation repeatedly applied `injection(` to the same local decl. See issue #6067.", "pull request": "6180"}
{"Version": "v4.15.0", "section": "Compiler", "text": "adds the builtin simproc `USize.reduceToNat` for `USize.toNat` on small literals. (Duplicate mention from above, but relevant to the code generator.)", "pull request": "6190"}
{"Version": "v4.15.0", "section": "Compiler", "text": "adds a primitive for accessing the current thread ID.", "pull request": "6049"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes a bug in the proof assembly procedure used by the grind tactic (placeholder text).", "pull request": "6056"}
{"Version": "v4.15.0", "section": "Compiler", "text": "adds `Lean.loadPlugin` exposing functionality similar to `--plugin` to Lean code.", "pull request": "6130"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "adds the option `pp.parens` (default: false) to eagerly insert parentheses, helpful for teaching and clarifying expression structure.", "pull request": "2934"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "prevents `Nat.succ ?_` from pretty printing as `?_.succ`, improving `apply?` usability.", "pull request": "6014"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "improves term info for coercions like `DFunLike.coe` so \"go to definition\" on the function name works. Also shows the coercee rather than the coercion expression on hover.", "pull request": "6085"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "improves the `#print` command for structures to show all fields and their inheritance, hiding subobject parent details. Private constants pretty print better, handling current-module private names normally and others hygienically.", "pull request": "6096"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "adds a new delab option `pp.coercions.types` which shows all coercions with an explicit type ascription when enabled.", "pull request": "6119"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "ensures whitespace is printed before `+opt` and `-opt` config options, improving tactics like `simp?`.", "pull request": "6161"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "fixes a bug where `#check ident` would ignore `pp.raw`. Closes #6090.", "pull request": "6181"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "exposes the difference in \"synthesized type class instance is not definitionally equal\" errors.", "pull request": "6213"}
{"Version": "v4.15.0", "section": "Documentation", "text": "fixes a typo in the docstring for prec and improves the text slightly.", "pull request": "6009"}
{"Version": "v4.15.0", "section": "Documentation", "text": "join → flatten in docstring", "pull request": "6040"}
{"Version": "v4.15.0", "section": "Documentation", "text": "does some mild refactoring of the `Lean.Elab.StructInst` module while adding documentation.", "pull request": "6110"}
{"Version": "v4.15.0", "section": "Documentation", "text": "converts 3 doc-strings to module docs, presumably their intended usage.", "pull request": "6144"}
{"Version": "v4.15.0", "section": "Documentation", "text": "refine kernel code comments", "pull request": "6150"}
{"Version": "v4.15.0", "section": "Documentation", "text": "adjust file reference in Data.Sum", "pull request": "6158"}
{"Version": "v4.15.0", "section": "Documentation", "text": "explains the order in which `Expr.abstract` introduces de Bruijn indices.", "pull request": "6239"}
{"Version": "v4.15.0", "section": "Server", "text": "adds auto-completion for fields in structure instance notation. Querying completions in whitespace now shows the full list of fields. Custom syntax can enable this by wrapping its fields parser in `structInstFields`.", "pull request": "5835"}
{"Version": "v4.15.0", "section": "Server", "text": "fixes an old auto-completion bug where `x.` gave nonsensical completions if `x.` could not be elaborated as a dot completion.", "pull request": "5837"}
{"Version": "v4.15.0", "section": "Server", "text": "avoid max heartbeat error in completion", "pull request": "5996"}
{"Version": "v4.15.0", "section": "Server", "text": "fixes a regression with go-to-definition and doc highlight misbehaving on tactic blocks.", "pull request": "6031"}
{"Version": "v4.15.0", "section": "Server", "text": "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.", "pull request": "6246"}
{"Version": "v4.15.0", "section": "Lake", "text": "update toolchain on `lake update`", "pull request": "5684"}
{"Version": "v4.15.0", "section": "Lake", "text": "adds a newline at end of each Lean file generated by `lake new` templates.", "pull request": "6026"}
{"Version": "v4.15.0", "section": "Lake", "text": "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`.", "pull request": "6218"}
{"Version": "v4.15.0", "section": "Lake", "text": "makes `lake build` also print package materialization log lines eagerly. Previously only `lake update` did so.", "pull request": "6225"}
{"Version": "v4.15.0", "section": "Lake", "text": "improves errors when Lake fails to fetch from Reservoir, suggesting how to require it from GitHub if not indexed.", "pull request": "6231"}
{"Version": "v4.16.0", "section": "Language", "text": "makes all message constructors handle pretty printer errors.", "pull request": "3696"}
{"Version": "v4.16.0", "section": "Language", "text": "runs all linters for a single command (together) on a separate thread from further elaboration, making a first step towards parallelizing the elaborator.", "pull request": "4460"}
{"Version": "v4.16.0", "section": "Language", "text": "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:\nlean\nexample : (sorry : Nat) = sorry := rfl -- fails\n\nHowever, this still succeeds, since the sorry is a single indeterminate Nat:\nlean\ndef f (n : Nat) : Nat := sorry\nexample : f 0 = f 1 := rfl -- succeeds\n\nOne can be more careful by putting parameters to the right of the colon:\nlean\ndef f : (n : Nat) → Nat := sorry\nexample : f 0 = f 1 := rfl -- fails\n\nMost 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.", "pull request": "5757"}
{"Version": "v4.16.0", "section": "Language", "text": "ensures that the configuration in Simp.Config is used when reducing terms and checking definitional equality in simp.", "pull request": "6123"}
{"Version": "v4.16.0", "section": "Language", "text": "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:\ntext\nnumeral10 : [0-9]+ (\"_\"+ [0-9]+)*\nnumeral2  : \"0\" [bB] (\"_\"* [0-1]+)+\nnumeral8  : \"0\" [oO] (\"_\"* [0-7]+)+\nnumeral16 : \"0\" [xX] (\"_\"* hex_char+)+\nfloat     : numeral10 \".\" numeral10? [eE[+-]numeral10]", "pull request": "6204"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6270"}
{"Version": "v4.16.0", "section": "Language", "text": "modifies the \"foo has been deprecated: use betterFoo instead\" warning so that foo and betterFoo are hoverable.", "pull request": "6273"}
{"Version": "v4.16.0", "section": "Language", "text": "enables simp configuration options to be passed to norm_cast.", "pull request": "6278"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6286"}
{"Version": "v4.16.0", "section": "Language", "text": "uses Lean.RArray in bv_decide's reflection proofs. Giving speedups on problems with lots of variables.", "pull request": "6288"}
{"Version": "v4.16.0", "section": "Language", "text": "sets up simprocs for all the remaining operations defined in Init.Data.Fin.Basic", "pull request": "6295"}
{"Version": "v4.16.0", "section": "Language", "text": "adds the debug.proofAsSorry option. When enabled, the proofs of theorems are ignored and replaced with sorry.", "pull request": "6300"}
{"Version": "v4.16.0", "section": "Language", "text": "removes unnecessary parameters from the funcion induction principles. This is a breaking change; broken code can typically be adjusted simply by passing fewer parameters.", "pull request": "6330"}
{"Version": "v4.16.0", "section": "Language", "text": "removes unnecessary parameters from the funcion induction principles. This is a breaking change; broken code can typically be adjusted simply by passing fewer parameters.", "pull request": "6330"}
{"Version": "v4.16.0", "section": "Language", "text": "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).", "pull request": "6362"}
{"Version": "v4.16.0", "section": "Language", "text": "adds support for Float32 and fixes a bug in the runtime.", "pull request": "6366"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes a bug in the simplifier. It was producing terms with loose bound variables when eliminating unused let_fun expressions.", "pull request": "6375"}
{"Version": "v4.16.0", "section": "Language", "text": "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:\ntactic 'cases' failed, major premise type is not an inductive type\n  Prop", "pull request": "6378"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes a bug in withTrackingZetaDelta and withTrackingZetaDeltaSet. The MetaM caches need to be reset. See new test.", "pull request": "6381"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes a bug in simp_all? that caused some local declarations to be omitted from the Try this: suggestions.", "pull request": "6385"}
{"Version": "v4.16.0", "section": "Language", "text": "ensures that revertAll clears auxiliary declarations when invoked directly by users.", "pull request": "6386"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes a type error in the proof generated by the contradiction tactic.", "pull request": "6387"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6397"}
{"Version": "v4.16.0", "section": "Language", "text": "ensures Meta.check check projections.", "pull request": "6398"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6412"}
{"Version": "v4.16.0", "section": "Language", "text": "introduces the following features to the WIP grind tactic:\n- Expr internalization.\n- Congruence theorem cache.\n- Procedure for adding new facts\n- New tracing options\n- New preprocessing steps: fold projections and eliminate dangling Expr.mdata", "pull request": "6413"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6414"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes multiple bugs in the WIP grind tactic. It also adds support for printing the grind internal state.", "pull request": "6419"}
{"Version": "v4.16.0", "section": "Language", "text": "adds a new preprocessing step to the grind tactic: universe-level normalization. The goal is to avoid missing equalities in the congruence closure module.", "pull request": "6428"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6430"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6433"}
{"Version": "v4.16.0", "section": "Language", "text": "implements the congruence table for the (WIP) grind tactic. It also fixes several bugs, and adds a new preprocessing step.", "pull request": "6435"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6437"}
{"Version": "v4.16.0", "section": "Language", "text": "ensures norm_cast doesn't fail to act in the presence of no_index annotations", "pull request": "6438"}
{"Version": "v4.16.0", "section": "Language", "text": "adds basic truth value propagation rules to the (WIP) grind tactic.", "pull request": "6441"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes the checkParents sanity check in grind.", "pull request": "6442"}
{"Version": "v4.16.0", "section": "Language", "text": "adds support for propagating the truth value of equalities in the (WIP) grind tactic.", "pull request": "6443"}
{"Version": "v4.16.0", "section": "Language", "text": "refactors grind and adds support for invoking the simplifier using the GrindM monad.", "pull request": "6447"}
{"Version": "v4.16.0", "section": "Language", "text": "declares the command builtin_grind_propagator for registering equation propagator for grind. It also declares the auxiliary the attribute.", "pull request": "6448"}
{"Version": "v4.16.0", "section": "Language", "text": "completes the implementation of the command builtin_grind_propagator.", "pull request": "6449"}
{"Version": "v4.16.0", "section": "Language", "text": "adds support for generating (small) proofs for any two expressions that belong to the same equivalence class in the grind tactic state.", "pull request": "6452"}
{"Version": "v4.16.0", "section": "Language", "text": "improves bv_decide's performance in the presence of large literals.", "pull request": "6453"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes a bug in the equality proof generator in the (WIP) grind tactic.", "pull request": "6455"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes another bug in the equality proof generator in the (WIP) grind tactic.", "pull request": "6456"}
{"Version": "v4.16.0", "section": "Language", "text": "adds support for generating congruence proofs for congruences detected by the grind tactic.", "pull request": "6457"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6458"}
{"Version": "v4.16.0", "section": "Language", "text": "adds the (WIP) grind tactic. It currently generates a warning message to make it clear that the tactic is not ready for production.", "pull request": "6459"}
{"Version": "v4.16.0", "section": "Language", "text": "adds a new propagation rule for negation to the (WIP) grind tactic.", "pull request": "6461"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6463"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6464"}
{"Version": "v4.16.0", "section": "Language", "text": "adds support for projection functions to the (WIP) grind tactic.", "pull request": "6465"}
{"Version": "v4.16.0", "section": "Language", "text": "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).", "pull request": "6466"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes issue #6467", "pull request": "6468"}
{"Version": "v4.16.0", "section": "Language", "text": "adds support code for implementing e-match in the (WIP) grind tactic.", "pull request": "6469"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6470"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6472"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6473"}
{"Version": "v4.16.0", "section": "Language", "text": "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].", "pull request": "6474"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6475"}
{"Version": "v4.16.0", "section": "Language", "text": "internalize nested ground patterns when activating ematch theorems in the (WIP) grind tactic.", "pull request": "6478"}
{"Version": "v4.16.0", "section": "Language", "text": "implements E-matching for the (WIP) grind tactic. We still need to finalize and internalize the new instances.", "pull request": "6481"}
{"Version": "v4.16.0", "section": "Language", "text": "addresses a few error messages where diffs weren't being exposed.", "pull request": "6484"}
{"Version": "v4.16.0", "section": "Language", "text": "implements Grind.EMatch.instantiateTheorem in the (WIP) grind tactic.", "pull request": "6485"}
{"Version": "v4.16.0", "section": "Language", "text": "adds source position information for structure parent projections, supporting \"go to definition\". Closes #3063.", "pull request": "6487"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes and refactors the E-matching module for the (WIP) grind tactic.", "pull request": "6488"}
{"Version": "v4.16.0", "section": "Language", "text": "adds basic configuration options for the grind tactic.", "pull request": "6490"}
{"Version": "v4.16.0", "section": "Language", "text": "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:", "pull request": "6492"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes another theorem instantiation bug in the grind tactic. It also moves new instances to be processed to Goal.", "pull request": "6497"}
{"Version": "v4.16.0", "section": "Language", "text": "adds support in the grind tactic for propagating dependent forall terms forall (h : p), q[h] where p is a proposition.", "pull request": "6498"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes the proof canonicalizer for grind.", "pull request": "6499"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes a bug in the markNestedProofs used in grind. See new test.", "pull request": "6500"}
{"Version": "v4.16.0", "section": "Language", "text": "fixes a bug in the proof assembly procedure utilized by the grind tactic.", "pull request": "6502"}
{"Version": "v4.16.0", "section": "Language", "text": "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:", "pull request": "6503"}
{"Version": "v4.16.0", "section": "Language", "text": "adds the monotonicity tactic, intended to be used inside the partial_fixpoint feature.", "pull request": "6506"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6508"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6509"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6510"}
{"Version": "v4.16.0", "section": "Language", "text": "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.", "pull request": "6512"}
{"Version": "v4.16.0", "section": "Language", "text": "adds support for (dependent) if-then-else terms (i.e., ite and dite applications) in the grind tactic.", "pull request": "6513"}
{"Version": "v4.16.0", "section": "Language", "text": "enhances the assertion of new facts in grind by avoiding the creation of unnecessary metavariables.", "pull request": "6514"}
{"Version": "v4.16.0", "section": "Library", "text": "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.", "pull request": "6182"}
{"Version": "v4.16.0", "section": "Library", "text": "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.", "pull request": "6188"}
{"Version": "v4.16.0", "section": "Library", "text": "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.", "pull request": "6238"}
{"Version": "v4.16.0", "section": "Library", "text": "changes the implementation of HashMap.toList, so the ordering agrees with HashMap.toArray.", "pull request": "6244"}
{"Version": "v4.16.0", "section": "Library", "text": "introduces the basic theory of permutations of Arrays and proves Array.swap_perm.", "pull request": "6272"}
{"Version": "v4.16.0", "section": "Library", "text": "moves IO.Channel and IO.Mutex from Init to Std.Sync and renames them to Std.Channel and Std.Mutex.", "pull request": "6282"}
{"Version": "v4.16.0", "section": "Library", "text": "upstreams List.length_flatMap, countP_flatMap and count_flatMap from Mathlib. These were not possible to state before we upstreamed List.sum.", "pull request": "6294"}
{"Version": "v4.16.0", "section": "Library", "text": "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.", "pull request": "6315"}
{"Version": "v4.16.0", "section": "Library", "text": "adds lemmas simplifying for loops over Option into Option.pelim, giving parity with lemmas simplifying for loops of List into List.fold.", "pull request": "6316"}
{"Version": "v4.16.0", "section": "Library", "text": "completes the basic API for BitVec.ofBool.", "pull request": "6317"}
{"Version": "v4.16.0", "section": "Library", "text": "generalizes the universe level for Array.find?, by giving it a separate implementation from Array.findM?.", "pull request": "6318"}
{"Version": "v4.16.0", "section": "Library", "text": "adds GetElem lemmas for the basic Vector operations.", "pull request": "6324"}
{"Version": "v4.16.0", "section": "Library", "text": "generalizes the panic functions to a type of Sort u rather than Type u. This better supports universe polymorphic types and avoids confusing errors.", "pull request": "6333"}
{"Version": "v4.16.0", "section": "Library", "text": "adds Nat theorems for distributing >>> over bitwise operations, paralleling those of BitVec.", "pull request": "6334"}
{"Version": "v4.16.0", "section": "Library", "text": "adds BitVec.[toFin|getMsbD]_setWidth and [getMsb|msb]_signExtend as well as ofInt_toInt.", "pull request": "6338"}
{"Version": "v4.16.0", "section": "Library", "text": "generalizes DecidableRel to allow a heterogeneous relation.", "pull request": "6341"}
{"Version": "v4.16.0", "section": "Library", "text": "reproduces the API around List.any/all for Array.any/all.", "pull request": "6353"}
{"Version": "v4.16.0", "section": "Library", "text": "makes fixes suggested by the Batteries environment linters, particularly simpNF, and unusedHavesSuffices.", "pull request": "6364"}
{"Version": "v4.16.0", "section": "Library", "text": "expands the Array.set and Array.setIfInBounds lemmas to match existing lemmas for List.set.", "pull request": "6365"}
{"Version": "v4.16.0", "section": "Library", "text": "brings Vector lemmas about membership and indexing to parity with List and Array.", "pull request": "6367"}
{"Version": "v4.16.0", "section": "Library", "text": "adds lemmas about Vector.set, anyM, any, allM, and all.", "pull request": "6369"}
{"Version": "v4.16.0", "section": "Library", "text": "adds theorems about == on Vector, reproducing those already on List and Array.", "pull request": "6376"}
{"Version": "v4.16.0", "section": "Library", "text": "replaces the inductive predicate List.lt with an upstreamed version of List.Lex from Mathlib. (Previously Lex.lt was defined in terms of <; now it is generalized to take an arbitrary relation.) This subtly changes the notion of ordering on List α.\n\n  List.lt was a weaker relation: in particular if l₁ < l₂, then a :: l₁ < b :: l₂ may hold according to List.lt even if a and b are merely incomparable (either neither a < b nor b < a), whereas according to List.Lex this would require a = b.\n\n  When < is total, in the sense that ¬ · < · is antisymmetric, then the two relations coincide.\n\n  Mathlib was already overriding the order instances for List α, so this change should not be noticed by anyone already using Mathlib.\n\n  We simultaneously add the boolean valued List.lex function, parameterised by a BEq typeclass and an arbitrary lt function. This will support the flexibility previously provided for List.lt, via a == function which is weaker than strict equality.", "pull request": "6379"}
{"Version": "v4.16.0", "section": "Library", "text": "redefines Range.forIn' and Range.forM, in preparation for writing lemmas about them.", "pull request": "6390"}
{"Version": "v4.16.0", "section": "Library", "text": "requires that the step size in Std.Range is positive, to avoid ill-specified behaviour.", "pull request": "6391"}
{"Version": "v4.16.0", "section": "Library", "text": "adds lemmas reducing for loops over Std.Range to for loops over List.range'.", "pull request": "6396"}
{"Version": "v4.16.0", "section": "Library", "text": "adds basic lemmas about lexicographic order on Array and Vector, achieving parity with List.", "pull request": "6399"}
{"Version": "v4.16.0", "section": "Library", "text": "adds missing lemmas about lexicographic order on List/Array/Vector.", "pull request": "6423"}
{"Version": "v4.16.0", "section": "Library", "text": "adds the necessary domain theory that backs the partial_fixpoint feature.", "pull request": "6477"}
{"Version": "v4.16.0", "section": "Compiler", "text": "adds support for HEq to the new code generator.", "pull request": "6311"}
{"Version": "v4.16.0", "section": "Compiler", "text": "adds support for Float32 to the Lean runtime.", "pull request": "6348"}
{"Version": "v4.16.0", "section": "Compiler", "text": "adds missing features and fixes bugs in the Float32 support", "pull request": "6350"}
{"Version": "v4.16.0", "section": "Compiler", "text": "ensures the new code generator produces code for opaque definitions that are not tagged as @[extern].\nRemark: This is the behavior of the old code generator.", "pull request": "6383"}
{"Version": "v4.16.0", "section": "Compiler", "text": "adds support for erasure of Decidable.decide to the new code generator. It also adds a new Probe.runOnDeclsNamed function, which is helpful for writing targeted single-file tests of compiler internals.", "pull request": "6405"}
{"Version": "v4.16.0", "section": "Compiler", "text": "fixes a bug in the sharecommon module, which was returning incorrect results for objects that had already been processed by sharecommon. See the new test for an example that triggered the bug.", "pull request": "6415"}
{"Version": "v4.16.0", "section": "Compiler", "text": "adds support for extern LCNF decls, which is required for parity with the existing code generator.", "pull request": "6429"}
{"Version": "v4.16.0", "section": "Pretty Printing", "text": "adjusts the way the pretty printer unresolves names. It used to make use of all exports when pretty printing, but now it only uses exports that put names into parent namespaces (heuristic: these are \"API exports\" that are intended by the library author), rather than \"horizontal exports\" that put the names into an unrelated namespace, which the dot notation feature in #6189 now incentivizes.", "pull request": "5689"}
{"Version": "v4.16.0", "section": "Pretty Printing", "text": "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:\nlean\nexample : (sorry : Nat) = sorry := rfl -- fails\n\nHowever, this still succeeds, since the sorry is a single indeterminate Nat:\nlean\ndef f (n : Nat) : Nat := sorry\nexample : f 0 = f 1 := rfl -- succeeds\n\nOne can be more careful by putting parameters to the right of the colon:\nlean\ndef f : (n : Nat) → Nat := sorry\nexample : f 0 = f 1 := rfl -- fails\n\nMost 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.", "pull request": "5757"}
{"Version": "v4.16.0", "section": "Documentation", "text": "adds a docstring to the @[app_delab] attribute.", "pull request": "6450"}
{"Version": "v4.16.0", "section": "Server", "text": "fixes a bug in structure instance field completion that caused it to not function correctly for bracketed structure instances written in Mathlib style.", "pull request": "6279"}
{"Version": "v4.16.0", "section": "Server", "text": "fixes a regression where goals that don't exist were being displayed. The regression was triggered by #5835 and originally caused by #4926.", "pull request": "6408"}
{"Version": "v4.16.0", "section": "Lake", "text": "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.", "pull request": "6176"}
{"Version": "v4.16.0", "section": "Lake", "text": "adapts Lake modules to use prelude and includes them in the check-prelude CI.", "pull request": "6289"}
{"Version": "v4.16.0", "section": "Lake", "text": "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.", "pull request": "6291"}
{"Version": "v4.16.0", "section": "Lake", "text": "merges BuildJob and Job, deprecating the former. Job now contains a trace as part of its state which can be interacted with monadically. also simplifies the implementation of OpaqueJob.", "pull request": "6388"}
{"Version": "v4.16.0", "section": "Lake", "text": "adds the ability to override package entries in a Lake manifest via a separate JSON file. This file can be specified on the command line with --packages or applied persistently by placing it at .lake/package-overrides.json.", "pull request": "6411"}
{"Version": "v4.16.0", "section": "Lake", "text": "fixes a bug in #6388 where the Package.afterBuildCahe* functions would produce different traces depending on whether the cache was fetched.", "pull request": "6422"}
{"Version": "v4.16.0", "section": "Other", "text": "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.", "pull request": "6285"}
{"Version": "v4.16.0", "section": "Other", "text": "fixes errors at load time in the comparison mode of the Firefox profiler.", "pull request": "6363"}
{"Version": "v4.15.0", "section": "Language", "text": "implements `Simp.Config.implicitDefEqsProofs`. When `true` (default: `true`), `simp` will **not** create a proof term for a rewriting rule associated with an `rfl`-theorem. Rewriting rules are provided by users by annotating theorems with the attribute `@[simp]`. If the proof of the theorem is just `rfl` (reflexivity), and `implicitDefEqProofs := true`, `simp` will **not** create a proof term which is an application of the annotated theorem.", "pull request": "4595"}
{"Version": "v4.15.0", "section": "Language", "text": "avoid negative environment lookup", "pull request": "5429"}
{"Version": "v4.15.0", "section": "Language", "text": "ensure `instantiateMVarsProfiling` adds a trace node", "pull request": "5501"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a feature to the the mutual def elaborator where the `instance` command yields theorems instead of definitions when the class is a `Prop`.", "pull request": "5856"}
{"Version": "v4.15.0", "section": "Language", "text": "unset trailing for `simpa?` \"try this\" suggestion", "pull request": "5907"}
{"Version": "v4.15.0", "section": "Language", "text": "changes the rule for which projections become instances. Before, all parents along with all indirect ancestors that were represented as subobject fields would have their projections become instances. Now only projections for direct parents become instances.", "pull request": "5920"}
{"Version": "v4.15.0", "section": "Language", "text": "make `all_goals` admit goals on failure", "pull request": "5934"}
{"Version": "v4.15.0", "section": "Language", "text": "introduce synthetic atoms in bv_decide", "pull request": "5942"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a new definition `Message.kind` which returns the top-level tag of a message. This is serialized as the new field `kind` in `SerialMessaege` so that i can be used by external consumers (e.g., Lake) to identify messages via `lean --json`.", "pull request": "5945"}
{"Version": "v4.15.0", "section": "Language", "text": "`arg` conv tactic misreported number of arguments on error", "pull request": "5968"}
{"Version": "v4.15.0", "section": "Language", "text": "BitVec.twoPow in bv_decide", "pull request": "5979"}
{"Version": "v4.15.0", "section": "Language", "text": "simplifies the implementation of `omega`.", "pull request": "5991"}
{"Version": "v4.15.0", "section": "Language", "text": "fix style in bv_decide normalizer", "pull request": "5992"}
{"Version": "v4.15.0", "section": "Language", "text": "adds configuration options for `decide`/`decide!`/`native_decide` and refactors the tactics to be frontends to the same backend. Adds a `+revert` option that cleans up the local context and reverts all local variables the goal depends on, along with indirect propositional hypotheses. Makes `native_decide` fail at elaboration time on failure without sacrificing performance (the decision procedure is still evaluated just once). Now `native_decide` supports universe polymorphism.", "pull request": "5999"}
{"Version": "v4.15.0", "section": "Language", "text": "changes `bv_decide`'s configuration from lots of `set_option` to an elaborated config like `simp` or `omega`. The notable exception is `sat.solver` which is still a `set_option` such that users can configure a custom SAT solver globally for an entire project or file. Additionally it introduces the ability to set `maxSteps` for the simp preprocessing run through the new config.", "pull request": "6010"}
{"Version": "v4.15.0", "section": "Language", "text": "improves the validation of new syntactic tokens. Previously, the validation code had inconsistencies: some atoms would be accepted only if they had a leading space as a pretty printer hint. Additionally, atoms with internal whitespace are no longer allowed.", "pull request": "6012"}
{"Version": "v4.15.0", "section": "Language", "text": "removes the `decide!` tactic in favor of `decide +kernel` (breaking change).", "pull request": "6016"}
{"Version": "v4.15.0", "section": "Language", "text": "removes @[specilize] from `MkBinding.mkBinding`, which is a function that cannot be specialized (as none of its arguments are functions). As a result, the specializable function `Nat.foldRevM.loop` doesn't get specialized, which leads to worse performing code.", "pull request": "6019"}
{"Version": "v4.15.0", "section": "Language", "text": "makes the `change` tactic and conv tactic use the same elaboration strategy. It works uniformly for both the target and local hypotheses. Now `change` can assign metavariables, for example:\n```lean\nexample (x y z : Nat) : x + y = z := by\n  change ?a = _\n  let w := ?a\n  -- now `w : Nat := x + y`\n```", "pull request": "6022"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes a bug where the monad lift coercion elaborator would partially unify expressions even if they were not monads. This could be taken advantage of to propagate information that could help elaboration make progress, for example the first `change` worked because the monad lift coercion elaborator was unifying `@Eq _ _` with `@Eq (Nat × Nat) p`:\n```lean\nexample (p : Nat × Nat) : p = p := by\n  change _ = ⟨_, _⟩ -- used to work (yielding `p = (p.fst, p.snd)`), now it doesn't\n  change ⟨_, _⟩ = _ -- never worked\n```\nAs such, this is a breaking change; you may need to adjust expressions to include additional implicit arguments.", "pull request": "6024"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a normalization rule to `bv_normalize` (which is used by `bv_decide`) that converts `x / 2^k` into `x >>> k` under suitable conditions. This allows us to simplify the expensive division circuits that are used for bitblasting into much cheaper shifting circuits. Concretely, it allows for the following canonicalization:", "pull request": "6029"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes `simp only [· ∈ ·]` after #5020.", "pull request": "6030"}
{"Version": "v4.15.0", "section": "Language", "text": "introduces the and flattening pre processing pass from Bitwuzla to `bv_decide`. It splits hypotheses of the form `(a && b) = true` into `a = true` and `b = true` which has synergy potential with the already existing embedded constraint substitution pass.", "pull request": "6035"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes `bv_decide`'s embedded constraint substitution to generate correct counter examples in the corner case where duplicate theorems are in the local context.", "pull request": "6037"}
{"Version": "v4.15.0", "section": "Language", "text": "add `LEAN_ALWAYS_INLINE` to some functions", "pull request": "6045"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes `simp?` suggesting output with invalid indentation", "pull request": "6048"}
{"Version": "v4.15.0", "section": "Language", "text": "mark `Meta.Context.config` as private", "pull request": "6051"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes the caching infrastructure for `whnf` and `isDefEq`, ensuring the cache accounts for all relevant configuration flags. It also cleans up the `WHNF.lean` module and improves the configuration of `whnf`.", "pull request": "6053"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a simp_arith benchmark.", "pull request": "6061"}
{"Version": "v4.15.0", "section": "Language", "text": "optimize Nat.Linear.Expr.toPoly", "pull request": "6062"}
{"Version": "v4.15.0", "section": "Language", "text": "optimize Nat.Linear.Poly.norm", "pull request": "6064"}
{"Version": "v4.15.0", "section": "Language", "text": "improves the asymptotic performance of `simp_arith` when there are many variables to consider.", "pull request": "6068"}
{"Version": "v4.15.0", "section": "Language", "text": "adds options to `bv_decide`'s configuration structure such that all non mandatory preprocessing passes can be disabled.", "pull request": "6077"}
{"Version": "v4.15.0", "section": "Language", "text": "changes how the canonicalizer handles `forall` and `lambda`, replacing bvars with temporary fvars. Fixes a bug reported by @hrmacbeth on [zulip](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/Quantifiers.20in.20CanonM/near/482483448).", "pull request": "6082"}
{"Version": "v4.15.0", "section": "Language", "text": "use mkFreshUserName in ArgsPacker", "pull request": "6093"}
{"Version": "v4.15.0", "section": "Language", "text": "improves the `#print` command for structures to show all fields and which parents the fields were inherited from, hiding internal details such as which parents are represented as subobjects. This information is still present in the constructor if needed. The pretty printer for private constants is also improved, and it now handles private names from the current module like any other name; private names from other modules are made hygienic.", "pull request": "6096"}
{"Version": "v4.15.0", "section": "Language", "text": "modifies the signature of `Nat.fold`, `Nat.foldRev`, `Nat.any`, `Nat.all`, so that the function is passed the upper bound. This allows us to change runtime array bounds checks to compile time checks in many places.", "pull request": "6139"}
{"Version": "v4.15.0", "section": "Language", "text": "adds a primitive for creating temporary directories, akin to the existing functionality for creating temporary files.", "pull request": "6148"}
{"Version": "v4.15.0", "section": "Language", "text": "completes the elementwise accessors for `ofNatLt`, `allOnes`, and `not` by adding their implementations of `getMsbD`.", "pull request": "6149"}
{"Version": "v4.15.0", "section": "Language", "text": "completes the `toInt` interface for `BitVec` bitwise operations.", "pull request": "6151"}
{"Version": "v4.15.0", "section": "Language", "text": "implements `BitVec.toInt_abs`.", "pull request": "6154"}
{"Version": "v4.15.0", "section": "Language", "text": "adds `toNat` theorems for `BitVec.signExtend.`", "pull request": "6155"}
{"Version": "v4.15.0", "section": "Language", "text": "adds toInt theorems for BitVec.signExtend.", "pull request": "6157"}
{"Version": "v4.15.0", "section": "Language", "text": "adds theorem `mod_eq_sub`, makes theorem `sub_mul_eq_mod_of_lt_of_le` not private anymore and moves its location within the `rotate*` section to use it in other proofs.", "pull request": "6160"}
{"Version": "v4.15.0", "section": "Language", "text": "uses `Array.findFinIdx?` in preference to `Array.findIdx?` where it allows converting a runtime bounds check to a compile time bounds check.", "pull request": "6184"}
{"Version": "v4.15.0", "section": "Language", "text": "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.", "pull request": "6188"}
{"Version": "v4.15.0", "section": "Language", "text": "adds the builtin simproc `USize.reduceToNat` which reduces the `USize.toNat` operation on literals less than `UInt32.size` (i.e., `4294967296`).", "pull request": "6190"}
{"Version": "v4.15.0", "section": "Language", "text": "adds `Array.zipWithAll`, and the basic lemmas relating it to `List.zipWithAll`.", "pull request": "6191"}
{"Version": "v4.15.0", "section": "Language", "text": "adds deprecations for `Lean.HashMap` functions which did not receive deprecation attributes initially.", "pull request": "6192"}
{"Version": "v4.15.0", "section": "Language", "text": "completes the TODO in `Init.Data.Array.BinSearch`, removing the `partial` keyword and converting runtime array bounds checks to compile time bounds checks.", "pull request": "6193"}
{"Version": "v4.15.0", "section": "Language", "text": "changes the signature of `Array.swap`, so it takes `Nat` arguments with tactic provided bounds checking. It also renames `Array.swap!` to `Array.swapIfInBounds`.", "pull request": "6194"}
{"Version": "v4.15.0", "section": "Language", "text": "renames `Array.setD` to `Array.setIfInBounds`.", "pull request": "6195"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams the definition of `Vector` from Batteries, along with the basic functions.", "pull request": "6197"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams `Nat.lt_pow_self` and `Nat.lt_two_pow` from Mathlib and uses them to prove the simp theorem `Nat.mod_two_pow`.", "pull request": "6200"}
{"Version": "v4.15.0", "section": "Language", "text": "makes `USize.toUInt64` a regular non-opaque definition.", "pull request": "6202"}
{"Version": "v4.15.0", "section": "Language", "text": "adds theorems `le_usize_size`, `usize_size_le`, which make proving inequalities about `USize.size` easier.", "pull request": "6203"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams some UInt theorems from Batteries and adds more `toNat`-related theorems. It also adds the missing `UInt8` and `UInt16` to/from `USize` conversions so that the interface is uniform across the UInt types.", "pull request": "6205"}
{"Version": "v4.15.0", "section": "Language", "text": "ensures the `Fin.foldl` and `Fin.foldr` are semireducible. Without this the defeq `example (f : Fin 3 → ℕ) : List.ofFn f = [f 0, f 1, f 2] := rfl` was failing.", "pull request": "6207"}
{"Version": "v4.15.0", "section": "Language", "text": "fix Vector.indexOf?", "pull request": "6208"}
{"Version": "v4.15.0", "section": "Language", "text": "adds `simp` lemmas about `List`'s `==` operation.", "pull request": "6217"}
{"Version": "v4.15.0", "section": "Language", "text": "fixes:\n- Problems in other linux distributions that the default `tzdata` directory is not the same as previously defined by ensuring it with a fallback behavior when directory is missing.\n- Trim unnecessary characters from local time identifier.", "pull request": "6221"}
{"Version": "v4.15.0", "section": "Language", "text": "changes the definition of `HashSet.insertMany` and `HashSet.Raw.insertMany` so that it is equivalent to repeatedly calling `HashSet.insert`/`HashSet.Raw.insert`. It also clarifies the docstrings of all the `insert` and `insertMany` functions.", "pull request": "6222"}
{"Version": "v4.15.0", "section": "Language", "text": "copies some lemmas about `List.foldX` to `Array`.", "pull request": "6230"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams lemmas about `Vector` from Batteries.", "pull request": "6233"}
{"Version": "v4.15.0", "section": "Language", "text": "upstreams the definition and basic lemmas about `List.finRange` from Batteries.", "pull request": "6234"}
{"Version": "v4.15.0", "section": "Language", "text": "relates that operations `Nat.fold`/`foldRev`/`any`/`all` to the corresponding List operations over `List.finRange`.", "pull request": "6235"}
{"Version": "v4.15.0", "section": "Language", "text": "refactors `Array.qsort` to remove runtime array bounds checks, and avoids the use of `partial`. We use the `Vector` API, along with auto_params, to avoid having to write any proofs. The new code benchmarks indistinguishably from the old.", "pull request": "6241"}
{"Version": "v4.15.0", "section": "Language", "text": "deprecates `Fin.ofNat` in favour of `Fin.ofNat'` (which takes an `[NeZero]` instance, rather than returning an element of `Fin (n+1)`).", "pull request": "6242"}
{"Version": "v4.15.0", "section": "Language", "text": "adds the theorems `numBits_pos`, `le_numBits`, `numBits_le`, which make proving inequalities about `System.Platform.numBits` easier.", "pull request": "6247"}
{"Version": "v4.15.0", "section": "Compiler", "text": "changes `lean_sharecommon_{eq,hash}` to only consider the salient bytes of an object, and not any bytes of any unspecified/uninitialized unused capacity.", "pull request": "5840"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes a bug in the constant folding for the `Nat.ble` and `Nat.blt` function in the old code generator, leading to a miscompilation.", "pull request": "6087"}
{"Version": "v4.15.0", "section": "Compiler", "text": "should make lean better-behaved around sanitizers, per https://github.com/google/sanitizers/issues/1688. As far as I can tell, https://github.com/google/sanitizers/wiki/AddressSanitizerUseAfterReturn#algorithm replaces local variables with heap allocations, and so taking the address of a local is not effective at producing a monotonic measure of stack usage.", "pull request": "6143"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes a bug in the constant folding for the `Nat.ble` and `Nat.blt` function in the old code generator, leading to a miscompilation.", "pull request": "6087"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes an issue where edits to a command containing a nested docstring fail to reparse the entire command.", "pull request": "6236"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes `trace.profiler.pp` not using the term pretty printer.", "pull request": "6138"}
{"Version": "v4.15.0", "section": "Compiler", "text": "adds core metaprogramming functions for forking off background tasks from elaboration such that their results are visible to reporting and the language server.", "pull request": "6170"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes a bug with the `structure`/`class` command where if there are parents that are not represented as subobjects but which used other parents as instances, then there would be a kernel error. Closes #2611.", "pull request": "6175"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes a non-termination bug that occurred when generating the match-expression equation theorems. The bug was triggered when the proof automation for the equation theorem repeatedly applied `injection(` to the same local declaration, as it could not be removed due to forward dependencies. See issue #6067 for an example that reproduces this issue.", "pull request": "6180"}
{"Version": "v4.15.0", "section": "Compiler", "text": "adds the builtin simproc `USize.reduceToNat` which reduces the `USize.toNat` operation on literals less than `UInt32.size` (i.e., `4294967296`).", "pull request": "6190"}
{"Version": "v4.15.0", "section": "Compiler", "text": "adds a primitive for accessing the current thread ID.", "pull request": "6049"}
{"Version": "v4.15.0", "section": "Compiler", "text": "fixes a bug in the proof assembly procedure utilized by the grind tactic.", "pull request": "6056"}
{"Version": "v4.15.0", "section": "Compiler", "text": "adds `Lean.loadPlugin` which exposes functionality similar to the `lean` executable's `--plugin` option to Lean code.", "pull request": "6130"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "adds the option `pp.parens` (default: false) that causes the pretty printer to eagerly insert parentheses, which can be useful for teaching and for understanding the structure of expressions. For example, it causes `p → q → r` to pretty print as `p → (q → r)`.", "pull request": "2934"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "prevents `Nat.succ ?_` from pretty printing as `?_.succ`, which should make `apply?` be more usable.", "pull request": "6014"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "improves the term info for coercions marked with `CoeFnType.coeFun` (such as `DFunLike.coe` in Mathlib), making \"go to definition\" on the function name work. Hovering over such a coerced function will show the coercee rather than the coercion expression. The coercion expression can still be seen by hovering over the whitespace in the function application.", "pull request": "6085"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "improves the `#print` command for structures to show all fields and which parents the fields were inherited from, hiding internal details such as which parents are represented as subobjects. This information is still present in the constructor if needed. The pretty printer for private constants is also improved, and it now handles private names from the current module like any other name; private names from other modules are made hygienic.", "pull request": "6096"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "adds a new delab option `pp.coercions.types` which, when enabled, will display all coercions with an explicit type ascription.", "pull request": "6119"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "ensures whitespace is printed before `+opt` and `-opt` configuration options when pretty printing, improving the experience of tactics such as `simp?`.", "pull request": "6161"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "fixes a bug where the signature pretty printer would ignore the current setting of `pp.raw`. This fixes an issue where `#check ident` would not heed `pp.raw`. Closes #6090.", "pull request": "6181"}
{"Version": "v4.15.0", "section": "Pretty Printing", "text": "exposes the difference in \"synthesized type class instance is not definitionally equal\" errors.", "pull request": "6213"}
{"Version": "v4.15.0", "section": "Documentation", "text": "fixes a typo in the docstring for prec and makes the text slightly more precise.", "pull request": "6009"}
{"Version": "v4.15.0", "section": "Documentation", "text": "join → flatten in docstring", "pull request": "6040"}
{"Version": "v4.15.0", "section": "Documentation", "text": "does some mild refactoring of the `Lean.Elab.StructInst` module while adding documentation.", "pull request": "6110"}
{"Version": "v4.15.0", "section": "Documentation", "text": "converts 3 doc-string to module docs since it seems that this is what they were intended to be!", "pull request": "6144"}
{"Version": "v4.15.0", "section": "Documentation", "text": "refine kernel code comments", "pull request": "6150"}
{"Version": "v4.15.0", "section": "Documentation", "text": "adjust file reference in Data.Sum", "pull request": "6158"}
{"Version": "v4.15.0", "section": "Documentation", "text": "explains the order in which `Expr.abstract` introduces de Bruijn indices.", "pull request": "6239"}
{"Version": "v4.15.0", "section": "Server", "text": "adds auto-completion for the fields of structure instance notation. Specifically, querying the completions via `Ctrl+Space` in the whitespace of a structure instance notation will now bring up the full list of fields. Whitespace structure completion can be enabled for custom syntax by wrapping the parser for the list of fields in a `structInstFields` parser.", "pull request": "5835"}
{"Version": "v4.15.0", "section": "Server", "text": "fixes an old auto-completion bug where `x.` would issue nonsensical completions when `x.` could not be elaborated as a dot completion.", "pull request": "5837"}
{"Version": "v4.15.0", "section": "Server", "text": "avoid max heartbeat error in completion", "pull request": "5996"}
{"Version": "v4.15.0", "section": "Server", "text": "fixes a regression with go-to-definition and document highlight misbehaving on tactic blocks.", "pull request": "6031"}
{"Version": "v4.15.0", "section": "Server", "text": "fixes a performance issue where the Lean language server would walk the full project file tree every time a file was saved, blocking the processing of all other requests and notifications and significantly increasing overall language server latency after saving.", "pull request": "6246"}
{"Version": "v4.15.0", "section": "Lake", "text": "update toolchain on `lake update`", "pull request": "5684"}
{"Version": "v4.15.0", "section": "Lake", "text": "adds a newline at end of each Lean file generated by `lake new` templates.", "pull request": "6026"}
{"Version": "v4.15.0", "section": "Lake", "text": "makes Lake no longer automatically fetch GitHub cloud releases if the package build directory is already present (mirroring the behavior of the Reservoir cache). This prevents the cache from clobbering existing prebuilt artifacts. Users can still manually fetch the cache and clobber the build directory by running `lake build <pkg>:release`.", "pull request": "6218"}
{"Version": "v4.15.0", "section": "Lake", "text": "makes `lake build` also eagerly print package materialization log lines. Previously, only a `lake update` performed eager logging.", "pull request": "6225"}
{"Version": "v4.15.0", "section": "Lake", "text": "improves the errors Lake produces when it fails to fetch a dependency from Reservoir. If the package is not indexed, it will produce a suggestion about how to require it from GitHub.", "pull request": "6231"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improves universe level inference for the resulting type of an `inductive` or `structure.` Recall that a `Prop`-valued inductive type is a syntactic subsingleton if it has at most one constructor and all the arguments to the constructor are in `Prop`. Such types have large elimination, so they could be defined in `Type` or `Prop` without any trouble. The way inference has changed is that if a type is a syntactic subsingleton with exactly one constructor, and the constructor has at least one parameter/field, then the command will prefer creating a `Prop` instead of a `Type`. The upshot is that the `: Prop` in `structure S : Prop` is often no longer needed. (With @arthur-adjedj).", "pull request": "5517"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "the command can now define recursive inductive types:\n```lean\nstructure Tree where\n  n : Nat\n  children : Fin n → Tree\n\ndef Tree.size : Tree → Nat\n  | {n, children} => Id.run do\n    let mut s := 0\n    for h : i in [0 : n] do\n      s := s + (children ⟨i, h.2⟩).size\n    pure s\n```", "pull request": "5842"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug where Mathlib's `Type*` elaborator could lead to incorrect universe parameters with the command.", "pull request": "5814"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fix bugs in default value processing for structure instance notation (with @arthur-adjedj).", "pull request": "3152"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fix bugs in default value processing for structure instance notation (with @arthur-adjedj).", "pull request": "5844"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "promotes instance synthesis order calculation failure from a soft error to a hard error.", "pull request": "5399"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "deprecates `:=` variants of `inductive` and `structure` (see breaking changes).", "pull request": "5542"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "makes `@[elab_as_elim]` require at least one discriminant, since otherwise there is no advantage to this alternative elaborator.", "pull request": "5671"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "enables field notation in explicit mode. The syntax `@x.f` elaborates as `@S.f` with `x` supplied to the appropriate parameter.", "pull request": "5528"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "modifies the dot notation resolution algorithm so that it can apply `CoeFun` instances. For example, Mathlib has `Multiset.card : Multiset α →+ Nat`, and now with `m : Multiset α`, the notation `m.card` resolves to `⇑Multiset.card m`.", "pull request": "5692"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug where 'don't know how to synthesize implicit argument' errors might have the incorrect local context when the eta arguments feature is activated.", "pull request": "5658"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug where `..` ellipses in patterns made use of optparams and autoparams.", "pull request": "5933"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "makes dot notation for structures resolve using all ancestors. Adds a resolution order for generalized field notation. By default a relaxed version of the algorithm tolerates inconsistencies, but `set_option structure.strictResolutionOrder true` makes inconsistent parent orderings into warnings.", "pull request": "5770"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes functional induction principle generation to avoid over-eta-expanding in the preprocessing step.", "pull request": "5619"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes structural nested recursion so that it is not confused when a nested type appears first.", "pull request": "5766"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug in functional induction principle generation when there are `let` bindings.", "pull request": "5803"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improves functional induction principle generation to unfold aux definitions more carefully.", "pull request": "5904"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "refactors code for `Predefinition.Structural`.", "pull request": "5850"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug in \"type mismatch\" errors that would structurally assign metavariables during the algorithm to expose differences.", "pull request": "5276"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "makes \"type mismatch\" errors add type ascriptions to expose differences for numeric literals.", "pull request": "5919"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "makes \"type mismatch\" errors expose differences in the bodies of functions and pi types.", "pull request": "5922"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improves the error message for invalid induction alternative names in `match` expressions (@josojo).", "pull request": "5888"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improves `calc` error messages.", "pull request": "5719"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improve the `#eval` command and introduce new features such as hoverable output when a `ToExpr` instance exists, auto-derivation of `Repr` instances, a new option `eval.type`, more precise error messages about missing `ToExpr`/`Repr`/`ToString`, collecting log messages in `MetaM`/`CoreM`, and a fix for `let rec` usage.", "pull request": "5627"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improve the `#eval` command and introduce new features such as hoverable output when a `ToExpr` instance exists, auto-derivation of `Repr` instances, a new option `eval.type`, more precise error messages about missing `ToExpr`/`Repr`/`ToString`, collecting log messages in `MetaM`/`CoreM`, and a fix for `let rec` usage.", "pull request": "5663"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improves the error message when `partial` fails to prove a type is inhabited. Add delta deriving.", "pull request": "5780"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "gives `partial` inhabitation the ability to create local `Inhabited` instances from parameters.", "pull request": "5821"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "new tactic configuration syntax. For example `simp +contextual (maxSteps := 22)` instead of `simp (config := { contextual := true, maxSteps := 22})`. This affects core tactics and how authors can define tactic configuration syntaxes. (See breaking changes.)", "pull request": "5883"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "new tactic configuration syntax. For example `simp +contextual (maxSteps := 22)` instead of `simp (config := { contextual := true, maxSteps := 22})`. This affects core tactics and how authors can define tactic configuration syntaxes. (See breaking changes.)", "pull request": "5898"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "new tactic configuration syntax. For example `simp +contextual (maxSteps := 22)` instead of `simp (config := { contextual := true, maxSteps := 22})`. This affects core tactics and how authors can define tactic configuration syntaxes. (See breaking changes.)", "pull request": "5928"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "new tactic configuration syntax. For example `simp +contextual (maxSteps := 22)` instead of `simp (config := { contextual := true, maxSteps := 22})`. This affects core tactics and how authors can define tactic configuration syntaxes. (See breaking changes.)", "pull request": "5932"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes the simpproc for `Fin` literals to reduce more consistently.", "pull request": "5632"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug in `simpa ... using t` where metavariables in `t` were not properly accounted for, and improves the type mismatch error.", "pull request": "5648"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes the docstring of `simp!` to actually talk about `simp!`.", "pull request": "5838"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds support for `attribute [simp ←]` which adds the reverse of a theorem as a global simp theorem.", "pull request": "5870"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds `decide!` tactic for using kernel reduction. (Renamed to `decide +kernel` in a future release.)", "pull request": "5665"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds inequality regression tests to `bv_decide` (@alexkeizer).", "pull request": "5714"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds `bv_toNat` tag for `toNat_ofInt` (@bollu).", "pull request": "5608"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds support for `at` in `ac_nf` and uses it in `bv_normalize` (@tobiasgrosser).", "pull request": "5618"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds udiv support to `bv_decide`.", "pull request": "5628"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds auxiliary bitblasters for negation and subtraction.", "pull request": "5635"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds more `getLsbD` bitblaster theory.", "pull request": "5637"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds umod support to `bv_decide`.", "pull request": "5652"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds performance benchmark for modulo in `bv_decide`.", "pull request": "5653"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "reduces error on `bv_check` to warning.", "pull request": "5655"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds `~~~(-x)` support in `bv_decide`.", "pull request": "5670"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "disables `ac_nf` by default in `bv_decide`.", "pull request": "5673"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes context tracking in `bv_decide` counter example generation.", "pull request": "5675"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds an error when the LRAT proof is invalid in `bv_decide`.", "pull request": "5676"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "introduces uninterpreted symbols everywhere in `bv_decide`.", "pull request": "5781"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds `BitVec.sdiv` support to `bv_decide`.", "pull request": "5823"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds `BitVec.ofBool` support to `bv_decide`.", "pull request": "5852"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds `if` support to `bv_decide`.", "pull request": "5855"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds support for all the SMTLIB BitVec divison/remainder operations to `bv_decide`.", "pull request": "5869"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds embedded constraint substitution to `bv_decide`.", "pull request": "5886"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes loose mvars bug in `bv_normalize`.", "pull request": "5918"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improves the `congr` conv tactic to handle over-applied functions.", "pull request": "5861"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improves the `arg` conv tactic so it can access more arguments, handle over-applied functions, generate specialized congruence lemmas for the specific argument, apply to pi types, and adds negative indexing. Also shows intermediate states with `enter [...]`.", "pull request": "5894"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug where `generalize ... at *` would apply to implementation details. (@ymherklotz)", "pull request": "4846"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "upstreams the `classical` tactic combinator.", "pull request": "5730"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improves the error message when trying to unfold a local hypothesis that is not a local definition.", "pull request": "5815"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "changes how `apply` and `simp` elaborate, making them not disable error recovery. Improves hovers and completions with elaboration errors.", "pull request": "5862"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "changes how `apply` and `simp` elaborate, making them not disable error recovery. Improves hovers and completions with elaboration errors.", "pull request": "5863"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds declaration ranges for delta-derived instances in deriving clauses.", "pull request": "5899"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "removes unused syntax in `deriving` clauses for providing arguments to deriving handlers (see breaking changes).", "pull request": "5265"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "upstreams and updates `#where`, a command that reports the current scope information.", "pull request": "5065"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "makes the unused variables linter ignore variables defined in tactics by default, avoiding performance bottlenecks.", "pull request": "5338"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "ensures that linters do not run on `#guard_msgs` itself.", "pull request": "5644"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds `pushGoal`/`pushGoals` and `popGoal` for manipulating the goal state. Modifies `closeMainGoalUsing` to run callbacks in a context with the main goal removed, etc. Also modifies `withCollectingNewGoalsFrom` to take the `parentTag` explicitly. Modifies `elabTermWithHoles` to optionally take `parentTag?`.", "pull request": "5720"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes `getFunInfo` and `inferType` to use `withAtLeastTransparency` instead of `withTransparency`.", "pull request": "5563"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes `RecursorVal.getInduct` to return the name of major argument’s type, enabling structure eta for nested inductives.", "pull request": "5679"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "removes unused `mkRecursorInfoForKernelRec`.", "pull request": "5681"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "makes discrimination trees index the domains of foralls, improving performance of `simplify` and type class search.", "pull request": "5686"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds `Lean.Expr.name?` recognizer for `Name` expressions.", "pull request": "5760"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "modifies `liftCommandElabM` to preserve more state, fixing an issue where using it would drop messages.", "pull request": "5800"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "makes it possible to use dot notation in `m!` strings, for example `m!\"{.ofConstName n}\"`.", "pull request": "5857"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "records the complete list of `structure` parents in the `StructureInfo` environment extension.", "pull request": "5841"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "records the complete list of `structure` parents in the `StructureInfo` environment extension.", "pull request": "5853"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug introduced earlier where heartbeat exceptions were no longer handled properly. Now such exceptions are tagged with `runtime.maxHeartbeats` (@eric-wieser).", "pull request": "5566"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "modifies proof objects produced by `ac_nf0` and `simp_arith` so the kernel is less prone to reducing expensive atoms.", "pull request": "5708"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "adds a `#version` command that prints Lean's version information.", "pull request": "5768"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "fixes elaborator algorithms to match kernel algorithms for primitive projections (`Expr.proj`).", "pull request": "5822"}
{"Version": "v4.14.0", "section": "Language features, tactics, and metaprograms", "text": "improves the docstring for the `rwa` tactic.", "pull request": "5811"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "fixes `WorkspaceClientCapabilities` to make `applyEdit` optional, matching the LSP specification (@pzread).", "pull request": "5224"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "fixes a server deadlock when shutting down the language server and a desync between client and language server after a file worker crash.", "pull request": "5340"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "makes `initialize` and `builtin_initialize` participate in call hierarchy and other requests.", "pull request": "5560"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "makes references in attributes participate in call hierarchy and other requests.", "pull request": "5650"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "add auto-completion in tactic blocks without needing to type the first character of the tactic, and add tactic completion docs to tactic auto-completion items.", "pull request": "5666"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "fixes several cases where goal states were not displayed in certain text cursor positions.", "pull request": "5677"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "indicates deprecations in auto-completion items.", "pull request": "5707"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "fix various performance issues in the language server.", "pull request": "5736"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "fix various performance issues in the language server.", "pull request": "5752"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "fix various performance issues in the language server.", "pull request": "5763"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "fix various performance issues in the language server.", "pull request": "5802"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "fix various performance issues in the language server.", "pull request": "5805"}
{"Version": "v4.14.0", "section": "Language server, widgets, and IDE extensions", "text": "distinguishes theorem auto-completions from non-theorem auto-completions.", "pull request": "5801"}
{"Version": "v4.14.0", "section": "Pretty printing", "text": "fixes a bug where goal states in messages might print newlines as spaces.", "pull request": "5640"}
{"Version": "v4.14.0", "section": "Pretty printing", "text": "adds option `pp.mvars.delayed` (default false) which when false causes delayed assignment metavariables to pretty print with what they are assigned to, rather than something like `?m.7 x`.", "pull request": "5643"}
{"Version": "v4.14.0", "section": "Pretty printing", "text": "adds options `pp.mvars.anonymous` and `pp.mvars.levels` which when false cause expression or level metavariables to print as `?_`.", "pull request": "5711"}
{"Version": "v4.14.0", "section": "Pretty printing", "text": "adjusts the `⋯` elaboration warning to mention `pp.maxSteps`.", "pull request": "5710"}
{"Version": "v4.14.0", "section": "Pretty printing", "text": "fixes the app unexpander for `sorryAx`.", "pull request": "5759"}
{"Version": "v4.14.0", "section": "Pretty printing", "text": "improves accuracy of binder names in the signature printer (e.g. for `#check`). Also fixes issues with consecutive hygienic names printing without a space, now `(x✝ y✝ : Nat)` instead of `(x✝y✝ : Nat)`.", "pull request": "5827"}
{"Version": "v4.14.0", "section": "Pretty printing", "text": "makes sure core delaborators respect `pp.explicit` when appropriate.", "pull request": "5830"}
{"Version": "v4.14.0", "section": "Pretty printing", "text": "makes sure name literals use escaping when pretty printing.", "pull request": "5639"}
{"Version": "v4.14.0", "section": "Pretty printing", "text": "adds delaborators for `<|>`, `<*>`, `>>`, `<*`, and `*>`.", "pull request": "5854"}
{"Version": "v4.14.0", "section": "Library", "text": "deprecates `Array.data`.", "pull request": "5687"}
{"Version": "v4.14.0", "section": "Library", "text": "uses a better default value for `Array.swapAt!`.", "pull request": "5705"}
{"Version": "v4.14.0", "section": "Library", "text": "moves `Array.mapIdx` lemmas to a new file.", "pull request": "5748"}
{"Version": "v4.14.0", "section": "Library", "text": "simplifies signature of `Array.mapIdx`.", "pull request": "5749"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams `Array.reduceOption`.", "pull request": "5758"}
{"Version": "v4.14.0", "section": "Library", "text": "adds simp lemmas for `Array.isEqv` and `BEq`.", "pull request": "5786"}
{"Version": "v4.14.0", "section": "Library", "text": "renames `Array.shrink` to `Array.take`, and relates it to `List.take`.", "pull request": "5796"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams `List.modify`, adds lemmas, and relates to `Array.modify`.", "pull request": "5798"}
{"Version": "v4.14.0", "section": "Library", "text": "relates `Array.forIn` and `List.forIn`.", "pull request": "5799"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `Array.forIn'`, relating it to `List`.", "pull request": "5833"}
{"Version": "v4.14.0", "section": "Library", "text": "fixes deprecations in `Init.Data.Array.Basic` to not recommend a deprecated constant.", "pull request": "5848"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `LawfulBEq (Array α) ↔ LawfulBEq α`.", "pull request": "5895"}
{"Version": "v4.14.0", "section": "Library", "text": "moves `@[simp]` from `back_eq_back?` to `back_push`.", "pull request": "5896"}
{"Version": "v4.14.0", "section": "Library", "text": "renames `Array.back` to `back!`.", "pull request": "5897"}
{"Version": "v4.14.0", "section": "Library", "text": "removes `List.redLength`.", "pull request": "5605"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams `List.mapIdx` and adds lemmas.", "pull request": "5696"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams `List.foldxM_map`.", "pull request": "5697"}
{"Version": "v4.14.0", "section": "Library", "text": "renames `List.join` to `List.flatten`.", "pull request": "5701"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams `List.sum`.", "pull request": "5703"}
{"Version": "v4.14.0", "section": "Library", "text": "marks `prefix_append_right_inj` as a simp lemma.", "pull request": "5706"}
{"Version": "v4.14.0", "section": "Library", "text": "fixes `List.drop_drop` addition order.", "pull request": "5716"}
{"Version": "v4.14.0", "section": "Library", "text": "renames `List.bind` and `Array.concatMap` to `flatMap`.", "pull request": "5731"}
{"Version": "v4.14.0", "section": "Library", "text": "renames `List.pure` to `List.singleton`.", "pull request": "5732"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams `ne_of_mem_of_not_mem`.", "pull request": "5742"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams `ne_of_apply_ne`.", "pull request": "5743"}
{"Version": "v4.14.0", "section": "Library", "text": "adds more `List.modify` lemmas.", "pull request": "5816"}
{"Version": "v4.14.0", "section": "Library", "text": "renames `List.groupBy` to `splitBy`.", "pull request": "5879"}
{"Version": "v4.14.0", "section": "Library", "text": "relates `for` loops over `List` with `foldlM`.", "pull request": "5913"}
{"Version": "v4.14.0", "section": "Library", "text": "removes `instBEqNat` which was not defeq to `instBEqOfDecidableEq`.", "pull request": "5694"}
{"Version": "v4.14.0", "section": "Library", "text": "deprecates `Nat.sum`.", "pull request": "5746"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `Nat.forall_lt_succ` and variants.", "pull request": "5785"}
{"Version": "v4.14.0", "section": "Library", "text": "redefines unsigned fixed width integers in terms of `BitVec`.", "pull request": "5323"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `UIntX.[val_ofNat, toBitVec_ofNat]`.", "pull request": "5735"}
{"Version": "v4.14.0", "section": "Library", "text": "defines `Int8`.", "pull request": "5790"}
{"Version": "v4.14.0", "section": "Library", "text": "removes native code for `UInt8.modn`.", "pull request": "5901"}
{"Version": "v4.14.0", "section": "Library", "text": "completes `BitVec.[getMsbD|getLsbD|msb]` for shifts.", "pull request": "5604"}
{"Version": "v4.14.0", "section": "Library", "text": "adds lemmas for division when denominator is zero.", "pull request": "5609"}
{"Version": "v4.14.0", "section": "Library", "text": "documents Bitblasting.", "pull request": "5620"}
{"Version": "v4.14.0", "section": "Library", "text": "moves `BitVec.udiv/umod/sdiv/smod` after `add/sub/mul/lt`.", "pull request": "5623"}
{"Version": "v4.14.0", "section": "Library", "text": "defines `udiv` normal form to be `/`, resp. `umod` and `%`.", "pull request": "5645"}
{"Version": "v4.14.0", "section": "Library", "text": "adds lemmas about arithmetic inequalities.", "pull request": "5646"}
{"Version": "v4.14.0", "section": "Library", "text": "expands relationship with `toFin`.", "pull request": "5680"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `(getMSbD, msb)_(add, sub)` and `getLsbD_sub`.", "pull request": "5691"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `udiv|umod_[zero|one|self]`.", "pull request": "5712"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `sdiv_[zero|one|self]`.", "pull request": "5718"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `(msb, getMsbD, getLsbD)_(neg, abs)`.", "pull request": "5721"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `BitVec.toInt_sub`, simplifies `BitVec.toInt_neg`.", "pull request": "5772"}
{"Version": "v4.14.0", "section": "Library", "text": "proves that `intMin` is the smallest signed bitvector.", "pull request": "5778"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `(msb, getMsbD)_twoPow`.", "pull request": "5851"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `BitVec.[zero_ushiftRight|zero_sshiftRight|zero_mul]` and cleans up BVDecide.", "pull request": "5858"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `(msb, getMsbD)_concat`.", "pull request": "5865"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `Hashable (BitVec n)`.", "pull request": "5881"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams `String.dropPrefix?`.", "pull request": "5728"}
{"Version": "v4.14.0", "section": "Library", "text": "changes `String.dropPrefix?` signature.", "pull request": "5745"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `Hashable Char` instance.", "pull request": "5747"}
{"Version": "v4.14.0", "section": "Library", "text": "adds interim implementation of `HashMap.modify`/`alter`.", "pull request": "5880"}
{"Version": "v4.14.0", "section": "Library", "text": "removes `@[simp]` from `Option.isSome_eq_isSome`.", "pull request": "5704"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams material on `Prod`.", "pull request": "5739"}
{"Version": "v4.14.0", "section": "Library", "text": "moves `Antisymm` to `Std.Antisymm`.", "pull request": "5740"}
{"Version": "v4.14.0", "section": "Library", "text": "upstreams basic material on `Sum`.", "pull request": "5741"}
{"Version": "v4.14.0", "section": "Library", "text": "adds `Nat.log2_two_pow` (@spinylobster).", "pull request": "5756"}
{"Version": "v4.14.0", "section": "Library", "text": "removes duplicated `ForIn` instances.", "pull request": "5892"}
{"Version": "v4.14.0", "section": "Library", "text": "removes `@[simp]` from `Sum.forall` and `Sum.exists`.", "pull request": "5900"}
{"Version": "v4.14.0", "section": "Library", "text": "removes redundant `Decidable` assumptions.", "pull request": "5812"}
{"Version": "v4.14.0", "section": "Compiler, runtime, and FFI", "text": "fixes help message flags, removes the `-f` flag and adds the `-g` flag.", "pull request": "5685"}
{"Version": "v4.14.0", "section": "Compiler, runtime, and FFI", "text": "adds `--short-version` (`-V`) option to display short version.", "pull request": "5930"}
{"Version": "v4.14.0", "section": "Compiler, runtime, and FFI", "text": "switches all 64-bit platforms over to consistently using GMP for bignum arithmetic.", "pull request": "5144"}
{"Version": "v4.14.0", "section": "Compiler, runtime, and FFI", "text": "raises the minimum supported Windows version to Windows 10 1903 (released May 2019).", "pull request": "5753"}
{"Version": "v4.14.0", "section": "Lake", "text": "changes `lake new math` to use `autoImplicit false`.", "pull request": "5715"}
{"Version": "v4.14.0", "section": "Lake", "text": "makes `Lake` not create core aliases in the `Lake` namespace.", "pull request": "5688"}
{"Version": "v4.14.0", "section": "Lake", "text": "adds a `text` option for `buildFile*` utilities.", "pull request": "5924"}
{"Version": "v4.14.0", "section": "Lake", "text": "makes `lake init` not `git init` when inside a git work tree.", "pull request": "5789"}
{"Version": "v4.14.0", "section": "Lake", "text": "has Lake update a package's `lean-toolchain` file on `lake update` if it finds the package's direct dependencies use a newer compatible toolchain, unless `--keep-toolchain` is used. (See breaking changes.)", "pull request": "5684"}
{"Version": "v4.14.0", "section": "Lake", "text": "makes Lake no longer automatically fetch GitHub cloud releases if the package build directory is already present. This prevents overwriting existing prebuilt artifacts unless the user manually fetches them with `lake build <pkg>:release`.", "pull request": "6218"}
{"Version": "v4.14.0", "section": "Lake", "text": "improves the errors Lake produces when it fails to fetch a dependency from Reservoir, providing suggestions about how to require it from GitHub if not indexed.", "pull request": "6231"}
{"Version": "v4.14.0", "section": "Documentation", "text": "fixes MSYS2 build instructions.", "pull request": "5617"}
{"Version": "v4.14.0", "section": "Documentation", "text": "points out that `OfScientific` is called with raw literals.", "pull request": "5725"}
{"Version": "v4.14.0", "section": "Documentation", "text": "adds a stub for application ellipsis notation.", "pull request": "5794"}
{"Version": "v4.14.0", "section": "Breaking changes", "text": "the syntax for providing arguments to deriving handlers has been removed. The minimum supported Windows version is now Windows 10 1903. The `--lean` CLI option for `lake` was removed. The old `inductive/structure/class ... :=` syntax is deprecated. Tactic configuration elaborators now land in TacticM. See details above.", "pull request": "5265"}
{"Version": "v4.14.0", "section": "Breaking changes", "text": "the syntax for providing arguments to deriving handlers has been removed. The minimum supported Windows version is now Windows 10 1903. The `--lean` CLI option for `lake` was removed. The old `inductive/structure/class ... :=` syntax is deprecated. Tactic configuration elaborators now land in TacticM. See details above.", "pull request": "5753"}
{"Version": "v4.14.0", "section": "Breaking changes", "text": "the syntax for providing arguments to deriving handlers has been removed. The minimum supported Windows version is now Windows 10 1903. The `--lean` CLI option for `lake` was removed. The old `inductive/structure/class ... :=` syntax is deprecated. Tactic configuration elaborators now land in TacticM. See details above.", "pull request": "5684"}
{"Version": "v4.14.0", "section": "Breaking changes", "text": "the syntax for providing arguments to deriving handlers has been removed. The minimum supported Windows version is now Windows 10 1903. The `--lean` CLI option for `lake` was removed. The old `inductive/structure/class ... :=` syntax is deprecated. Tactic configuration elaborators now land in TacticM. See details above.", "pull request": "5542"}
{"Version": "v4.14.0", "section": "Breaking changes", "text": "the syntax for providing arguments to deriving handlers has been removed. The minimum supported Windows version is now Windows 10 1903. The `--lean` CLI option for `lake` was removed. The old `inductive/structure/class ... :=` syntax is deprecated. Tactic configuration elaborators now land in TacticM. See details above.", "pull request": "5883"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "allows structure parents to be type synonyms.", "pull request": "5511"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "allows default values for structure fields to be noncomputable.", "pull request": "5531"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "improve the `rfl` tactic and give better error messages.", "pull request": "3714"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "improve the `rfl` tactic and give better error messages.", "pull request": "3718"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "makes `rfl` no longer use kernel defeq for ground terms.", "pull request": "3772"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "tags `Iff.refl` with `@[refl]` (@Parcly-Taxel).", "pull request": "5329"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "ensures that the `rfl` tactic tries `Iff.rfl` (@Parcly-Taxel).", "pull request": "5359"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "lets `unfold` do zeta-delta reduction of local definitions (like the Mathlib `unfold_let`).", "pull request": "4834"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "fixes spurious error in #5315 for `omega`.", "pull request": "5382"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "supports `Int.toNat` in `omega`.", "pull request": "5523"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "lets `simp` apply rules with higher-order patterns.", "pull request": "5479"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "fixes `induction`'s \"pre-tactic\" block indentation to avoid unintended usage.", "pull request": "5494"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "adds `ac_nf` tactic for normalizing expressions w.r.t. associativity and commutativity, tested on `BitVec` expressions.", "pull request": "5524"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "makes `extractLsb'` the primitive recognized by `bv_decide` instead of `extractLsb` (@alexkeizer).", "pull request": "5211"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "adds `bv_decide` diagnoses.", "pull request": "5365"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "adds normalization rules for `ofBool (a.getLsbD i)` and `ofBool a[i]` to `bv_decide` (@alexkeizer).", "pull request": "5375"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "enhances rewriting rules of `bv_decide`.", "pull request": "5423"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "presents the `bv_decide` counterexample at the API.", "pull request": "5433"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "handles `BitVec.ofNat` with `Nat` fvars in `bv_decide`.", "pull request": "5484"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "adds `bv_normalize` rules.", "pull request": "5506"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "adds `bv_normalize` rules.", "pull request": "5507"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "generalizes the `bv_normalize` pipeline to support more preprocessing passes.", "pull request": "5568"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "updates `bv_normalize` to current `BitVec` rewrites.", "pull request": "5573"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "bv_decide cleanups.", "pull request": "5408"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "bv_decide cleanups.", "pull request": "5493"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "bv_decide cleanups.", "pull request": "5578"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "preserve order of overapplied arguments in `elab_as_elim` procedure.", "pull request": "5266"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "generalizes `elab_as_elim` to allow arbitrary motive applications.", "pull request": "5510"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "refine how named arguments suppress explicit arguments. Breaking change: some omitted explicit args may need `_` now.", "pull request": "5283"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "refine how named arguments suppress explicit arguments. Breaking change: some omitted explicit args may need `_` now.", "pull request": "5512"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "modifies projection instance binder info so parameters that are instance-implicit in the type remain implicit.", "pull request": "5376"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "localizes universe metavariable errors to `let`-bindings and `fun` binders if possible, and prioritizes unsolved metavars over unsolved universes.", "pull request": "5402"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "must not reduce `ite` in the discriminant of a `match` when reducibility is `.reducible`.", "pull request": "5419"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "have autoparams report parameter/field on failure.", "pull request": "5474"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "makes automatic instance names about hygienic type names also be hygienic.", "pull request": "5530"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "makes `Repr` deriving instance handle explicit type parameters.", "pull request": "5432"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "functional induction: adds more equalities in context, more careful cleanup.", "pull request": "5364"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "fixes the unused variables linter complaining about match/tactic combos.", "pull request": "5335"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "fixes the unused variables linter complaining about wildcard patterns.", "pull request": "5337"}
{"Version": "v4.13.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a parse error when `..` is followed by a `.` on the next line.", "pull request": "4768"}
{"Version": "v4.13.0", "section": "Metaprogramming", "text": "handles level parameters in `Meta.evalExpr` (@eric-wieser).", "pull request": "3090"}
{"Version": "v4.13.0", "section": "Metaprogramming", "text": "instance for `Inhabited (TacticM α)` (@alexkeizer).", "pull request": "5401"}
{"Version": "v4.13.0", "section": "Metaprogramming", "text": "expose `Kernel.check` for debugging purposes.", "pull request": "5412"}
{"Version": "v4.13.0", "section": "Metaprogramming", "text": "improves the \"invalid projection\" type inference error in `inferType`.", "pull request": "5556"}
{"Version": "v4.13.0", "section": "Metaprogramming", "text": "allows `MVarId.assertHypotheses` to set `BinderInfo` and `LocalDeclKind`.", "pull request": "5587"}
{"Version": "v4.13.0", "section": "Metaprogramming", "text": "adds `MVarId.tryClearMany'`, a variant of `tryClearMany`.", "pull request": "5588"}
{"Version": "v4.13.0", "section": "Language server, widgets, and IDE extensions", "text": "decreases latency of auto-completion in tactic blocks.", "pull request": "5205"}
{"Version": "v4.13.0", "section": "Language server, widgets, and IDE extensions", "text": "fixes symbol occurrence highlighting in VS Code when moving cursor in from the right.", "pull request": "5237"}
{"Version": "v4.13.0", "section": "Language server, widgets, and IDE extensions", "text": "fixes several incorrect auto-completions being reported.", "pull request": "5257"}
{"Version": "v4.13.0", "section": "Language server, widgets, and IDE extensions", "text": "allows fallback to global auto-completions when context-specific completions fail.", "pull request": "5299"}
{"Version": "v4.13.0", "section": "Language server, widgets, and IDE extensions", "text": "fixes server break when changing whitespace after module header.", "pull request": "5312"}
{"Version": "v4.13.0", "section": "Language server, widgets, and IDE extensions", "text": "fixes auto-completion reporting non-existent namespaces.", "pull request": "5322"}
{"Version": "v4.13.0", "section": "Language server, widgets, and IDE extensions", "text": "always report some recent file range as progress while waiting for elaboration.", "pull request": "5428"}
{"Version": "v4.13.0", "section": "Pretty printing", "text": "make pretty printer escape identifiers that are tokens.", "pull request": "4979"}
{"Version": "v4.13.0", "section": "Pretty printing", "text": "makes formatter use the current token table.", "pull request": "5389"}
{"Version": "v4.13.0", "section": "Pretty printing", "text": "use breakable instead of unbreakable whitespace in token formatting.", "pull request": "5513"}
{"Version": "v4.13.0", "section": "Library", "text": "reduces allocations in `Json.compress`.", "pull request": "5222"}
{"Version": "v4.13.0", "section": "Library", "text": "upstreams `Zero` and `NeZero`.", "pull request": "5231"}
{"Version": "v4.13.0", "section": "Library", "text": "refactors `Lean.Elab.Deriving.FromToJson` (@arthur-adjedj).", "pull request": "5292"}
{"Version": "v4.13.0", "section": "Library", "text": "implements `Repr Empty` (@TomasPuverle).", "pull request": "5415"}
{"Version": "v4.13.0", "section": "Library", "text": "implements `To/FromJSON Empty` (@TomasPuverle).", "pull request": "5421"}
{"Version": "v4.13.0", "section": "Library", "text": "allows simplifying `dite_not`/`decide_not` with only `Decidable (¬p)`.", "pull request": "5263"}
{"Version": "v4.13.0", "section": "Library", "text": "fixes binders on `ite_eq_left_iff`.", "pull request": "5268"}
{"Version": "v4.13.0", "section": "Library", "text": "turns off `Inhabited (Sum α β)` instances.", "pull request": "5284"}
{"Version": "v4.13.0", "section": "Library", "text": "adds simp lemmas for `LawfulBEq`.", "pull request": "5355"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `Nonempty` instances for products, letting more `partial` functions elaborate.", "pull request": "5374"}
{"Version": "v4.13.0", "section": "Library", "text": "updates Pi instance names.", "pull request": "5447"}
{"Version": "v4.13.0", "section": "Library", "text": "makes some instance arguments implicit.", "pull request": "5454"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `heq_comm`.", "pull request": "5456"}
{"Version": "v4.13.0", "section": "Library", "text": "moves `@[simp]` from `exists_prop'` to `exists_prop`.", "pull request": "5529"}
{"Version": "v4.13.0", "section": "Library", "text": "fills gaps in `Bool` lemmas.", "pull request": "5228"}
{"Version": "v4.13.0", "section": "Library", "text": "adds notation `^^` for `Bool.xor`.", "pull request": "5332"}
{"Version": "v4.13.0", "section": "Library", "text": "removes `_root_.and` etc. and consistently uses `Bool.and`/`Bool.or`/`Bool.not`/`Bool.xor`.", "pull request": "5351"}
{"Version": "v4.13.0", "section": "Library", "text": "removes BitVec simps with complicated RHS.", "pull request": "5240"}
{"Version": "v4.13.0", "section": "Library", "text": "`BitVec.getElem_zeroExtend`.", "pull request": "5247"}
{"Version": "v4.13.0", "section": "Library", "text": "adds more simp lemmas for BitVec, improving confluence.", "pull request": "5248"}
{"Version": "v4.13.0", "section": "Library", "text": "removes `@[simp]` from some BitVec lemmas.", "pull request": "5249"}
{"Version": "v4.13.0", "section": "Library", "text": "changes `BitVec.intMin/Max` from abbrev to def.", "pull request": "5252"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `BitVec.getElem_truncate` (@tobiasgrosser).", "pull request": "5278"}
{"Version": "v4.13.0", "section": "Library", "text": "adds udiv/umod bitblasting for `bv_decide` (@bollu).", "pull request": "5281"}
{"Version": "v4.13.0", "section": "Library", "text": "`BitVec` unsigned order theoretic results.", "pull request": "5297"}
{"Version": "v4.13.0", "section": "Library", "text": "adds more BitVec ordering theory for `UInt`.", "pull request": "5313"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `toNat_sub_of_le` for BitVec (@bollu).", "pull request": "5314"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `BitVec.truncate` lemmas.", "pull request": "5357"}
{"Version": "v4.13.0", "section": "Library", "text": "introduces `BitVec.setWidth` to unify zeroExtend and truncate (@tobiasgrosser).", "pull request": "5358"}
{"Version": "v4.13.0", "section": "Library", "text": "some BitVec GetElem lemmas.", "pull request": "5361"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `BitVec.ofBool_[and|or|xor]_ofBool` theorems (@tobiasgrosser).", "pull request": "5385"}
{"Version": "v4.13.0", "section": "Library", "text": "more of `BitVec.getElem_*` (@tobiasgrosser).", "pull request": "5404"}
{"Version": "v4.13.0", "section": "Library", "text": "BitVec analogues of `Nat.mul_two` etc. (@bollu).", "pull request": "5410"}
{"Version": "v4.13.0", "section": "Library", "text": "`BitVec.toNat_{add,sub,mul_of_lt}` for non-overflow reasoning (@bollu).", "pull request": "5411"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `_self`, `_zero`, `_allOnes` for `BitVec.[and|or|xor]` (@tobiasgrosser).", "pull request": "5413"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `LawCommIdentity + IdempotentOp` for `BitVec.[and|or|xor]` (@tobiasgrosser).", "pull request": "5416"}
{"Version": "v4.13.0", "section": "Library", "text": "decidable quantifiers for BitVec.", "pull request": "5418"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `BitVec.toInt_[intMin|neg|neg_of_ne_intMin]` (@tobiasgrosser).", "pull request": "5450"}
{"Version": "v4.13.0", "section": "Library", "text": "missing BitVec lemmas.", "pull request": "5459"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `BitVec.[not_not, allOnes_shiftLeft_or_shiftLeft, allOnes_shiftLeft_and_shiftLeft]` (@luisacicolini).", "pull request": "5469"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `BitVec.(shiftLeft_add_distrib, shiftLeft_ushiftRight)` (@luisacicolini).", "pull request": "5478"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `sdiv_eq`/`smod_eq` for bitblasting in `bv_decide` (@bollu).", "pull request": "5487"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `BitVec.toNat_[abs|sdiv|smod]` (@tobiasgrosser).", "pull request": "5491"}
{"Version": "v4.13.0", "section": "Library", "text": "`BitVec.(not_sshiftRight, not_sshiftRight_not, getMsb_not, msb_not)` (@luisacicolini).", "pull request": "5492"}
{"Version": "v4.13.0", "section": "Library", "text": "drop non-terminal simps in `BitVec.Lemmas` (@tobiasgrosser).", "pull request": "5499"}
{"Version": "v4.13.0", "section": "Library", "text": "unsimps `BitVec.divRec_succ'`.", "pull request": "5505"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `BitVec.getElem_[add|add_add_bool|mul|rotateLeft|rotateRight…` (@tobiasgrosser).", "pull request": "5508"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `BitVec.[add, sub, mul]_eq_xor` and `width_one_cases` (@luisacicolini).", "pull request": "5554"}
{"Version": "v4.13.0", "section": "Library", "text": "improve naming for `List.mergeSort` lemmas.", "pull request": "5242"}
{"Version": "v4.13.0", "section": "Library", "text": "provide `mergeSort` comparator autoParam.", "pull request": "5302"}
{"Version": "v4.13.0", "section": "Library", "text": "fix name of `List.length_mergeSort`.", "pull request": "5373"}
{"Version": "v4.13.0", "section": "Library", "text": "upstream `map_mergeSort`.", "pull request": "5377"}
{"Version": "v4.13.0", "section": "Library", "text": "modify signature of lemmas about `mergeSort`.", "pull request": "5378"}
{"Version": "v4.13.0", "section": "Library", "text": "avoid importing `List.Basic` without `List.Impl`.", "pull request": "5245"}
{"Version": "v4.13.0", "section": "Library", "text": "review of List API.", "pull request": "5260"}
{"Version": "v4.13.0", "section": "Library", "text": "review of List API.", "pull request": "5264"}
{"Version": "v4.13.0", "section": "Library", "text": "remove HashMap's duplicated `Pairwise` and `Sublist` from List file.", "pull request": "5269"}
{"Version": "v4.13.0", "section": "Library", "text": "remove `@[simp]` from `List.head_mem` and similar.", "pull request": "5271"}
{"Version": "v4.13.0", "section": "Library", "text": "lemmas about `List.attach`.", "pull request": "5273"}
{"Version": "v4.13.0", "section": "Library", "text": "reverse direction of `List.tail_map`.", "pull request": "5275"}
{"Version": "v4.13.0", "section": "Library", "text": "more `List.attach` lemmas.", "pull request": "5277"}
{"Version": "v4.13.0", "section": "Library", "text": "`List.count` lemmas.", "pull request": "5285"}
{"Version": "v4.13.0", "section": "Library", "text": "use boolean predicates in `List.filter`.", "pull request": "5287"}
{"Version": "v4.13.0", "section": "Library", "text": "`List.mem_ite_nil_left` and analogues.", "pull request": "5289"}
{"Version": "v4.13.0", "section": "Library", "text": "cleanup of `List.findIdx` / `List.take` lemmas.", "pull request": "5293"}
{"Version": "v4.13.0", "section": "Library", "text": "switch primes on `List.getElem_take` lemmas.", "pull request": "5294"}
{"Version": "v4.13.0", "section": "Library", "text": "more `List.findIdx` theorems.", "pull request": "5300"}
{"Version": "v4.13.0", "section": "Library", "text": "fix `List.all/any` lemmas.", "pull request": "5310"}
{"Version": "v4.13.0", "section": "Library", "text": "fix `List.countP` lemmas.", "pull request": "5311"}
{"Version": "v4.13.0", "section": "Library", "text": "`List.tail` lemma.", "pull request": "5316"}
{"Version": "v4.13.0", "section": "Library", "text": "fix implicitness of `List.getElem_mem`.", "pull request": "5331"}
{"Version": "v4.13.0", "section": "Library", "text": "`List.replicate` lemmas.", "pull request": "5350"}
{"Version": "v4.13.0", "section": "Library", "text": "`List.attachWith` lemmas.", "pull request": "5352"}
{"Version": "v4.13.0", "section": "Library", "text": "`List.head_mem_head?`.", "pull request": "5353"}
{"Version": "v4.13.0", "section": "Library", "text": "lemmas about `List.tail`.", "pull request": "5360"}
{"Version": "v4.13.0", "section": "Library", "text": "review of `List.erase` / `List.find` lemmas.", "pull request": "5391"}
{"Version": "v4.13.0", "section": "Library", "text": "`List.fold` / `attach` lemmas.", "pull request": "5392"}
{"Version": "v4.13.0", "section": "Library", "text": "`List.fold` relators.", "pull request": "5393"}
{"Version": "v4.13.0", "section": "Library", "text": "lemmas about `List.maximum?`.", "pull request": "5394"}
{"Version": "v4.13.0", "section": "Library", "text": "theorems about `List.toArray`.", "pull request": "5403"}
{"Version": "v4.13.0", "section": "Library", "text": "reverse direction of `List.set_map`.", "pull request": "5405"}
{"Version": "v4.13.0", "section": "Library", "text": "add lemmas about `List.IsPrefix` (@Command-Master).", "pull request": "5448"}
{"Version": "v4.13.0", "section": "Library", "text": "adds `List.set_replicate_self` lemma.", "pull request": "5460"}
{"Version": "v4.13.0", "section": "Library", "text": "rename `List.maximum?` to `max?`.", "pull request": "5518"}
{"Version": "v4.13.0", "section": "Library", "text": "upstream `List.fold` lemmas.", "pull request": "5519"}
{"Version": "v4.13.0", "section": "Library", "text": "restore `@[simp]` on `List.getElem_mem` etc.", "pull request": "5520"}
{"Version": "v4.13.0", "section": "Library", "text": "List simp fixes.", "pull request": "5521"}
{"Version": "v4.13.0", "section": "Library", "text": "`List.unattach` and simp lemmas.", "pull request": "5550"}
{"Version": "v4.13.0", "section": "Library", "text": "induction-friendly `List.min?_cons`.", "pull request": "5594"}
{"Version": "v4.13.0", "section": "Library", "text": "cleanup imports of `Array.Lemmas`.", "pull request": "5246"}
{"Version": "v4.13.0", "section": "Library", "text": "split `Init.Data.Array.Lemmas` for better bootstrapping.", "pull request": "5255"}
{"Version": "v4.13.0", "section": "Library", "text": "rename `Array.data` to `Array.toList`.", "pull request": "5288"}
{"Version": "v4.13.0", "section": "Library", "text": "cleanup of `List.getElem_append` variants.", "pull request": "5303"}
{"Version": "v4.13.0", "section": "Library", "text": "`Array.not_mem_empty`.", "pull request": "5304"}
{"Version": "v4.13.0", "section": "Library", "text": "reorganization in Array/Basic.", "pull request": "5400"}
{"Version": "v4.13.0", "section": "Library", "text": "make `Array` functions semireducible or use structural recursion.", "pull request": "5420"}
{"Version": "v4.13.0", "section": "Library", "text": "refactor `DecidableEq (Array α)`.", "pull request": "5422"}
{"Version": "v4.13.0", "section": "Library", "text": "refactor of Array, see commits for details.", "pull request": "5452"}
{"Version": "v4.13.0", "section": "Library", "text": "cleanup of Array docstrings after refactor.", "pull request": "5458"}
{"Version": "v4.13.0", "section": "Library", "text": "restore `@[simp]` on `Array.swapAt!_def`.", "pull request": "5461"}
{"Version": "v4.13.0", "section": "Library", "text": "improve Array GetElem lemmas.", "pull request": "5465"}
{"Version": "v4.13.0", "section": "Library", "text": "`Array.foldX` lemmas.", "pull request": "5466"}
{"Version": "v4.13.0", "section": "Library", "text": "@[simp] lemmas about `List.toArray`.", "pull request": "5472"}
{"Version": "v4.13.0", "section": "Library", "text": "reverse simp direction for `toArray_concat`.", "pull request": "5485"}
{"Version": "v4.13.0", "section": "Library", "text": "`Array.eraseReps`.", "pull request": "5514"}
{"Version": "v4.13.0", "section": "Library", "text": "upstream `Array.qsortOrd`.", "pull request": "5515"}
{"Version": "v4.13.0", "section": "Library", "text": "upstream `Subarray.empty`.", "pull request": "5516"}
{"Version": "v4.13.0", "section": "Library", "text": "fix name of `Array.length_toList`.", "pull request": "5526"}
{"Version": "v4.13.0", "section": "Library", "text": "reduce use of deprecated lemmas in Array.", "pull request": "5527"}
{"Version": "v4.13.0", "section": "Library", "text": "cleanup of Array GetElem lemmas.", "pull request": "5534"}
{"Version": "v4.13.0", "section": "Library", "text": "fix `Array.modify` lemmas.", "pull request": "5536"}
{"Version": "v4.13.0", "section": "Library", "text": "upstream `Array.flatten` lemmas.", "pull request": "5551"}
{"Version": "v4.13.0", "section": "Library", "text": "switch obvious cases of array indexing to rely on existing hypothesis (@TomasPuverle).", "pull request": "5552"}
{"Version": "v4.13.0", "section": "Library", "text": "add missing simp to `Array.size_feraseIdx`.", "pull request": "5577"}
{"Version": "v4.13.0", "section": "Library", "text": "`Array/Option.unattach`.", "pull request": "5586"}
{"Version": "v4.13.0", "section": "Library", "text": "remove @[simp] from `Option.pmap/pbind`, add new simp lemmas.", "pull request": "5272"}
{"Version": "v4.13.0", "section": "Library", "text": "restore Option simp confluence.", "pull request": "5307"}
{"Version": "v4.13.0", "section": "Library", "text": "remove @[simp] from `Option.bind_map`.", "pull request": "5354"}
{"Version": "v4.13.0", "section": "Library", "text": "`Option.attach`.", "pull request": "5532"}
{"Version": "v4.13.0", "section": "Library", "text": "fix explicitness of `Option.mem_toList`.", "pull request": "5539"}
{"Version": "v4.13.0", "section": "Library", "text": "add @[simp] to `Nat.add_eq_zero_iff`.", "pull request": "5241"}
{"Version": "v4.13.0", "section": "Library", "text": "Nat bitwise lemmas.", "pull request": "5261"}
{"Version": "v4.13.0", "section": "Library", "text": "`Nat.testBit_add_one` is no longer a global simp lemma.", "pull request": "5262"}
{"Version": "v4.13.0", "section": "Library", "text": "protect some Nat bitwise theorems.", "pull request": "5267"}
{"Version": "v4.13.0", "section": "Library", "text": "rename Nat bitwise lemmas.", "pull request": "5305"}
{"Version": "v4.13.0", "section": "Library", "text": "add `Nat.self_sub_mod` lemma.", "pull request": "5306"}
{"Version": "v4.13.0", "section": "Library", "text": "restore @[simp] to `Nat.lt_off_iff` from upstream.", "pull request": "5503"}
{"Version": "v4.13.0", "section": "Library", "text": "rename `Int.div/mod` to `Int.tdiv/tmod`.", "pull request": "5301"}
{"Version": "v4.13.0", "section": "Library", "text": "add `ediv_nonneg_of_nonpos_of_nonpos` to `DivModLemmas` (@sakehl).", "pull request": "5320"}
{"Version": "v4.13.0", "section": "Library", "text": "missing lemma about `Fin.ofNat'`.", "pull request": "5250"}
{"Version": "v4.13.0", "section": "Library", "text": "`Fin.ofNat'` uses `NeZero`.", "pull request": "5356"}
{"Version": "v4.13.0", "section": "Library", "text": "remove some @[simp] from Fin lemmas.", "pull request": "5379"}
{"Version": "v4.13.0", "section": "Library", "text": "missing Fin @[simp] lemmas.", "pull request": "5380"}
{"Version": "v4.13.0", "section": "Library", "text": "adds DHashMap/HashMap/HashSet `(getKey? / getKey / getKey! / getKeyD).`", "pull request": "5244"}
{"Version": "v4.13.0", "section": "Library", "text": "remove last uses of `Lean.HashSet/HashMap` in library code.", "pull request": "5362"}
{"Version": "v4.13.0", "section": "Library", "text": "`HashSet.ofArray`.", "pull request": "5369"}
{"Version": "v4.13.0", "section": "Library", "text": "`HashSet.partition`.", "pull request": "5370"}
{"Version": "v4.13.0", "section": "Library", "text": "`Singleton` / `Insert` / `Union` instances for `HashMap` and `HashSet`.", "pull request": "5581"}
{"Version": "v4.13.0", "section": "Library", "text": "`HashSet.all`/`any`.", "pull request": "5582"}
{"Version": "v4.13.0", "section": "Library", "text": "`Insert` / `Singleton` / `Union` for `HashMap` / `Set.Raw`.", "pull request": "5590"}
{"Version": "v4.13.0", "section": "Library", "text": "`HashSet.Raw.all`/`any`.", "pull request": "5591"}
{"Version": "v4.13.0", "section": "Library", "text": "upstream some monad lemmas.", "pull request": "5463"}
{"Version": "v4.13.0", "section": "Library", "text": "adjust simp attributes on monad lemmas.", "pull request": "5464"}
{"Version": "v4.13.0", "section": "Library", "text": "more monadic simp lemmas.", "pull request": "5522"}
{"Version": "v4.13.0", "section": "Library", "text": "remove redundant simp annotations.", "pull request": "5251"}
{"Version": "v4.13.0", "section": "Library", "text": "remove Int simp lemmas that cannot fire.", "pull request": "5253"}
{"Version": "v4.13.0", "section": "Library", "text": "some variables on both sides of an iff should be implicit.", "pull request": "5254"}
{"Version": "v4.13.0", "section": "Library", "text": "cleaning up redundant simp lemmas.", "pull request": "5381"}
{"Version": "v4.13.0", "section": "Compiler, runtime, and FFI", "text": "fixes a typo in the C `run_new_frontend` signature.", "pull request": "4685"}
{"Version": "v4.13.0", "section": "Compiler, runtime, and FFI", "text": "IR checker suggests using `noncomputable` for missing definitions.", "pull request": "4729"}
{"Version": "v4.13.0", "section": "Compiler, runtime, and FFI", "text": "adds a shared library for Lake.", "pull request": "5143"}
{"Version": "v4.13.0", "section": "Compiler, runtime, and FFI", "text": "removes (syntactically) duplicate imports (@euprunin).", "pull request": "5437"}
{"Version": "v4.13.0", "section": "Compiler, runtime, and FFI", "text": "updates `src/lake/lakefile.toml` to the adjusted Lake build process.", "pull request": "5462"}
{"Version": "v4.13.0", "section": "Compiler, runtime, and FFI", "text": "removes new shared libs before build to better support Windows.", "pull request": "5541"}
{"Version": "v4.13.0", "section": "Compiler, runtime, and FFI", "text": "make `lean.h` compile with MSVC (@kant2002).", "pull request": "5558"}
{"Version": "v4.13.0", "section": "Compiler, runtime, and FFI", "text": "removes non-conforming size-0 arrays (@eric-wieser).", "pull request": "5564"}
{"Version": "v4.13.0", "section": "Lake", "text": "Reservoir build cache: Lake attempts to fetch a pre-built copy of packages in leanprover or leanprover-community. `--no-cache` or env var can disable. Breaking: a package's extraDep no longer transitively builds dependencies’ extraDep facets.", "pull request": "5486"}
{"Version": "v4.13.0", "section": "Lake", "text": "Reservoir build cache: Lake attempts to fetch a pre-built copy of packages in leanprover or leanprover-community. `--no-cache` or env var can disable. Breaking: a package's extraDep no longer transitively builds dependencies’ extraDep facets.", "pull request": "5572"}
{"Version": "v4.13.0", "section": "Lake", "text": "Reservoir build cache: Lake attempts to fetch a pre-built copy of packages in leanprover or leanprover-community. `--no-cache` or env var can disable. Breaking: a package's extraDep no longer transitively builds dependencies’ extraDep facets.", "pull request": "5583"}
{"Version": "v4.13.0", "section": "Lake", "text": "Reservoir build cache: Lake attempts to fetch a pre-built copy of packages in leanprover or leanprover-community. `--no-cache` or env var can disable. Breaking: a package's extraDep no longer transitively builds dependencies’ extraDep facets.", "pull request": "5600"}
{"Version": "v4.13.0", "section": "Lake", "text": "Reservoir build cache: Lake attempts to fetch a pre-built copy of packages in leanprover or leanprover-community. `--no-cache` or env var can disable. Breaking: a package's extraDep no longer transitively builds dependencies’ extraDep facets.", "pull request": "5641"}
{"Version": "v4.13.0", "section": "Lake", "text": "Reservoir build cache: Lake attempts to fetch a pre-built copy of packages in leanprover or leanprover-community. `--no-cache` or env var can disable. Breaking: a package's extraDep no longer transitively builds dependencies’ extraDep facets.", "pull request": "5642"}
{"Version": "v4.13.0", "section": "Lake", "text": "`lake new` and `lake init` now produce TOML configurations by default.", "pull request": "5504"}
{"Version": "v4.13.0", "section": "Lake", "text": "fixes a serious issue where Lake would delete path dependencies when cleaning up a dependency with an incorrect name.", "pull request": "5878"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "`@[builtin_doc]` attribute (@digama0).", "pull request": "3918"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "explains borrow syntax (@eric-wieser).", "pull request": "4305"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "adds documentation for `groupBy.loop` (@vihdzp).", "pull request": "5349"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "fixes typo in `BitVec.mul` docstring (@llllvvuu).", "pull request": "5473"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "fixes typos in `Lean.MetavarContext` docstrings.", "pull request": "5476"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "removes mention of `Lean.withSeconds` (@alexkeizer).", "pull request": "5481"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "updates docs/tests for `toUIntX` functions (@TomasPuverle).", "pull request": "5497"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "mentions that `inferType` does not ensure type correctness.", "pull request": "5087"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5425"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5426"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5427"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5430"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5431"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5434"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5435"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5436"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5438"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5439"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5440"}
{"Version": "v4.13.0", "section": "Documentation fixes", "text": "spelling fixes across doc-strings (@euprunin).", "pull request": "5599"}
{"Version": "v4.13.0", "section": "Changes to CI", "text": "allows addition of `release-ci` label via comment (@thorimur).", "pull request": "5343"}
{"Version": "v4.13.0", "section": "Changes to CI", "text": "sets check level correctly during workflow (@thorimur).", "pull request": "5344"}
{"Version": "v4.13.0", "section": "Changes to CI", "text": "Mathlib's `lean-pr-testing-NNNN` branches use Batteries' `lean-pr-testing-NNNN` branches.", "pull request": "5444"}
{"Version": "v4.13.0", "section": "Changes to CI", "text": "commit `lake-manifest.json` when updating `lean-pr-testing` branches.", "pull request": "5489"}
{"Version": "v4.13.0", "section": "Changes to CI", "text": "use separate secrets for commenting and branching in `pr-release.yml`.", "pull request": "5490"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "introduces the `bv_decide` tactic for goals involving `BitVec` and `Bool`. It reduces the goal to a SAT instance for an external solver, uses an LRAT proof, and the Lean compiler is part of the TCB. CaDiCaL solver is bundled. Includes counterexample functionality and examples in `tests/lean/run/bv_*`.", "pull request": "5013"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "introduces the `bv_decide` tactic for goals involving `BitVec` and `Bool`. It reduces the goal to a SAT instance for an external solver, uses an LRAT proof, and the Lean compiler is part of the TCB. CaDiCaL solver is bundled. Includes counterexample functionality and examples in `tests/lean/run/bv_*`.", "pull request": "5074"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "introduces the `bv_decide` tactic for goals involving `BitVec` and `Bool`. It reduces the goal to a SAT instance for an external solver, uses an LRAT proof, and the Lean compiler is part of the TCB. CaDiCaL solver is bundled. Includes counterexample functionality and examples in `tests/lean/run/bv_*`.", "pull request": "5100"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "introduces the `bv_decide` tactic for goals involving `BitVec` and `Bool`. It reduces the goal to a SAT instance for an external solver, uses an LRAT proof, and the Lean compiler is part of the TCB. CaDiCaL solver is bundled. Includes counterexample functionality and examples in `tests/lean/run/bv_*`.", "pull request": "5113"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "introduces the `bv_decide` tactic for goals involving `BitVec` and `Bool`. It reduces the goal to a SAT instance for an external solver, uses an LRAT proof, and the Lean compiler is part of the TCB. CaDiCaL solver is bundled. Includes counterexample functionality and examples in `tests/lean/run/bv_*`.", "pull request": "5137"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "introduces the `bv_decide` tactic for goals involving `BitVec` and `Bool`. It reduces the goal to a SAT instance for an external solver, uses an LRAT proof, and the Lean compiler is part of the TCB. CaDiCaL solver is bundled. Includes counterexample functionality and examples in `tests/lean/run/bv_*`.", "pull request": "5203"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "introduces the `bv_decide` tactic for goals involving `BitVec` and `Bool`. It reduces the goal to a SAT instance for an external solver, uses an LRAT proof, and the Lean compiler is part of the TCB. CaDiCaL solver is bundled. Includes counterexample functionality and examples in `tests/lean/run/bv_*`.", "pull request": "5212"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "introduces the `bv_decide` tactic for goals involving `BitVec` and `Bool`. It reduces the goal to a SAT instance for an external solver, uses an LRAT proof, and the Lean compiler is part of the TCB. CaDiCaL solver is bundled. Includes counterexample functionality and examples in `tests/lean/run/bv_*`.", "pull request": "5220"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a panic in the `reducePow` simproc for `simp`.", "pull request": "4988"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "exposes the `index` option to the `dsimp` tactic, which was introduced to `simp` in #4202.", "pull request": "5071"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a panic at `Fin.isValue` simproc in `simp`.", "pull request": "5159"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "renames `simpCtorEq` simproc to `reduceCtorEq` and makes it optional (see breaking changes).", "pull request": "5167"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "renames `simpCtorEq` simproc to `reduceCtorEq` and makes it optional (see breaking changes).", "pull request": "5175"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "ensures `reduceCtorEq` is enabled in the `norm_cast` tactic.", "pull request": "5187"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "modifies the simp debug trace messages to use \"dpre\" and \"dpost\" instead of \"pre\" and \"post\" in definitional rewrite mode. #5054 explains the `reduce` steps in `trace.Debug.Meta.Tactic.simp` messages.", "pull request": "5073"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "reduces default maximum iteration depth of `ext` from 1000000 to 100.", "pull request": "4996"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug in `induction` where `let` bindings in minor premises weren't counted correctly.", "pull request": "5117"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a panic in `omega` tactic.", "pull request": "5157"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "improves `arg n` in `conv` to handle subsingleton instance arguments.", "pull request": "5149"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "upstreams the `#time` command.", "pull request": "5044"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "makes `#check` and `#reduce` typecheck the elaborated terms.", "pull request": "5079"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes regression in incrementality where we wouldn't interrupt elaboration of previous doc versions.", "pull request": "4974"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a performance regression in incremental mode.", "pull request": "5004"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "disables incremental body elaboration in presence of `where` clauses in declarations.", "pull request": "5001"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "enables infotrees on the command line for ilean generation.", "pull request": "5018"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "improves performance of info trees in incremental elaboration.", "pull request": "5040"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "improves performance of info trees in incremental elaboration.", "pull request": "5056"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "disables incrementality in the `case .. | ..` tactic.", "pull request": "5090"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes an issue where changing whitespace after the module header could break subsequent commands. Overlaps with #5312.", "pull request": "5312"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "adds `clean_wf` tactic in `decreasing_by` to clean up tactic state. Disabled by `set_option debug.rawDecreasingByGoal false`.", "pull request": "5016"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "adds `clean_wf` tactic in `decreasing_by` to clean up tactic state. Disabled by `set_option debug.rawDecreasingByGoal false`.", "pull request": "5066"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "unifies equational theorems between structural and well-founded recursion. See also #5055 for details.", "pull request": "5055"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "allows mutually recursive functions to use different parameter names in the fixed parameter prefix.", "pull request": "5041"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "adds fine-grained equational lemmas for non-recursive functions. See breaking changes (#4154).", "pull request": "4154"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "adds fine-grained equational lemmas for non-recursive functions. See breaking changes (#4154).", "pull request": "5109"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "unifies equation lemmas for recursive and non-recursive definitions. `backward.eqns.deepRecursiveSplit = false` reverts old behavior. See breaking changes (#5129).", "pull request": "5129"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "unifies equation lemmas for recursive and non-recursive definitions. `backward.eqns.deepRecursiveSplit = false` reverts old behavior. See breaking changes (#5129).", "pull request": "5207"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "adds `f.eq_unfold` lemmas. Lean now produces four rewrite rules: eq_1, eq_2, eq_def, eq_unfold for each function, eq_unfold is especially good for rewriting under binders.", "pull request": "5141"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes bugs in recursion over predicates (#5136).", "pull request": "5136"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "documents that `include` applies only to theorems currently.", "pull request": "5206"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug where autoparam errors were associated to the wrong source position.", "pull request": "4926"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes cdot anonymous function expansions so `(· + ·)` becomes `fun x1 x2 => x1 + x2` and not ambiguous notation.", "pull request": "4833"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "improves the tactic that proves array indexing in bounds (#5037).", "pull request": "5037"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a loop in the array indexing tactic when mvars are present.", "pull request": "5119"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "makes the structure type clickable in \"not a field of structure\" errors for instance notation.", "pull request": "5072"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug where mutual `inductive` could create terms the kernel rejects.", "pull request": "4717"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug where `variable` could fail mixing binder updates and declarations.", "pull request": "5142"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "changes `syntheticHole` parser so hovering over `?_` yields docstring for synthetic holes.", "pull request": "5118"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "uses emoji variant selectors for ✅, ❌, 💥 in messages, improving font selection.", "pull request": "5173"}
{"Version": "v4.12.0", "section": "Language features, tactics, and metaprograms", "text": "fixes a bug in `rename_i` where it could rename implementation detail hypotheses.", "pull request": "5183"}
{"Version": "v4.12.0", "section": "Language server, widgets, and IDE extensions", "text": "resolves two LS bugs, especially on Windows: editing header might fail to restart file worker, or server might not start at all on slow Windows. Also fixes missed messages if a file worker restarts (#4821).", "pull request": "4821"}
{"Version": "v4.12.0", "section": "Language server, widgets, and IDE extensions", "text": "updates the user widget manual.", "pull request": "5006"}
{"Version": "v4.12.0", "section": "Language server, widgets, and IDE extensions", "text": "updates the quickstart guide with new Lean 4 extension display name.", "pull request": "5193"}
{"Version": "v4.12.0", "section": "Language server, widgets, and IDE extensions", "text": "fixes bug where \"import out of date\" messages would accumulate over time.", "pull request": "5185"}
{"Version": "v4.12.0", "section": "Language server, widgets, and IDE extensions", "text": "improves ilean loading performance by ~2x (#4900). Optimizes JSON parsing. See PR for details.", "pull request": "4900"}
{"Version": "v4.12.0", "section": "Language server, widgets, and IDE extensions", "text": "localizes an instance in `Lsp.Diagnostics` to fix issues (#5031).", "pull request": "5031"}
{"Version": "v4.12.0", "section": "Pretty printing", "text": "introduces `@[app_delab]` macro for constant-specific delaborators. Syntax `@[app_delab ident]` expands to `@[delab app.name]`.", "pull request": "4976"}
{"Version": "v4.12.0", "section": "Pretty printing", "text": "fixes a bug in the pretty printer for structure projections, which can appear in type mismatch errors. Improves hover in `#print` for structures.", "pull request": "4982"}
{"Version": "v4.12.0", "section": "Pretty printing", "text": "adds `pp.exprSizes` debug option. When true, printed expressions get `[size a/b/c]` prefix showing sizes with/without sharing.", "pull request": "5218"}
{"Version": "v4.12.0", "section": "Pretty printing", "text": "adds `pp.exprSizes` debug option. When true, printed expressions get `[size a/b/c]` prefix showing sizes with/without sharing.", "pull request": "5239"}
{"Version": "v4.12.0", "section": "Library", "text": "swaps the parameters to `Membership.mem`, so the set-like `CoeSort` refers to `fun x => mem s x`. See breaking changes (#5020).", "pull request": "5020"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `@[ext]` attribute to `Array.ext` and deprecates `Array.get_modify` (#4957).", "pull request": "4970"}
{"Version": "v4.12.0", "section": "Library", "text": "deprecates `Array.get_modify` (#4970).", "pull request": "4957"}
{"Version": "v4.12.0", "section": "Library", "text": "upstreams `List.findIdx` lemmas.", "pull request": "4995"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.Sublist` lemmas, some upstreamed. Also fixes implicitness in `refl/rfl` lemma binders. (#5029, #5048, #5132, #5077).", "pull request": "5029"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.Sublist` lemmas, some upstreamed. Also fixes implicitness in `refl/rfl` lemma binders. (#5029, #5048, #5132, #5077).", "pull request": "5048"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.Sublist` lemmas, some upstreamed. Also fixes implicitness in `refl/rfl` lemma binders. (#5029, #5048, #5132, #5077).", "pull request": "5132"}
{"Version": "v4.12.0", "section": "Library", "text": "fixes implicitness in `List.Sublist` lemma binders (#5077).", "pull request": "5077"}
{"Version": "v4.12.0", "section": "Library", "text": "upstreams `List.Pairwise` lemmas.", "pull request": "5047"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.find?/findSome?/findIdx?` theorems (#5053, #5124, #5161).", "pull request": "5053"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.find?/findSome?/findIdx?` theorems (#5053, #5124, #5161).", "pull request": "5124"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.find?/findSome?/findIdx?` theorems (#5053, #5124, #5161).", "pull request": "5161"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.foldlRecOn` and `List.foldrRecOn` to prove theorems about `foldl`/`foldr` (#5039).", "pull request": "5039"}
{"Version": "v4.12.0", "section": "Library", "text": "upstreams `List.Perm` (#5069).", "pull request": "5069"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.mergeSort` with fast `@[csimp]` implementation (#5092, #5107).", "pull request": "5092"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.mergeSort` with fast `@[csimp]` implementation (#5092, #5107).", "pull request": "5107"}
{"Version": "v4.12.0", "section": "Library", "text": "makes the simp lemmas for `List.subset` more aggressive (#5103).", "pull request": "5103"}
{"Version": "v4.12.0", "section": "Library", "text": "changes the statement of `List.getLast?_cons` (#5106).", "pull request": "5106"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.range` and `List.iota` lemmas (#5123, #5158).", "pull request": "5123"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.range` and `List.iota` lemmas (#5123, #5158).", "pull request": "5158"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.join` lemmas (#5130).", "pull request": "5130"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.append` lemmas (#5131).", "pull request": "5131"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.erase(|P|Idx)` lemmas (#5152).", "pull request": "5152"}
{"Version": "v4.12.0", "section": "Library", "text": "misc lemma updates for `List` (#5127).", "pull request": "5127"}
{"Version": "v4.12.0", "section": "Library", "text": "lemmas about `List.attach` / `List.pmap` (#5153, #5160).", "pull request": "5153"}
{"Version": "v4.12.0", "section": "Library", "text": "lemmas about `List.attach` / `List.pmap` (#5153, #5160).", "pull request": "5160"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.find?` and `List.range'/range/iota` lemmas (#5164, #5177, #5215).", "pull request": "5164"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.find?` and `List.range'/range/iota` lemmas (#5164, #5177, #5215).", "pull request": "5177"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.find?` and `List.range'/range/iota` lemmas (#5164, #5177, #5215).", "pull request": "5215"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `List.Pairwise_erase` etc. (#5196).", "pull request": "5196"}
{"Version": "v4.12.0", "section": "Library", "text": "improves confluence of `List` simp lemmas (#5151, #5163, #5105, #5102).", "pull request": "5151"}
{"Version": "v4.12.0", "section": "Library", "text": "improves confluence of `List` simp lemmas (#5151, #5163, #5105, #5102).", "pull request": "5163"}
{"Version": "v4.12.0", "section": "Library", "text": "adjust `List` simp lemmas (#5105, #5102).", "pull request": "5105"}
{"Version": "v4.12.0", "section": "Library", "text": "adjust `List` simp lemmas (#5105, #5102).", "pull request": "5102"}
{"Version": "v4.12.0", "section": "Library", "text": "removes `List.getLast_eq_iff_getLast_eq_some` as a simp lemma (#5178).", "pull request": "5178"}
{"Version": "v4.12.0", "section": "Library", "text": "reverses meaning of `List.getElem_drop` / `List.getElem_drop'` (#5210).", "pull request": "5210"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `Nat.add_left_eq_self` and similar (#5104).", "pull request": "5104"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `Nat.and_xor_distrib_(left|right)` (#5146).", "pull request": "5146"}
{"Version": "v4.12.0", "section": "Library", "text": "improves confluence of `Nat` and `Int` simp lemmas (#5148, #5190).", "pull request": "5148"}
{"Version": "v4.12.0", "section": "Library", "text": "improves confluence of `Nat` and `Int` simp lemmas (#5148, #5190).", "pull request": "5190"}
{"Version": "v4.12.0", "section": "Library", "text": "adjusts `Int` simp lemmas (#5165).", "pull request": "5165"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `Int` lemmas about `neg` with `emod`/`mod` (#5166).", "pull request": "5166"}
{"Version": "v4.12.0", "section": "Library", "text": "reverses direction of `Int.toNat_sub` simp lemma (#5208).", "pull request": "5208"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `Nat.bitwise` lemmas (#5209).", "pull request": "5209"}
{"Version": "v4.12.0", "section": "Library", "text": "corrects docstrings for integer division and modulus (#5230).", "pull request": "5230"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `Option` lemmas (#5128, #5154).", "pull request": "5128"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `Option` lemmas (#5128, #5154).", "pull request": "5154"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `sshiftRight` bitblasting to `BitVec` (#4889).", "pull request": "4889"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `Std.Associative` and `Std.Commutative` for `BitVec.[and|or|xor]` (#4981).", "pull request": "4981"}
{"Version": "v4.12.0", "section": "Library", "text": "enables `missingDocs` error for `BitVec` modules (#4913).", "pull request": "4913"}
{"Version": "v4.12.0", "section": "Library", "text": "makes parameter names more consistent in `BitVec` (#4930).", "pull request": "4930"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `BitVec.intMin`, introduces `boolToPropSimps` set for boolean→propositional (#5098).", "pull request": "5098"}
{"Version": "v4.12.0", "section": "Library", "text": "renames `BitVec.getLsb` etc. to `BitVec.getLsbD`, aligning with `List`/`Array` naming (#5200, #5217).", "pull request": "5200"}
{"Version": "v4.12.0", "section": "Library", "text": "renames `BitVec.getLsb` etc. to `BitVec.getLsbD`, aligning with `List`/`Array` naming (#5200, #5217).", "pull request": "5217"}
{"Version": "v4.12.0", "section": "Library", "text": "various BitVec theorems (#4977, #4951, #4667, #5007, #4997, #5083, #5081, #4392).", "pull request": "4977"}
{"Version": "v4.12.0", "section": "Library", "text": "various BitVec theorems (#4977, #4951, #4667, #5007, #4997, #5083, #5081, #4392).", "pull request": "4951"}
{"Version": "v4.12.0", "section": "Library", "text": "various BitVec theorems (#4977, #4951, #4667, #5007, #4997, #5083, #5081, #4392).", "pull request": "4667"}
{"Version": "v4.12.0", "section": "Library", "text": "various BitVec theorems (#4977, #4951, #4667, #5007, #4997, #5083, #5081, #4392).", "pull request": "5007"}
{"Version": "v4.12.0", "section": "Library", "text": "various BitVec theorems (#4977, #4951, #4667, #5007, #4997, #5083, #5081, #4392).", "pull request": "4997"}
{"Version": "v4.12.0", "section": "Library", "text": "various BitVec theorems (#4977, #4951, #4667, #5007, #4997, #5083, #5081, #4392).", "pull request": "5083"}
{"Version": "v4.12.0", "section": "Library", "text": "various BitVec theorems (#4977, #4951, #4667, #5007, #4997, #5083, #5081, #4392).", "pull request": "5081"}
{"Version": "v4.12.0", "section": "Library", "text": "various BitVec theorems (#4977, #4951, #4667, #5007, #4997, #5083, #5081, #4392).", "pull request": "4392"}
{"Version": "v4.12.0", "section": "Library", "text": "fixes naming convention for `UInt` lemmas (#4514).", "pull request": "4514"}
{"Version": "v4.12.0", "section": "Library", "text": "deprecates variants of hash map query methods, switching `Lean.HashMap`→`Std.HashMap` (#4943).", "pull request": "4943"}
{"Version": "v4.12.0", "section": "Library", "text": "switches library/Lean to `Std.HashMap`/`Std.HashSet` (#4917).", "pull request": "4917"}
{"Version": "v4.12.0", "section": "Library", "text": "deprecates `Lean.HashMap` and `Lean.HashSet` (#4954).", "pull request": "4954"}
{"Version": "v4.12.0", "section": "Library", "text": "cleans up lemma parameters in HashMap/HashSet (#5023).", "pull request": "5023"}
{"Version": "v4.12.0", "section": "Library", "text": "adds definitions of SAT/CNF in `Std.Sat` for `bv_decide` (#4933).", "pull request": "4933"}
{"Version": "v4.12.0", "section": "Library", "text": "defines \"and-inverter graphs\" (AIGs) for `Std.Sat` (#4953).", "pull request": "4953"}
{"Version": "v4.12.0", "section": "Library", "text": "generalizes `Parsec` for iterable data, moves from `Lean.Data.Parsec` to `Std.Internal.Parsec`. Breaking changes (#4774).", "pull request": "4774"}
{"Version": "v4.12.0", "section": "Library", "text": "moves `Lean.Data.Parsec` to `Std.Internal.Parsec` for bootstrapping (#5115).", "pull request": "5115"}
{"Version": "v4.12.0", "section": "Library", "text": "upstreams `Thunk.ext` (#4969).", "pull request": "4969"}
{"Version": "v4.12.0", "section": "Library", "text": "`IO.FS.lines` now handles `\\r\\n` on all OSes (#4973).", "pull request": "4973"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `createTempFile`/`withTempFile` for secure temporary files (#5125).", "pull request": "5125"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `Array`, `Bool`, and `Prod` utilities from LeanSAT (#4945).", "pull request": "4945"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `Relation.TransGen.trans` (#4960).", "pull request": "4960"}
{"Version": "v4.12.0", "section": "Library", "text": "states `WellFoundedRelation Nat` using `<` not `Nat.lt` (#5012).", "pull request": "5012"}
{"Version": "v4.12.0", "section": "Library", "text": "uses `≠` in `Fin.ne_of_val_ne` (#5011).", "pull request": "5011"}
{"Version": "v4.12.0", "section": "Library", "text": "upstreams `Fin.le_antisymm` (#5197).", "pull request": "5197"}
{"Version": "v4.12.0", "section": "Library", "text": "reduces usage of `refine'` (#5042).", "pull request": "5042"}
{"Version": "v4.12.0", "section": "Library", "text": "adds about `if-then-else` and `Option` (#5101).", "pull request": "5101"}
{"Version": "v4.12.0", "section": "Library", "text": "adds basic instances for `ULift` and `PLift` (#5112).", "pull request": "5112"}
{"Version": "v4.12.0", "section": "Library", "text": "fixes from running the simpNF linter over Lean (#5133, #5168).", "pull request": "5133"}
{"Version": "v4.12.0", "section": "Library", "text": "fixes from running the simpNF linter over Lean (#5133, #5168).", "pull request": "5168"}
{"Version": "v4.12.0", "section": "Library", "text": "removes a bad simp lemma in `omega` (#5156).", "pull request": "5156"}
{"Version": "v4.12.0", "section": "Library", "text": "improves confluence of `Bool` simp lemmas (#5155).", "pull request": "5155"}
{"Version": "v4.12.0", "section": "Library", "text": "improves confluence of `Function.comp` simp lemmas (#5162).", "pull request": "5162"}
{"Version": "v4.12.0", "section": "Library", "text": "improves confluence of `if-then-else` simp lemmas (#5191).", "pull request": "5191"}
{"Version": "v4.12.0", "section": "Library", "text": "adds `@[elab_as_elim]` to `Quot.rec`, `Nat.strongInductionOn`, etc. Renames `Nat.strongInductionOn`→`Nat.strongRecOn` (#5147, deprecated in #5179).", "pull request": "5147"}
{"Version": "v4.12.0", "section": "Library", "text": "renames `Nat.strongInductionOn`→`Nat.strongRecOn` (deprecated in #5179).", "pull request": "5179"}
{"Version": "v4.12.0", "section": "Library", "text": "disables some simp lemmas with bad discrimination tree keys (#5180).", "pull request": "5180"}
{"Version": "v4.12.0", "section": "Library", "text": "cleans up leaked internal simp lemmas (#5189).", "pull request": "5189"}
{"Version": "v4.12.0", "section": "Library", "text": "cleans up `allowUnsafeReducibility` (#5198).", "pull request": "5198"}
{"Version": "v4.12.0", "section": "Library", "text": "removes unused lemmas from some `simp` tactics (#5229).", "pull request": "5229"}
{"Version": "v4.12.0", "section": "Library", "text": "removes >6 month old deprecations (#5199).", "pull request": "5199"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "rewrote some core algorithms in C++ for performance. `instantiateLevelMVars`, `instantiateExprMVars` are ~30% faster. (#4910, #4912, #4915, #4922, #4931).", "pull request": "4910"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "rewrote some core algorithms in C++ for performance. `instantiateLevelMVars`, `instantiateExprMVars` are ~30% faster. (#4910, #4912, #4915, #4922, #4931).", "pull request": "4912"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "rewrote some core algorithms in C++ for performance. `instantiateLevelMVars`, `instantiateExprMVars` are ~30% faster. (#4910, #4912, #4915, #4922, #4931).", "pull request": "4915"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "rewrote some core algorithms in C++ for performance. `instantiateLevelMVars`, `instantiateExprMVars` are ~30% faster. (#4910, #4912, #4915, #4922, #4931).", "pull request": "4922"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "rewrote some core algorithms in C++ for performance. `instantiateLevelMVars`, `instantiateExprMVars` are ~30% faster. (#4910, #4912, #4915, #4922, #4931).", "pull request": "4931"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "optimizes kernel's `Expr` equality test (#4934).", "pull request": "4934"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "fixes bug in hashing for the kernel's `Expr` equality test (#4990).", "pull request": "4990"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "skips some `PreDefinition` transformations if not needed (#4935, #4936).", "pull request": "4935"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "skips some `PreDefinition` transformations if not needed (#4935, #4936).", "pull request": "4936"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "adds caching for visited exprs at `CheckAssignmentQuick` in `ExprDefEq` (#5225).", "pull request": "5225"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "maximizes term sharing in `instantiateMVarDeclMVars` (#5226).", "pull request": "5226"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "adds profiling for `instantiateMVars` in `Lean.Elab.MutualDef` (#4923).", "pull request": "4923"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "adds diagnostics for large theorems, configured by `diagnostics.threshold.proofSize` (#4924).", "pull request": "4924"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "improves display of diagnostic results (#4897).", "pull request": "4897"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "cleans up `Expr.betaRev` (#4921).", "pull request": "4921"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "fixes tests so we don't write to stdout from separate threads (#4940).", "pull request": "4940"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "documents that `stderrAsMessages` is now default on the CLI (#4955).", "pull request": "4955"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "updates macOS build docs (#4647).", "pull request": "4647"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "makes direct mvar assignments take precedence over delayed ones in `instantiateMVars` (#4987).", "pull request": "4987"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "adds linter name to errors if a linter crashes (#4967).", "pull request": "4967"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "cleans up command line snapshots logic (#5043).", "pull request": "5043"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "minimizes some imports (#5067).", "pull request": "5067"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "generalizes the monad for `addMatcherInfo` (#5068).", "pull request": "5068"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "adds missing test for #5126 (#f71a1fb).", "pull request": "5126"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "restores a test (#5201).", "pull request": "5201"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "fixes a bug where label attributes did not pass on the attribute kind (#3698).", "pull request": "3698"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "typo fixes (#5080, #5150, #5202).", "pull request": "5080"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "typo fixes (#5080, #5150, #5202).", "pull request": "5150"}
{"Version": "v4.12.0", "section": "Lean internals", "text": "typo fixes (#5080, #5150, #5202).", "pull request": "5202"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "moves frontend to new snapshot architecture (#3106). `Frontend.processCommand` and `FrontendM` remain but not used by Lean core.", "pull request": "3106"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "adds missing include in runtime for `AUTO_THREAD_FINALIZATION` on Windows (#4919).", "pull request": "4919"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "adds more `LEAN_EXPORT`s for Windows (#4941).", "pull request": "4941"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "improves formatting of CLI help text (#4911).", "pull request": "4911"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "improves file read/write: `readBinFile` uses fewer syscalls, `Handle.getLine` no longer tripped by NUL (#4950).", "pull request": "4950"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "handles SIGBUS for stack overflows (#4971).", "pull request": "4971"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "avoids overwriting existing signal handlers (#5062), referencing rust-lang/rust#69685.", "pull request": "5062"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "improves Windows build by splitting `libleanshared`, removing `LEAN_EXPORT` denylist, adds missing exports (#4860).", "pull request": "4860"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "ensures panics go to Lean's stderr, so they're visible in LS and command line (#4952).", "pull request": "4952"}
{"Version": "v4.12.0", "section": "Compiler, runtime, and FFI", "text": "links LibUV (#4963). LibUV is now required for building Lean from source (see breaking changes).", "pull request": "4963"}
{"Version": "v4.12.0", "section": "Lake", "text": "removes dead code (#5030).", "pull request": "5030"}
{"Version": "v4.12.0", "section": "Lake", "text": "adds fields to package config for Reservoir (#4770). See PR for details.", "pull request": "4770"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "improves release checklist (#4914, #4937).", "pull request": "4914"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "improves release checklist (#4914, #4937).", "pull request": "4937"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "ignores stale leanpkg tests (#4925).", "pull request": "4925"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "upgrades `actions/cache` in CI (#5003).", "pull request": "5003"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "sets `save-always` in cache actions (#5010).", "pull request": "5010"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "adds more libuv search patterns for speedcenter (#5008).", "pull request": "5008"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "reduces runs for \"fast\" benchmarks from 10 to 3 in speedcenter (#5009).", "pull request": "5009"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "adjusts lakefile editing to new `git` syntax in `pr-release` (#5014).", "pull request": "5014"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "passes `--retry` to `curl` in `pr-release` (#5025).", "pull request": "5025"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "builds MacOS Aarch64 release for PRs by default (#5022).", "pull request": "5022"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "adds libuv to the MacOS docs (#5045).", "pull request": "5045"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "fixes the install name of `libleanshared_1` on macOS (#5034).", "pull request": "5034"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "fixes Windows stage 0 (#5051).", "pull request": "5051"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "fixes 32bit stage 0 builds (#5052).", "pull request": "5052"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "avoids rebuilding `leanmanifest` in each build (#5057).", "pull request": "5057"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "makes `restart-on-label` filter by commit SHA (#5099).", "pull request": "5099"}
{"Version": "v4.12.0", "section": "DevOps/CI", "text": "adds CaDiCaL (#4325).", "pull request": "4325"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "LibUV is now required to build Lean from source. Devs compiling Lean themselves must install LibUV. (#4963)", "pull request": "4963"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "Recursive defs with `decreasing_by` that begin with `simp_wf` may break. Remove `simp_wf` or replace with `simp`. (#5016)", "pull request": "5016"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "Behavior changed for `rw [f]` when `f` is a non-recursive function defined by pattern matching. For example, `rw [Option.map]` now fails. Remedies: split on parameter, use `f.eq_def`, or `set_option backward.eqns.nonrecursive false`. (#4154)", "pull request": "4154"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "Unified equation lemmas for recursive and non-recursive functions adds more eq lemmas. Might break rewrites if numbering changed. See #5129, #5207. Also can set `backward.eqns.deepRecursiveSplit false`. (#5129)", "pull request": "5129"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "The `reduceCtorEq` simproc is now optional. Might need `simp only [reduceCtorEq]`. (#5167)", "pull request": "5167"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "`Nat.strongInductionOn` → `Nat.strongRecOn`, `Nat.caseStrongInductionOn` → `Nat.caseStrongRecOn`. (#5147)", "pull request": "5147"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "The parameters to `Membership.mem` are swapped, which affects `SetLike` usage. (#5020)", "pull request": "5020"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "`List.getElem_drop` and `List.getElem_drop'` got reversed. (#5210)", "pull request": "5210"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "`Parsec` moved from `Lean.Data.Parsec` to `Std.Internal.Parsec`. It's now more general. For strings, use `Parser` in `Std.Internal.Parsec.String`. (#4774)", "pull request": "4774"}
{"Version": "v4.12.0", "section": "Breaking changes", "text": "`Lean.HashMap` and `Lean.HashSet` are deprecated in favor of `Std.HashMap/Std.HashSet`. Query functions are renamed, `map[key]` expects presence. (#4943, #4954)", "pull request": "4943"}