We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
toExpr
1 parent 3b55ae4 commit f2b6c24Copy full SHA for f2b6c24
posts/how-to-write-a-simproc.md
@@ -245,7 +245,7 @@ dsimproc_decl revRangeCompute (revRange _) := fun e => do
245
**Cons**:
246
* The expression to be evaluated is traversed twice: Once to create its evaluation, then once more in the typechecking of the proof by `rfl`.
247
* The produced `rfl` proof could be heavy.
248
-* Only works when the evaluation is definitionally equal to to the original expression.
+* Only works when the evaluation and conversion back to an expression is definitionally equal to to the original expression.
249
250
## The propositional approach
251
0 commit comments