# 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.2 Formal proof management system
num 1.4 The legacy Num library for arbitrary-precision integer and rational arithmetic
ocaml 4.11.2 The OCaml compiler (virtual package)
ocaml-base-compiler 4.11.2 Official release 4.11.2
ocaml-config 1 OCaml Switch Configuration
ocamlfind 1.9.5 A library manager for OCaml
# opam file:
opam-version: "2.0"
maintainer: "Hugo.Herbelin@inria.fr"
homepage: "https://github.com/coq-contribs/ramsey"
license: "LGPL 2.1"
build: [make "-j%{jobs}%"]
install: [make "install"]
remove: ["rm" "-R" "%{lib}%/coq/user-contrib/Ramsey"]
depends: [
"ocaml"
"coq" {>= "8.6" & < "8.7~"}
]
tags: [
"keyword: dimension one Ramsey theorem"
"keyword: constructive mathematics"
"keyword: almost full sets"
"category: Mathematics/Logic"
"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.6.0.tar.gz"
checksum: "md5=821e0a1434876b9d3263cf18a3ede913"
}
trueDry install with the current Coq version:
opam install -y --show-action coq-ramsey.8.6.0 coq.8.12.2[NOTE] Package coq is already installed (current version is 8.12.2).
The following dependencies couldn't be met:
- coq-ramsey -> coq < 8.7~ -> ocaml < 4.06.0
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-ramsey.8.6.0truetrueNo files were installed.
true