diff options
| author | Son HO | 2024-02-03 00:23:30 +0100 |
|---|---|---|
| committer | GitHub | 2024-02-03 00:23:30 +0100 |
| commit | eb8bddcbd120f666f74023de9a23c48e1a55833d (patch) | |
| tree | 1d8290e4b947e431c3d8d3a9f8575f23c3afe5e1 /tests/lean/Tutorial.lean | |
| parent | 0960ad16838a43da3746f47cf5b640bfbb783d84 (diff) | |
| parent | 9cc912e2414870df85ffc4dd346ade5dba2b5c37 (diff) | |
Merge pull request #68 from AeneasVerif/son/update_lean
Update Lean to v4.6.0-rc1
Diffstat (limited to 'tests/lean/Tutorial.lean')
| -rw-r--r-- | tests/lean/Tutorial.lean | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/tests/lean/Tutorial.lean b/tests/lean/Tutorial.lean index 840a606e..d92b2dd7 100644 --- a/tests/lean/Tutorial.lean +++ b/tests/lean/Tutorial.lean @@ -376,7 +376,7 @@ theorem i32_id_spec (x : I32) (h : 0 ≤ x.val) : -- -- We first specify a decreasing value. Here, we state that [x], seen as a natural number, -- decreases at every recursive call. -termination_by i32_id_spec x _ => x.val.toNat +termination_by x.val.toNat -- And we now have to prove that it indeed decreases - you can skip this for now. decreasing_by -- We first need to "massage" the goal (in practice, all the proofs of [decreasing_by] |