# Packages matching: installed # Name # Installed # Synopsis base-bigarray base base-threads base base-unix base conf-gmp 4 Virtual package relying on a GMP lib system installation coq 8.18.0 The Coq Proof Assistant coq-core 8.18.0 The Coq Proof Assistant -- Core Binaries and Tools coq-stdlib 8.18.0 The Coq Proof Assistant -- Standard Library coqide-server 8.18.0 The Coq Proof Assistant, XML protocol server dune 3.13.0 Fast, portable, and opinionated build system ocaml 4.14.0 The OCaml compiler (virtual package) ocaml-base-compiler 4.14.0 Official release 4.14.0 ocaml-config 2 OCaml Switch Configuration ocaml-options-vanilla 1 Ensure that OCaml is compiled with no special options enabled ocamlfind 1.9.6 A library manager for OCaml zarith 1.13 Implements arithmetic and logical operations over arbitrary-precision integers # 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:2022-01-22" "logpath:stdpp" ] depends: [ "coq" { (>= "8.11" & < "8.17~") | (= "dev") } ] build: [make "-j%{jobs}%"] install: [make "install"] url { src: "https://gitlab.mpi-sws.org/iris/stdpp/-/archive/coq-stdpp-1.7.0.tar.gz" checksum: "sha512=c47b049f0bc9dc0132352901098458c9a50259e91f9d39dec2cbdce74d602f3a5224dd41af228152513dea3895052eab673fc094ff4092f65a006c4bbe124694" }
true
Dry install with the current Coq version:
opam install -y --show-action coq-stdpp.1.7.0 coq.8.18.0
[NOTE] Package coq is already installed (current version is 8.18.0). The following dependencies couldn't be met: - coq-stdpp -> coq (< 8.17~ & = dev) -> ocaml < 4.12 base of this switch (use `--unlock-base' to force) Your request can't be satisfied: - No available version of coq satisfies the constraints 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.7.0
true
true
No files were installed.
true