Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] (Computationally) Efficient Finite Maps

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] (Computationally) Efficient Finite Maps


Chronological Thread 
  • From: Hugo Herbelin <Hugo.Herbelin AT inria.fr>
  • To: Andrew Appel <appel AT princeton.edu>
  • Cc: coq-club <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] (Computationally) Efficient Finite Maps
  • Date: Thu, 14 May 2020 19:55:17 +0200

For the record, Pierre Letouzey (main author of the FSets/FMaps
library with Jean-Christophe Filliâtre) has precisely updated last
week his "M" version of FMaps (https://github.com/letouzey/coq-mmaps),
with the plan to release it soon as an opam package.

Best,

Hugo

On Thu, May 14, 2020 at 12:46:38PM -0400, Andrew Appel wrote:
> The MSets interface of the Coq standard library factors the program from the
> proof, and may solve the problem that's being discussed here.
> It was intended as a replacement for FSets and FMaps.
> There had been a plan to make MMaps also (finite maps instead of sets), but
> unfortunately I don't think that was ever done.
>
> There are efficient implementations of MSets for AVL trees and Red-Black
> trees
> in the standard library.
>



Archive powered by MHonArc 2.6.18.

Top of Page