Skip to Content.
Sympa Menu

coq-club - [Coq-Club] Coq'Art questions (Page 101)

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

[Coq-Club] Coq'Art questions (Page 101)


Chronological Thread 
  • From: Yasuaki Kudo <yasu AT yasuaki.com>
  • To: "coq-club AT inria.fr " <coq-club AT inria.fr>
  • Subject: [Coq-Club] Coq'Art questions (Page 101)
  • Date: Fri, 20 Nov 2015 19:17:17 +0900
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=yasu AT yasuaki.com; spf=None smtp.mailfrom=yasu AT yasuaki.com; spf=None smtp.helo=postmaster AT mail1.g12.pair.com
  • Importance: normal
  • Ironport-phdr: 9a23:9PJAXBfU8Q0dW6X7ICTJYVchlGMj4u6mDksu8pMizoh2WeGdxc68bB7h7PlgxGXEQZ/co6odzbGG7ua+BSdZuszJmUtBWaIPfidNsd8RkQ0kDZzNImzAB9muURYHGt9fXkRu5XCxPBsdMs//Y1rPvi/6tmZKSV3BPAZ4bt74BpTVx5zukbviptuNP04R32D1SIgxBSv1hD2ZjtMRj4pmJ/R54TryiVwMRd5rw3h1L0mYhRf265T41pdi9yNNp6BprJYYAu3MWaMZYfQYVWxnYCgJ45ihvh7aCACL+3E0U2MMkxMODRKNplmuVZDo9yD+q+BV2S+APMSwQ6piChq46KI+eRbzlS4ENnYa7W3QwphhhblGiAOovAF2wI+Sa4aQYqktNpjBdM8XEDISFv1aUDZMV9rkYg==

Hi,

 

I have a question regarding the section of Existential Quantification on Page 101 of Interactive Theorem Proving and Program Development (Coq’Art)

 

I hope this is not too nitpicking but because I am self-studying, I want to ensure that I understand the foundation correctly.

 

On Page 78 (4.1.1.6), the book says:

Types for the logical connectives and operator like prod are constructed thanks to the following rule, yet another extension of Prod.  The types that are formed in this way are called higher-order types.

 

 

E, G |-  A:Type

E, G |-  B:Type

------------------------------------------ Prod-sup

E, G |-  A->B : Type

 

 

On Page 101 (4.3.5.1):

The type of the constant ex has the sort Type; the formation of this type is summarized by the following sequence of judgements (only the third and the forth ones use the rule for building higher-order types):

 

[A:Type] |- Prop : Type

[A:Type] |- A-> Prop : Type

[A:Type] |- (A -> Prop) -> Prop : Type

|- A:Type, (A -> Prop) -> Prop : Type

 

On contrary to the note in parenthesis (only the third and the forth…), it seems that the second example IS an example of the formation above where the first argument is A and the second being B?   Am I wrong?

 

In addition, what does Prod-sup mean?  I have seen terms like dependent product in the book but I don’t know what product means.

 

Regards,

Yasuaki

Tokyo




Archive powered by MHonArc 2.6.18.

Top of Page