Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Is Coq SN ?

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Is Coq SN ?


Chronological Thread 
  • From: Eddy Westbrook <westbrook AT kestrel.edu>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Is Coq SN ?
  • Date: Tue, 1 Mar 2016 13:08:31 -0800
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=westbrook AT kestrel.edu; spf=None smtp.mailfrom=westbrook AT kestrel.edu; spf=None smtp.helo=postmaster AT mail.kestrel.edu
  • Ironport-phdr: 9a23:dJGLohX4u+65F6Jy9z0R3IsQO5vV8LGtZVwlr6E/grcLSJyIuqrYZhCGt8tkgFKBZ4jH8fUM07OQ6PC/HzNYqs/d6TgrS99laVwssY0uhQsuAcqIWwXQDcXBSGgEJvlET0Jv5HqhMEJYS47UblzWpWCuv3ZJQk2sfTR8Kum9IIPOlcP/j7n0oM2MJVoQz2PhOPtbF1afk0b4joEum4xsK6I8mFPig0BjXKBo/15uPk+ZhB3m5829r9ZJ+iVUvO89pYYbCf2pN/dwcbsNBzM/dmsx+cfDtB/ZTALJ6GFPfH8Rl09lDwTUpC73RYv7qCz9taIpxySBIcfsSrc3cTev9LtxRRuuhSsaYW1quFrLg9B92foI6CmqoAZyltbZ

Bas,

Unfortunately, the 2011 technical report you cited of mine has some flaws in
the proof. (Thanks to some of the members of this list that pointed them out
in the past!) However, I am actually in the middle of trying to formalize a
revised version of my proof in Coq itself.

One thing I have so far is what I think is a pretty general formalization of
Coq. (I did look at the Coq in Coq project, but I think my approach is more
general.) I define a term language, including all the universes of Coq, with
an extensible notion of “operations” that are meant to capture inductive
types, constructors, and recursors, as well as axioms like proof irrelevance,
functional extensionality, etc., that I want to have interpretations in my
model. I have done all the work for subject reduction, including a proof of
confluence using superdevelopments (the operations are required to preserve
superdevelopments). If anyone is interested, I can definitely share this. I
would very much like some feedback on it.

Otherwise, I am still in the middle of building a model for this
formalization — I am going to do the consistency proof first, and then extend
it to SN — but if you or anyone else on the list is interested in seeing what
I have so far, I would be happy to share it as well. I also have an updated
write-up that sketches the ideas I am trying to use in my model construction.
Again, the proof is not finished, so my approach could of course be flawed,
but I am happy to share it as well, and would very much appreciate any
feedback on it.

-Eddy

On Feb 28, 2016, at 10:15 AM, Bas Spitters
<b.a.w.spitters AT gmail.com>
wrote:

> Is Coq strongly normalizing?
>
>
> The *implementation* of Coq is (or was) not SN. The issue is recorded
> here, I believe.
> https://coq.inria.fr/cocorico/CoqTerminationDiscussion
>
> I am not sure whether this has been fully fixed yet.
>
>
> The Coq manual is incomplete, as it refers to Coquand's work on CoC
> for the SN proof of CIC, which can't be strictly right.
> https://coq.inria.fr/refman/Reference-Manual006.html
> I haven't chased the references yet, but this paper claims the result for
> CIC:
> https://www.cs.rice.edu/research/technical-reports/TR11-01/
>
> Does this seem correct? It would be probably be good to document this
> properly (in the FAQ, ref manual?).
>
> Bas



  • Re: [Coq-Club] Is Coq SN ?, Frédéric Blanqui, 03/01/2016
    • <Possible follow-up(s)>
    • Re: [Coq-Club] Is Coq SN ?, Eddy Westbrook, 03/01/2016

Archive powered by MHonArc 2.6.18.

Top of Page