(2021-04-16 14:57:06 UTC)
# Packages matching: installed # Name # Installed # Synopsis base-bigarray base base-threads base base-unix base conf-findutils 1 Virtual package relying on findutils coq 8.12.1 Formal proof management system num 1.4 The legacy Num library for arbitrary-precision integer and rational arithmetic ocaml 4.10.1 The OCaml compiler (virtual package) ocaml-base-compiler 4.10.1 Official release 4.10.1 ocaml-config 1 OCaml Switch Configuration ocamlfind 1.9.1 A library manager for OCaml # opam file: opam-version: "2.0" name: "coq-stdpp" maintainer: "Ralf Jung <jung@mpi-sws.org>" homepage: "https://gitlab.mpi-sws.org/iris/stdpp" authors: "Robbert Krebbers, Jacques-Henri Jourdan, Ralf Jung" bug-reports: "https://gitlab.mpi-sws.org/iris/stdpp/issues" license: "BSD" dev-repo: "git+https://gitlab.mpi-sws.org/iris/stdpp.git" build: [make "-j%{jobs}%"] install: [make "install"] depends: [ "coq" {(>= "8.7" & < "8.10~") | (= "dev")} ] synopsis: "This project contains an extended \"Standard Library\" for Coq called coq-std++" 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.""" url { src: "https://gitlab.mpi-sws.org/iris/stdpp/repository/coq-stdpp-1.2.0/archive.tar.gz" checksum: "md5=5aee0ec3ff9bb8bbdbf5a5d54d0d7670" }
true
Dry install with the current Coq version:
opam install -y --show-action coq-stdpp.1.2.0 coq.8.12.1
[NOTE] Package coq is already installed (current version is 8.12.1). The following dependencies couldn't be met: - coq-stdpp -> coq (< 8.10~ & = dev) -> ocaml < 4.10 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.2.0
true
true
No files were installed.
true