因此,我正在阅读这篇关于精心思考()的论文,并决定尝试这种策略(见第5.2节):
mush : Elab ()
mush =
do attack
x <- gensym "x"
intro x
try intros
induction (Var x) `andThen` auto
solve
据推测,这种策略可以证明加法的相联性:
plusAssoc : (j, k, l : Nat) -> plus (plus j k) l = plus j (plus k l)
plusAssoc = %runE
我写了这段代码: HTML
<p>
Once upon a time there was a man
who lived in a pizza parlor. This
man just loved pizza and ate it all
the time. He went on to be the
happiest man in the world. The end.
</p>
联署材料:
var words = $("p:first").text().split(" ");
var tex