Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] totality and consistency

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] totality and consistency


Chronological Thread 
  • From: Guillaume Melquiond <guillaume.melquiond AT inria.fr>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] totality and consistency
  • Date: Sat, 08 Feb 2014 12:19:26 +0100

On 08/02/2014 12:05, Kirill Taran wrote:

Is it true that if we had possibility to write non-terminating programs
(suppose we don't use non-terminating term in types, so type check
terminates) then we would have possibility to prove everything?

Fixpoint f (x : unit) : False := f x.
Goal False. exact (f tt). Qed.

Best regards,

Guillaume



Archive powered by MHonArc 2.6.18.

Top of Page