coq-club AT inria.fr

Subject: The Coq mailing list

List archive

[Coq-Club] totality and consistency

From: Kirill Taran <kirill.t256 AT gmail.com>
To: coq-club AT inria.fr
Subject: [Coq-Club] totality and consistency
Date: Sat, 8 Feb 2014 15:05:18 +0400

Hello,

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?

Sincerely,
Kirill Taran

[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