Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] A fast "eq" predicate for Gallina?

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] A fast "eq" predicate for Gallina?


Chronological Thread 
  • From: Sylvain Boulmé <Sylvain.Boulme AT univ-grenoble-alpes.fr>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] A fast "eq" predicate for Gallina?
  • Date: Wed, 20 Jan 2021 21:16:08 +0100
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=Sylvain.Boulme AT univ-grenoble-alpes.fr; spf=Pass smtp.mailfrom=Sylvain.Boulme AT univ-grenoble-alpes.fr; spf=None smtp.helo=postmaster AT zm-mta-out-3.u-ga.fr



Le 20/01/2021 à 20:45, Adam Chlipala a écrit :

Also, if you really want good performance, why not verify a program in some deeply embedded language?  I've found performance predictability to be quite treacherous within normalization of Gallina terms.  I'd much rather generate a C program with a proof that it computes the answer I want.  Many potential target languages allow your proposed optimization to be /proved/ from first principles.

Alternatively, why not generate an OCaml program (using Coq extraction) that computes the answer ? This seems a much simpler approach.

Actually, this is exactly the approach taken in the paper given in my previous answer...

Sylvain.



Archive powered by MHonArc 2.6.19+.

Top of Page