coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] totality and consistency

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

[Coq-Club] totality and consistency, Kirill Taran, 02/08/2014
- Re: [Coq-Club] totality and consistency, Guillaume Melquiond, 02/08/2014
  - Re: [Coq-Club] totality and consistency, Kirill Taran, 02/08/2014
  - Re: [Coq-Club] totality and consistency, Frédéric Blanqui, 02/10/2014
    - Re: [Coq-Club] totality and consistency, Arnaud Spiwack, 02/10/2014
      - Re: [Coq-Club] totality and consistency, Kirill Taran, 02/10/2014
        
        Re: [Coq-Club] totality and consistency, Matthieu Sozeau, 02/10/2014
        
        Re: [Coq-Club] totality and consistency, Arnaud Spiwack, 02/10/2014
        
        Re: [Coq-Club] totality and consistency, Greg Morrisett, 02/10/2014
        Re: [Coq-Club] totality and consistency, Guillaume Melquiond, 02/10/2014
        Re: [Coq-Club] totality and consistency, Kirill Taran, 02/11/2014
        Re: [Coq-Club] totality and consistency, Greg Morrisett, 02/12/2014