(2020-07-24 01:10:59 UTC)
# Packages matching: installed
# Name # Installed # Synopsis
base-bigarray base
base-num base Num library distributed with the OCaml compiler
base-threads base
base-unix base
conf-findutils 1 Virtual package relying on findutils
conf-m4 1 Virtual package relying on m4
coq 8.11.dev Formal proof management system
num 0 The Num library for arbitrary-precision integer and rational arithmetic
ocaml 4.05.0 The OCaml compiler (virtual package)
ocaml-base-compiler 4.05.0 Official 4.05.0 release
ocaml-config 1 OCaml Switch Configuration
ocamlfind 1.8.1 A library manager for OCaml
# opam file:
opam-version: "2.0"
maintainer: "frederic.blanqui@inria.fr"
homepage: "http://color.inria.fr/"
license: "CeCILL"
build: [
[make "-j%{jobs}%"]
]
install: [make "-f" "Makefile.coq" "install"]
depends: [
"ocaml"
"coq" {>= "8.5" & < "8.6~"}
]
authors: [
"Frédéric Blanqui"
"Adam Koprowski"
"Sébastien Hinderer"
"Pierre-Yves Strub"
"Sidi Ould Biha"
"Solange Coupet-Grimal"
"William Delobel"
"Hans Zantema"
"Stéphane Leroux"
"Léo Ducas"
"Johannes Waldmann"
"Qiand Wang"
"Lianyi Zhang"
"Sorin Stratulat"
]
tags: [
"keyword:rewriting"
"keyword:termination"
"keyword:lambda calculus"
"keyword:list"
"keyword:multiset"
"keyword:polynom"
"keyword:vectors"
"keyword:matrices"
"keyword:FSet"
"keyword:FMap"
"keyword:term"
"keyword:context"
"keyword:substitution"
"keyword:universal algebra"
"keyword:varyadic term"
"keyword:string"
"keyword:alpha-equivalence"
"keyword:de bruijn indices"
"keyword:simple types"
"keyword:matching"
"keyword:unification"
"keyword:relation"
"keyword:ordering"
"keyword:quasi-ordering"
"keyword:lexicographic ordering"
"keyword:ring"
"keyword:semiring"
"keyword:well-founded"
"keyword:noetherian"
"keyword:finitely branching"
"keyword:dependent choice"
"keyword:infinite sequences"
"keyword:non-termination"
"keyword:loop"
"keyword:graph"
"keyword:path"
"keyword:transitive closure"
"keyword:strongly connected component"
"keyword:topological ordering"
"keyword:rpo"
"keyword:horpo"
"keyword:dependency pair"
"keyword:dependency graph"
"keyword:semantic labeling"
"keyword:reducibility"
"keyword:Girard"
"keyword:fixpoint theorem"
"keyword:Tarski"
"keyword:pigeon-hole principle"
"keyword:Ramsey theorem"
"category:Computer Science/Algorithms/Correctness proofs of algorithms"
"category:Computer Science/Data Types and Data Structures"
"category:Computer Science/Lambda Calculi"
"category:Mathematics/Algebra"
"category:Mathematics/Combinatorics and Graph Theory"
"category:Mathematics/Logic/Type theory"
"category:Miscellaneous/Extracted Programs/Type checking unification and normalization"
"date:2016-01-26"
"logpath:CoLoR"
]
synopsis: "A library on rewriting theory and termination"
url {
src:
"https://gforge.inria.fr/frs/download.php/file/35820/color.1.2.0.tar.gz"
checksum: "md5=3e1541cc57beec0790667ef49bee66ce"
}
trueDry install with the current Coq version:
opam install -y --show-action coq-color.1.2.0 coq.8.11.dev[NOTE] Package coq is already installed (current version is 8.11.dev).
The following dependencies couldn't be met:
- coq-color -> coq < 8.6~ -> ocaml < 4.05.0
base of this switch (use `--unlock-base' to force)
Your request can't be satisfied:
- No available version of coq satisfies the constraints
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-color.1.2.0truetrueNo files were installed.
true