coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Jasper Stein <J.Stein AT cs.ru.nl>
- To: Hugo Herbelin <hugo.herbelin AT inria.fr>
- Cc: Dan Synek <synek AT cs.kun.nl>, Coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] recursive ltacs
- Date: Tue, 14 Sep 2004 10:50:53 +0200
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Hello Hugo,
> Ltac Ct F :=
> match F with
> true => True
>
> | false => False
> | (andb ?f1 ?f2) => let c1 := Ct f1 with c2 := Ct f2 in constr:(and
> | c1 c2)
>
> end.
Aren't Ltac definitions supposed to return tactics? After all, True and
False are terms, not tactics.
Am I missing something?
Jasper
--
The problem with having an open mind is that people toss in garbage
- [Coq-Club] recursive ltacs, Dan Synek
- Re: [Coq-Club] recursive ltacs, Houda Anoun
- Re: [Coq-Club] recursive ltacs,
Hugo Herbelin
- Re: [Coq-Club] recursive ltacs, Jasper Stein
- Re: [Coq-Club] recursive ltacs, Hugo Herbelin
- Re: [Coq-Club] recursive ltacs, Hugo Herbelin
- Re: [Coq-Club] recursive ltacs, Jasper Stein
Archive powered by MhonArc 2.6.16.