Version
stringclasses 20
values | section
stringclasses 275
values | text
stringlengths 14
1.01k
| pull request
stringlengths 3
15
|
|---|---|---|---|
v4.15.0 | Language | relates that operations `Nat.fold`/`foldRev`/`any`/`all` to the corresponding List operations over `List.finRange`. | 6235 |
v4.15.0 | Language | 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. | 6241 |
v4.15.0 | Language | deprecates `Fin.ofNat` in favour of `Fin.ofNat'` (which takes an `[NeZero]` instance, rather than returning an element of `Fin (n+1)`). | 6242 |
v4.15.0 | Language | adds the theorems `numBits_pos`, `le_numBits`, `numBits_le`, which make proving inequalities about `System.Platform.numBits` easier. | 6247 |
v4.15.0 | Compiler | changes `lean_sharecommon_{eq,hash}` to only consider the salient bytes of an object, and not any bytes of any unspecified/uninitialized unused capacity. | 5840 |
v4.15.0 | Compiler | fixes a bug in the constant folding for the `Nat.ble` and `Nat.blt` function in the old code generator, leading to a miscompilation. | 6087 |
v4.15.0 | Compiler | 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. | 6143 |
v4.15.0 | Compiler | fixes a bug in the constant folding for the `Nat.ble` and `Nat.blt` function in the old code generator, leading to a miscompilation. | 6087 |
v4.15.0 | Compiler | fixes an issue where edits to a command containing a nested docstring fail to reparse the entire command. | 6236 |
v4.15.0 | Compiler | fixes `trace.profiler.pp` not using the term pretty printer. | 6138 |
v4.15.0 | Compiler | adds core metaprogramming functions for forking off background tasks from elaboration such that their results are visible to reporting and the language server. | 6170 |
v4.15.0 | Compiler | 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. | 6175 |
v4.15.0 | Compiler | 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. | 6180 |
v4.15.0 | Compiler | adds the builtin simproc `USize.reduceToNat` which reduces the `USize.toNat` operation on literals less than `UInt32.size` (i.e., `4294967296`). | 6190 |
v4.15.0 | Compiler | adds a primitive for accessing the current thread ID. | 6049 |
v4.15.0 | Compiler | fixes a bug in the proof assembly procedure utilized by the grind tactic. | 6056 |
v4.15.0 | Compiler | adds `Lean.loadPlugin` which exposes functionality similar to the `lean` executable's `--plugin` option to Lean code. | 6130 |
v4.15.0 | Pretty Printing | 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)`. | 2934 |
v4.15.0 | Pretty Printing | prevents `Nat.succ ?_` from pretty printing as `?_.succ`, which should make `apply?` be more usable. | 6014 |
v4.15.0 | Pretty Printing | 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. | 6085 |
v4.15.0 | Pretty Printing | 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. | 6096 |
v4.15.0 | Pretty Printing | adds a new delab option `pp.coercions.types` which, when enabled, will display all coercions with an explicit type ascription. | 6119 |
v4.15.0 | Pretty Printing | ensures whitespace is printed before `+opt` and `-opt` configuration options when pretty printing, improving the experience of tactics such as `simp?`. | 6161 |
v4.15.0 | Pretty Printing | 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. | 6181 |
v4.15.0 | Pretty Printing | exposes the difference in "synthesized type class instance is not definitionally equal" errors. | 6213 |
v4.15.0 | Documentation | fixes a typo in the docstring for prec and makes the text slightly more precise. | 6009 |
v4.15.0 | Documentation | join → flatten in docstring | 6040 |
v4.15.0 | Documentation | does some mild refactoring of the `Lean.Elab.StructInst` module while adding documentation. | 6110 |
v4.15.0 | Documentation | converts 3 doc-string to module docs since it seems that this is what they were intended to be! | 6144 |
v4.15.0 | Documentation | refine kernel code comments | 6150 |
v4.15.0 | Documentation | adjust file reference in Data.Sum | 6158 |
v4.15.0 | Documentation | explains the order in which `Expr.abstract` introduces de Bruijn indices. | 6239 |
v4.15.0 | Server | 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. | 5835 |
v4.15.0 | Server | fixes an old auto-completion bug where `x.` would issue nonsensical completions when `x.` could not be elaborated as a dot completion. | 5837 |
v4.15.0 | Server | avoid max heartbeat error in completion | 5996 |
v4.15.0 | Server | fixes a regression with go-to-definition and document highlight misbehaving on tactic blocks. | 6031 |
v4.15.0 | Server | 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. | 6246 |
v4.15.0 | Lake | update toolchain on `lake update` | 5684 |
v4.15.0 | Lake | adds a newline at end of each Lean file generated by `lake new` templates. | 6026 |
v4.15.0 | Lake | makes Lake no longer automatically fetch GitHub cloud releases if the package build directory is already present (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`. | 6218 |
v4.15.0 | Lake | makes `lake build` also eagerly print package materialization log lines. Previously, only a `lake update` performed eager logging. | 6225 |
v4.15.0 | Lake | 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. | 6231 |
v4.14.0 | Language features, tactics, and metaprograms | 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). | 5517 |
v4.14.0 | Language features, tactics, and metaprograms | the command can now define recursive inductive types:
```lean
structure Tree where
n : Nat
children : Fin n → Tree
def Tree.size : Tree → Nat
| {n, children} => Id.run do
let mut s := 0
for h : i in [0 : n] do
s := s + (children ⟨i, h.2⟩).size
pure s
``` | 5842 |
v4.14.0 | Language features, tactics, and metaprograms | fixes a bug where Mathlib's `Type*` elaborator could lead to incorrect universe parameters with the command. | 5814 |
v4.14.0 | Language features, tactics, and metaprograms | fix bugs in default value processing for structure instance notation (with @arthur-adjedj). | 3152 |
v4.14.0 | Language features, tactics, and metaprograms | fix bugs in default value processing for structure instance notation (with @arthur-adjedj). | 5844 |
v4.14.0 | Language features, tactics, and metaprograms | promotes instance synthesis order calculation failure from a soft error to a hard error. | 5399 |
v4.14.0 | Language features, tactics, and metaprograms | deprecates `:=` variants of `inductive` and `structure` (see breaking changes). | 5542 |
v4.14.0 | Language features, tactics, and metaprograms | makes `@[elab_as_elim]` require at least one discriminant, since otherwise there is no advantage to this alternative elaborator. | 5671 |
v4.14.0 | Language features, tactics, and metaprograms | enables field notation in explicit mode. The syntax `@x.f` elaborates as `@S.f` with `x` supplied to the appropriate parameter. | 5528 |
v4.14.0 | Language features, tactics, and metaprograms | 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`. | 5692 |
v4.14.0 | Language features, tactics, and metaprograms | 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. | 5658 |
v4.14.0 | Language features, tactics, and metaprograms | fixes a bug where `..` ellipses in patterns made use of optparams and autoparams. | 5933 |
v4.14.0 | Language features, tactics, and metaprograms | 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. | 5770 |
v4.14.0 | Language features, tactics, and metaprograms | fixes functional induction principle generation to avoid over-eta-expanding in the preprocessing step. | 5619 |
v4.14.0 | Language features, tactics, and metaprograms | fixes structural nested recursion so that it is not confused when a nested type appears first. | 5766 |
v4.14.0 | Language features, tactics, and metaprograms | fixes a bug in functional induction principle generation when there are `let` bindings. | 5803 |
v4.14.0 | Language features, tactics, and metaprograms | improves functional induction principle generation to unfold aux definitions more carefully. | 5904 |
v4.14.0 | Language features, tactics, and metaprograms | refactors code for `Predefinition.Structural`. | 5850 |
v4.14.0 | Language features, tactics, and metaprograms | fixes a bug in "type mismatch" errors that would structurally assign metavariables during the algorithm to expose differences. | 5276 |
v4.14.0 | Language features, tactics, and metaprograms | makes "type mismatch" errors add type ascriptions to expose differences for numeric literals. | 5919 |
v4.14.0 | Language features, tactics, and metaprograms | makes "type mismatch" errors expose differences in the bodies of functions and pi types. | 5922 |
v4.14.0 | Language features, tactics, and metaprograms | improves the error message for invalid induction alternative names in `match` expressions (@josojo). | 5888 |
v4.14.0 | Language features, tactics, and metaprograms | improves `calc` error messages. | 5719 |
v4.14.0 | Language features, tactics, and metaprograms | 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. | 5627 |
v4.14.0 | Language features, tactics, and metaprograms | 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. | 5663 |
v4.14.0 | Language features, tactics, and metaprograms | improves the error message when `partial` fails to prove a type is inhabited. Add delta deriving. | 5780 |
v4.14.0 | Language features, tactics, and metaprograms | gives `partial` inhabitation the ability to create local `Inhabited` instances from parameters. | 5821 |
v4.14.0 | Language features, tactics, and metaprograms | 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.) | 5883 |
v4.14.0 | Language features, tactics, and metaprograms | 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.) | 5898 |
v4.14.0 | Language features, tactics, and metaprograms | 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.) | 5928 |
v4.14.0 | Language features, tactics, and metaprograms | 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.) | 5932 |
v4.14.0 | Language features, tactics, and metaprograms | fixes the simpproc for `Fin` literals to reduce more consistently. | 5632 |
v4.14.0 | Language features, tactics, and metaprograms | fixes a bug in `simpa ... using t` where metavariables in `t` were not properly accounted for, and improves the type mismatch error. | 5648 |
v4.14.0 | Language features, tactics, and metaprograms | fixes the docstring of `simp!` to actually talk about `simp!`. | 5838 |
v4.14.0 | Language features, tactics, and metaprograms | adds support for `attribute [simp ←]` which adds the reverse of a theorem as a global simp theorem. | 5870 |
v4.14.0 | Language features, tactics, and metaprograms | adds `decide!` tactic for using kernel reduction. (Renamed to `decide +kernel` in a future release.) | 5665 |
v4.14.0 | Language features, tactics, and metaprograms | adds inequality regression tests to `bv_decide` (@alexkeizer). | 5714 |
v4.14.0 | Language features, tactics, and metaprograms | adds `bv_toNat` tag for `toNat_ofInt` (@bollu). | 5608 |
v4.14.0 | Language features, tactics, and metaprograms | adds support for `at` in `ac_nf` and uses it in `bv_normalize` (@tobiasgrosser). | 5618 |
v4.14.0 | Language features, tactics, and metaprograms | adds udiv support to `bv_decide`. | 5628 |
v4.14.0 | Language features, tactics, and metaprograms | adds auxiliary bitblasters for negation and subtraction. | 5635 |
v4.14.0 | Language features, tactics, and metaprograms | adds more `getLsbD` bitblaster theory. | 5637 |
v4.14.0 | Language features, tactics, and metaprograms | adds umod support to `bv_decide`. | 5652 |
v4.14.0 | Language features, tactics, and metaprograms | adds performance benchmark for modulo in `bv_decide`. | 5653 |
v4.14.0 | Language features, tactics, and metaprograms | reduces error on `bv_check` to warning. | 5655 |
v4.14.0 | Language features, tactics, and metaprograms | adds `~~~(-x)` support in `bv_decide`. | 5670 |
v4.14.0 | Language features, tactics, and metaprograms | disables `ac_nf` by default in `bv_decide`. | 5673 |
v4.14.0 | Language features, tactics, and metaprograms | fixes context tracking in `bv_decide` counter example generation. | 5675 |
v4.14.0 | Language features, tactics, and metaprograms | adds an error when the LRAT proof is invalid in `bv_decide`. | 5676 |
v4.14.0 | Language features, tactics, and metaprograms | introduces uninterpreted symbols everywhere in `bv_decide`. | 5781 |
v4.14.0 | Language features, tactics, and metaprograms | adds `BitVec.sdiv` support to `bv_decide`. | 5823 |
v4.14.0 | Language features, tactics, and metaprograms | adds `BitVec.ofBool` support to `bv_decide`. | 5852 |
v4.14.0 | Language features, tactics, and metaprograms | adds `if` support to `bv_decide`. | 5855 |
v4.14.0 | Language features, tactics, and metaprograms | adds support for all the SMTLIB BitVec divison/remainder operations to `bv_decide`. | 5869 |
v4.14.0 | Language features, tactics, and metaprograms | adds embedded constraint substitution to `bv_decide`. | 5886 |
v4.14.0 | Language features, tactics, and metaprograms | fixes loose mvars bug in `bv_normalize`. | 5918 |
v4.14.0 | Language features, tactics, and metaprograms | improves the `congr` conv tactic to handle over-applied functions. | 5861 |
v4.14.0 | Language features, tactics, and metaprograms | 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 [...]`. | 5894 |