Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Fixpoint definition

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Fixpoint definition


Chronological Thread 
  • From: Michiel Helvensteijn <mhelvens AT gmail.com>
  • To: Pierre Casteran <pierre.casteran AT labri.fr>
  • Cc: Jacques-Henri Jourdan <jacques-henri.jourdan AT inria.fr>, coq-club <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] Fixpoint definition
  • Date: Mon, 15 Jul 2013 17:36:55 +0200

On Mon, Jul 15, 2013 at 5:33 PM, Pierre Casteran
<pierre.casteran AT labri.fr>
wrote:

> Definition test2 (p: nat * lst) :=
> match p with
> | (_, Nil) => 0
> | (_, (Cons l as l')) =>
> test l'
> end.
>
> Is this what you meant ?

I don't think this is what he means. I believe he meant to call
`test2` recursively. Then the function would be well-typed, but
ill-formed w.r.t. the principal argument.

(I don't have an answer yet.)

--
www.mhelvens.net



Archive powered by MHonArc 2.6.18.

Top of Page