coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Lionel Elie Mamane <lionel AT mamane.lu>
- To: Benjamin Werner <benjamin.werner AT inria.fr>
- Cc: coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] Recursive functions
- Date: Fri, 29 Nov 2002 16:29:29 +0100
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Hi,
On Wed, Nov 27, 2002 at 01:21:48PM +0100, Benjamin Werner wrote:
>> I'm trying to define a function of the following shape
>> f (Tcons a) (Tcons b) = g (f a (Tcons b)) (f (Tcons a) b)
> Your function seems to have a form similar to Ackermann's function.
> all you have to do is use two embeded fixpoints.
Yes, works fine. Thanks. I could swear I had tried this (I had found
the example of the Ackermann function in the archives), but
failed. Somehow looking at it again made it work :-)
What's bugging me is that in my case, the lemma's "the function
satisfies to the (simple) equation defining it" are not "Trivial", but
maybe I just did a typing error that will spring in my face on
Monday, that makes those lemma's false for now.
--
Lionel
Attachment:
pgpFNuBD0QNxo.pgp
Description: PGP signature
- [Coq-Club] Recursive functions, Lionel Elie Mamane
- Re: [Coq-Club] Recursive functions,
Benjamin Werner
- Re: [Coq-Club] Recursive functions, Lionel Elie Mamane
- Re: [Coq-Club] Recursive functions,
Benjamin Werner
Archive powered by MhonArc 2.6.16.