Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] How does Coq check subterms for recursions

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] How does Coq check subterms for recursions


chronological Thread 
  • From: Pierre Casteran <pierre.casteran AT labri.fr>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] How does Coq check subterms for recursions
  • Date: Mon, 12 Apr 2010 09:17:18 +0200

Le 12/04/2010 07:28, Jianzhou Zhao a écrit :

But (a1, a1') seems a subtern of (A2 a1, A2 a1')
to me, because a1 and a1' are subterms of
A2 a1 and A2 a1' respectively.

Thanks


If you  consider the terms   written without the usual  notation: i.e.
(pair (A2 a1) (A2 a1')) and (pair a1 a1') , you notice that the second one is not a subtree of the first one (because of the A2's between the root and the terms a1 and a1' )

Pierre






Archive powered by MhonArc 2.6.16.

Top of Page