coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: vsiles AT lix.polytechnique.fr
- To: "Ashish Darbari" <ashish AT darbari.org>
- Cc: "muad" <muad.dib.space AT gmail.com>, coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] Defining recursive functions
- Date: Fri, 2 Jan 2009 10:09:12 +0100 (CET)
- Importance: Normal
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Happy new year !
> The problem I really had was being unable to
> specify the measure function such that it can be called in snarf, the
> idea of specifying lsum on a product as opposed to currying was
> the key for me. I ended up using Function this morning although
> Program Fixpoint works out as well.
If you really want to use a measure on the lists length, there's a little
trick I sometimes do to avoid defining complicated measure : I mark the
list with their length (transform them in vector) , compute my function
and than erase the length information.
Your function signature will look like
forall n n1 n2:nat, n=n1+n2 -> ... where list Z is replaced by vector ni Z
Writing the 'n=n1+n2' proofs in the Function can be annoying but along
with Program, it because really easy.
Cheers,
Vincent
- Re: [Coq-Club] Defining recursive functions, Taral
- Re: [Coq-Club] Defining recursive functions, Matthieu Sozeau
- Re: [Coq-Club] Defining recursive functions, Julien Forest
- <Possible follow-ups>
- Re: [Coq-Club] Defining recursive functions,
muad
- Re: [Coq-Club] Defining recursive functions, Ashish Darbari
- Re: [Coq-Club] Defining recursive functions, vsiles
Archive powered by MhonArc 2.6.16.