package coq-stdpp

  1. Overview
  2. Homepage
An extended "Standard Library" for Coq

Install

Dune Dependency

Authors

Maintainers

Sources

coq-stdpp-1.8.0.tar.gz
sha512=c894cc0574ab00efa41c807628f97abdeff917bee71b40e2f98251bcdc91ebfb7a2964683e61e7cefbe6e578b2e123098ddd7694252406f8c4835176c1d0df37

Description

The key features of this library are as follows:

  • It provides a great number of definitions and lemmas for common data structures such as lists, finite maps, finite sets, and finite multisets.
  • It uses type classes for common notations (like , , and Haskell-style monad notations) so that these can be overloaded for different data structures.
  • It uses type classes to keep track of common properties of types, like it having decidable equality or being countable or finite.
  • Most data structures are represented in canonical ways so that Leibniz equality can be used as much as possible (for example, for maps we have m1 = m2 iff ∀ i, m1 !! i = m2 !! i). On top of that, the library provides setoid instances for most types and operations.
  • It provides various tactics for common tasks, like an ssreflect inspired done tactic for finishing trivial goals, a simple breadth-first solver naive_solver, an equality simplifier simplify_eq, a solver solve_proper for proving compatibility of functions with respect to relations, and a solver set_solver for goals involving set operations.
  • It is entirely dependency- and axiom-free.

Tags

date:2022-08-17 logpath:stdpp

Published: 18 Aug 2022

Dependencies

None

Dev Dependencies (1)

  1. coq (>= "8.13" & < "8.19~") | (= "dev")

Used by (1)

  1. coq-iris = "4.0.0"

Conflicts

None

Rocq

Interactive Theorem Prover