* (2019-04-07 14:40:39 UTC)*

# Installed packages for system: base-bigarray base Bigarray library distributed with the OCaml compiler base-num base Num library distributed with the OCaml compiler base-threads base Threads library distributed with the OCaml compiler base-unix base Unix library distributed with the OCaml compiler camlp5 7.06 Preprocessor-pretty-printer of OCaml conf-m4 1 Virtual package relying on m4 coq 8.6.1 Formal proof management system. num 0 The Num library for arbitrary-precision integer and ration ocamlfind 1.8.0 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/robbertkrebbers/coq-stdpp" authors: "Robbert Krebbers, Jacques-Henri Jourdan, Ralf Jung" bug-reports: "https://gitlab.mpi-sws.org/robbertkrebbers/coq-stdpp/issues" license: "BSD" dev-repo: "git+https://gitlab.mpi-sws.org/robbertkrebbers/coq-stdpp.git" build: [make "-j%{jobs}%"] install: [make "install"] remove: ["rm" "-rf" "%{lib}%/coq/user-contrib/stdpp"] depends: [ "ocaml" "coq" {(>= "8.6" & < "8.9~") | (= "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.""" flags: light-uninstall url { src: "https://gitlab.mpi-sws.org/robbertkrebbers/coq-stdpp/repository/coq-stdpp-1.1.0/archive.tar.gz" checksum: "md5=2a24643f073f0975597dfbe6cbbc63e5" }

- Command
`ruby lint.rb released opam-coq-archive/released/packages/coq-stdpp/coq-stdpp.1.1.0`

- Return code
- 256
- Output
lint.rb:11:in `read': No such file or directory @ rb_sysopen - opam-coq-archive/released/packages/coq-stdpp/coq-stdpp.1.1.0/descr (Errno::ENOENT) from lint.rb:11:in `lint' from lint.rb:52:in `<main>'

Dry install with the current Coq version:

- Command
`true`

- Return code
- 0

Dry install without Coq/switch base, to test if the problem was incompatibility with the current Coq/OCaml version:

- Command
`true`

- Return code
- 0

- Command
`true`

- Return code
- 0
- Duration
- 0 s

- Command
`true`

- Return code
- 0
- Duration
- 0 s

No files were installed.

- Command
`true`

- Return code
- 0
- Missing removes
- none
- Wrong removes
- none