# Packages matching: installed
# Name # Installed # Synopsis
base-bigarray base
base-threads base
base-unix base
conf-findutils 1 Virtual package relying on findutils
conf-m4 1 Virtual package relying on m4
coq 8.10.0 Formal proof management system
num 1.3 The legacy Num library for arbitrary-precision integer and rational arithmetic
ocaml 4.09.1 The OCaml compiler (virtual package)
ocaml-base-compiler 4.09.1 Official release 4.09.1
ocaml-config 1 OCaml Switch Configuration
ocamlfind 1.8.1 A library manager for OCaml
# opam file:
opam-version: "2.0"
maintainer: "dev@clarus.me"
homepage: "https://github.com/coq-contribs/higman-s"
license: "LGPL"
build: [
["coq_makefile" "-f" "Make" "-o" "Makefile"]
[make "-j%{jobs}%"]
]
install: [make "install"]
remove: ["rm" "-R" "%{lib}%/coq/user-contrib/HigmanS"]
depends: [
"ocaml"
"coq" {= "dev"}
]
tags: [ "keyword:higman's lemma" "keyword:well quasi ordering" "category:Mathematics/Combinatorics and Graph Theory" "date:2007-09-14" ]
authors: [ "William Delobel <william.delobel@lif.univ-mrs.fr>" ]
synopsis: "Higman's lemma on an unrestricted alphabet."
description:
"This proof is more or less the proof given by Monika Seisenberger in \"An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma\"."
flags: light-uninstall
url {
src: "git+https://github.com/coq-contribs/higman-s.git#master"
}
trueDry install with the current Coq version:
opam install -y --show-action coq-higman-s.dev coq.8.10.0[NOTE] Package coq is already installed (current version is 8.10.0). The following dependencies couldn't be met: - coq-higman-s -> coq >= dev 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-higman-s.devtruetrueNo files were installed.
true