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.
1 parent c115d99 commit 481c728Copy full SHA for 481c728
src/Tactics.lidr
@@ -1023,6 +1023,10 @@ Now suppose that we want to convince Idris of the (rather obvious) fact that
1023
the proofs we did with \idr{sillyfun} above, it is natural to start the proof
1024
like this:
1025
1026
+\todo[inline]{Make this \idr{total}, or at least describe why it's not in its
1027
+current implementation. Should we introduce \idr{Decidable.Equality} here?}
1028
+
1029
+> partial
1030
> sillyfun1_odd : (n : Nat) -> sillyfun1 n = True -> oddb n = True
1031
> sillyfun1_odd n prf with (beq_nat n 3)
1032
> sillyfun1_odd (S (S (S Z))) Refl | True = Refl
0 commit comments