diff options
| author | Son Ho | 2024-02-02 23:16:57 +0100 |
|---|---|---|
| committer | Son Ho | 2024-02-02 23:16:57 +0100 |
| commit | 63ee3b1bc65b67aeed843f052d7f67c9f3c0ab89 (patch) | |
| tree | 988e7fc35064910e56d4a510465f5172b8828da0 /tests/lean/Tutorial.lean | |
| parent | 1259db13a154b0d5f101d2f874ae017b81ed4e72 (diff) | |
Start fixing the tests
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] |