package coq-stdpp
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 solvernaive_solver
, an equality simplifiersimplify_eq
, a solversolve_proper
for proving compatibility of functions with respect to relations, and a solverset_solver
for goals involving set operations. - It is entirely dependency- and axiom-free.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page