Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Writing a recursive function that's not quite structurally recursive?

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Writing a recursive function that's not quite structurally recursive?


Chronological Thread 
  • From: Erik Silkensen <eriksilkensen AT gmail.com>
  • To: Chris Dams <chris.dams.nl AT gmail.com>
  • Cc: coq-club <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] Writing a recursive function that's not quite structurally recursive?
  • Date: Sat, 2 Nov 2013 03:09:56 -0400

Hi Chris,

Thanks for such a quick reply and for the pointer to well_founded_induction
lt_wf. Does this mean I should be using the Fix tactic? Or Function or
Program Fixpoint? I think I’m getting stuck on how syntactically it should
look for this basic example. Thanks again,

-Erik

On Nov 2, 2013, at 2:27 AM, Chris Dams
<chris.dams.nl AT gmail.com>
wrote:

> Dear Eric,
>
> Well, well-founded recursion is exactly what can help you define such a
> function. Try typing the following into coq.
>
> Require Import Arith.
> Check well_founded_induction lt_wf.
>
> The type of "well_founded_induction lt_wf" is basically what you seem to
> want.
>
> Good luck!
> Chris
>




Archive powered by MHonArc 2.6.18.

Top of Page