Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Eliminating equalities over dependent function types

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Eliminating equalities over dependent function types


Chronological Thread 
  • From: Hugo Herbelin <Hugo.Herbelin AT inria.fr>
  • To: Grant Jurgensen <mailing-lists.coq AT grant.jurgensen.dev>
  • Cc: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Eliminating equalities over dependent function types
  • Date: Wed, 3 Nov 2021 20:23:22 +0100
  • Ironport-hdrordr: A9a23:H6scUaOXeFHeicBcTvKjsMiBIKoaSvp037Dk7S9MoDhuA6ilfqeV7ZMmPH7P+VMssR4b8+xoVJPsfZqYz+8S3WBzB8bBYCDDsGusaK5l6I7l3SH4XxD5n9Q86U4DSclD4bTLZDAQsS+52njaLz9K+re6Gc6T6dvj8w==

Hi,

> For what its worth, the reason I first considered this property above is
> because it appeared necessary in order to prove the following fact
> concerning
> heterogeneous equalities:
>
> Theorem JMeq_f :
> forall A (B: A -> Type) (C: A -> Type) (f: forall a, B a) (g: forall a, C
> a),
> JMeq f g ->
> forall x, JMeq (f x) (g x).

This reminds me of Nicolas Oury's embedding of the extensional
Calculus of Inductive Constructions into the intensional one [1,2]. As
far as I can recollect, he convinced himself at some point that your
theorem was not provable and took it as an axiom.

Best,

Hugo Herbelin

[1] N. Oury, Extensionality in the Calculus of Constructions, TPHOLs'05
[2] N. Oury, Égalité et filtrage avec types dépendants dans le Calcul
des Constructions Inductives, PhD thesis, 2006.



Archive powered by MHonArc 2.6.19+.

Top of Page