* (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" maintainer: "Hugo.Herbelin@inria.fr" homepage: "https://github.com/coq-contribs/zfc" license: "LGPL 2.1" build: [make "-j%{jobs}%"] install: [make "install"] remove: ["rm" "-R" "%{lib}%/coq/user-contrib/ZFC"] depends: [ "ocaml" "coq" {>= "8.7" & < "8.8~"} ] tags: [ "keyword: Set Theory" "keyword: Zermelo-Fraenkel" "keyword: Calculus of Inductive Constructions" "category: Mathematics/Logic/Set theory" ] authors: [ "Benjamin Werner" ] bug-reports: "https://github.com/coq-contribs/zfc/issues" dev-repo: "git+https://github.com/coq-contribs/zfc.git" synopsis: "An encoding of Zermelo-Fraenkel Set Theory in Coq" description: """ The encoding of Zermelo-Fraenkel Set Theory is largely inspired by Peter Aczel's work dating back to the eighties. A type Ens is defined, which represents sets. Two predicates IN and EQ stand for membership and extensional equality between sets. The axioms of ZFC are then proved and thus appear as theorems in the development. A main motivation for this work is the comparison of the respective expressive power of Coq and ZFC. A non-computational type-theoretical axiom of choice is necessary to prove the replacement schemata and the set-theoretical AC. The main difference between this work and Peter Aczel's is that propositions are defined on the impredicative level Prop. Since the definition of Ens is, however, still unchanged, I also added most of Peter Aczel's definition. The main advantage of Aczel's approach is a more constructive vision of the existential quantifier (which gives the set-theoretical axiom of choice for free).""" flags: light-uninstall url { src: "https://github.com/coq-contribs/zfc/archive/v8.7.0.tar.gz" checksum: "md5=df3d5e558ec4b88676252dfb41500683" }

- Command
`ruby lint.rb released opam-coq-archive/released/packages/coq-zfc/coq-zfc.8.7.0`

- Return code
- 256
- Output
lint.rb:11:in `read': No such file or directory @ rb_sysopen - opam-coq-archive/released/packages/coq-zfc/coq-zfc.8.7.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