Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] UIP and decidable equality

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] UIP and decidable equality


Chronological Thread 
  • From: Jonathan Leivent <jonikelee AT gmail.com>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] UIP and decidable equality
  • Date: Tue, 13 Sep 2016 11:51:32 -0400
  • Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None smtp.pra=jonikelee AT gmail.com; spf=Pass smtp.mailfrom=jonikelee AT gmail.com; spf=None smtp.helo=postmaster AT mail-qt0-f181.google.com
  • Ironport-phdr: 9a23:qAfHHh2rSkg47TmZsmDT+DRfVm0co7zxezQtwd8ZsesRLvad9pjvdHbS+e9qxAeQG96KsrQb06GH6OigATVGusnR9ihaMdRlbFwst4Y/p0QYGsmLCEn2frbBThcRO4B8bmJj5GyxKkNPGczzNBX4q3y26iMOSF2kbVImbre9JomHhMOukuu25pf7YgNShTP7b6khAg+xqFDzsc8fnYtrLO4VxxrXr31UM7BUwmVpJl+XkhvU6cK5/Zol+CNV7aFyv/VcWLn3KvxrBYdTCy4rZjg4



On 09/12/2016 06:52 PM, Thorsten Altenkirch wrote:
Yes, indeed. Functions without extensionality are like bread without butter.
:-)

Thorsten


All that is really needed is a very weak form of functional extensionality, applying only to functions from negated equalities to False:

Axiom neq_False_extensionality : forall A (a b :A)(f g : (a<>b) -> False), (forall p:(a<>b), f p = g p) -> f = g.

By operating only on Prop functions, this seems to avoid at least one criticism of functional extensionality in Coq - that it can interfere with the preservation of properties like complexity between extracted code and the original Coq source.

-- Jonathan




Archive powered by MHonArc 2.6.18.

Top of Page