# Packages matching: installed # Name # Installed # Synopsis base-bigarray base base-num base Num library distributed with the OCaml compiler base-ocamlbuild base OCamlbuild binary and libraries distributed with the OCaml compiler base-threads base base-unix base camlp5 7.14 Preprocessor-pretty-printer of OCaml conf-findutils 1 Virtual package relying on findutils conf-perl 2 Virtual package relying on perl coq 8.9.1 Formal proof management system num 0 The Num library for arbitrary-precision integer and rational arithmetic ocaml 4.02.3 The OCaml compiler (virtual package) ocaml-base-compiler 4.02.3 Official 4.02.3 release ocaml-config 1 OCaml Switch Configuration ocamlfind 1.9.6 A library manager for OCaml # opam file: opam-version: "2.0" maintainer: "Ralf Jung <jung@mpi-sws.org>" authors: "The std++ team" license: "BSD-3-Clause" homepage: "https://gitlab.mpi-sws.org/iris/stdpp" bug-reports: "https://gitlab.mpi-sws.org/iris/stdpp/issues" dev-repo: "git+https://gitlab.mpi-sws.org/iris/stdpp.git" synopsis: "An extended \"Standard Library\" for Coq" 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" ] depends: [ "coq" { (>= "8.16" & < "8.19~") | (= "dev") } ] build: ["./make-package" "stdpp" "-j%{jobs}%"] install: ["./make-package" "stdpp" "install"] url { src: "https://gitlab.mpi-sws.org/iris/stdpp/-/archive/coq-stdpp-1.9.0.tar.gz" checksum: "sha512=c0a330a112a60734229d43c8ea471e1ed2ac628a0fa035dbe26c2aa867add118b109317823859b99d14ba29804528beb9f3f35753d9dd365bb5c3378dc062fc4" }
true
Dry install with the current Coq version:
opam install -y --show-action coq-stdpp.1.9.0 coq.8.9.1
[NOTE] Package coq is already installed (current version is 8.9.1). The following dependencies couldn't be met: - coq-stdpp -> coq >= dev -> ocaml >= 4.09.0 base of this switch (use `--unlock-base' to force) - coq-stdpp -> coq >= dev -> coq-core -> ocaml >= 4.09.0 base of this switch (use `--unlock-base' to force) No solution found, exiting
Dry install without Coq/switch base, to test if the problem was incompatibility with the current Coq/OCaml version:
opam remove -y coq; opam install -y --show-action --unlock-base coq-stdpp.1.9.0
true
true
No files were installed.
true