package coq-fsets

  1. Overview
  2. No Docs
Finite Sets overs Ordered Types

Install

Dune Dependency

github.com Edit opam file Versions (6)

Authors

  1. P
    Pierre Letouzey
  2. J
    Jean-Christophe Filliâtre

Maintainers

  1. H
    Hugo.Herbelin@inria.fr

Sources

v8.8.0.tar.gz
md5=3beb91c5796f5255db8ad25588aa3fea

Description

This contribution contains several implementations of finite sets over arbitrary ordered types using functors. Currently, there are 3 implementations: sorted lists, red-black trees and AVLs.

Tags

keyword: finite sets keyword: sorted lists keyword: balanced trees keyword: red-black trees keyword: AVL keyword: functors keyword: data structures category: Computer Science/Data Types and Data Structures category: Miscellaneous/Extracted Programs/Data structures

Published: 06 Feb 2019

Dependencies (2)

  1. coq >= "8.8" & < "8.9~"
  2. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None