* (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: "matej.kosik@inria.fr" homepage: "https://github.com/coq-contribs/ramsey" license: "LGPL 2" build: [make "-j%{jobs}%"] install: [make "install"] remove: ["rm" "-R" "%{lib}%/coq/user-contrib/Ramsey"] depends: [ "ocaml" "coq" {>= "8.5" & < "8.6~"} ] tags: [ "keyword:dimension one ramsey theorem" "keyword:constructive mathematics" "keyword:almost full sets" "category:Mathematics/Combinatorics and Graph Theory" "category:Miscellaneous/Extracted Programs/Combinatorics" ] authors: [ "Marc Bezem <>" ] bug-reports: "https://github.com/coq-contribs/ramsey/issues" dev-repo: "git+https://github.com/coq-contribs/ramsey.git" synopsis: "Ramsey Theory" description: """ For dimension one, the Infinite Ramsey Theorem states that, for any subset A of the natural numbers nat, either A or nat\\A is infinite. This special case of the Pigeon Hole Principle is classically equivalent to: if A and B are both co-finite, then so is their intersection. None of these principles is constructively valid. In [VB] the notion of an almost full set is introduced, classically equivalent to co-finiteness, for which closure under finite intersection can be proved constructively. A is almost full if for every (strictly) increasing sequence f: nat -> nat there exists an x in nat such that f(x) in A. The notion of almost full and its closure under finite intersection are generalized to all finite dimensions, yielding constructive Ramsey Theorems. The proofs for dimension two and higher essentially use Brouwer's Bar Theorem. In the proof development below we strengthen the notion of almost full for dimension one in the following sense. A: nat -> Prop is called Y-full if for every (strictly) increasing sequence f: nat -> nat we have (A (f (Y f))). Here of course Y : (nat -> nat) -> nat. Given YA-full A and YB-full B we construct X from YA and YB such that the intersection of A and B is X-full. This is essentially [VB, Th. 5.4], but now it can be done without using axioms, using only inductive types. The generalization to higher dimensions will be much more difficult and is not pursued here.""" flags: light-uninstall url { src: "https://github.com/coq-contribs/ramsey/archive/v8.5.0.tar.gz" checksum: "md5=0cdb4da8829dffb56d5e6f9e36c6f4c1" }

- Command
`ruby lint.rb released opam-coq-archive/released/packages/coq-ramsey/coq-ramsey.8.5.0`

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