package coq-stdpp

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

Install

Dune Dependency

Authors

Maintainers

Sources

coq-stdpp-1.9.0.tar.gz
sha512=c0a330a112a60734229d43c8ea471e1ed2ac628a0fa035dbe26c2aa867add118b109317823859b99d14ba29804528beb9f3f35753d9dd365bb5c3378dc062fc4

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:2023-10-11 logpath:stdpp

Published: 11 Oct 2023

Dependencies

None

Dev Dependencies (1)

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

Used by (2)

  1. coq-iris = "4.1.0"
  2. coq-vlsm >= "1.3"

Conflicts

None

Rocq

Interactive Theorem Prover