ยซ Up

higman-s 8.10.0 1 m 0 s ๐Ÿ†

Context

# 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.10.2      Formal proof management system
num                 1.4         The legacy Num library for arbitrary-precision integer and rational arithmetic
ocaml               4.08.1      The OCaml compiler (virtual package)
ocaml-base-compiler 4.08.1      Official release 4.08.1
ocaml-config        1           OCaml Switch Configuration
ocamlfind           1.9.3       A library manager for OCaml
# opam file:
opam-version: "2.0"
maintainer: "Hugo.Herbelin@inria.fr"
homepage: "https://github.com/coq-contribs/higman-s"
license: "LGPL"
build: [make "-j%{jobs}%"]
install: [make "install"]
remove: ["rm" "-R" "%{lib}%/coq/user-contrib/HigmanS"]
depends: [
  "ocaml"
  "coq" {>= "8.10" & < "8.11~"}
]
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>"
]
bug-reports: "https://github.com/coq-contribs/higman-s/issues"
dev-repo: "git+https://github.com/coq-contribs/higman-s.git"
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: "https://github.com/coq-contribs/higman-s/archive/v8.10.0.tar.gz"
  checksum: "md5=44d7e25236ce8c3780391c0de4aef75f"
}

Lint

Command
true
Return code
0

Dry install ๐Ÿœ๏ธ

Dry install with the current Coq version:

Command
opam install -y --show-action coq-higman-s.8.10.0 coq.8.10.2
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

Install dependencies

Command
opam list; echo; ulimit -Sv 4000000; timeout 4h opam install -y --deps-only coq-higman-s.8.10.0 coq.8.10.2
Return code
0
Duration
1 m 0 s

Install ๐Ÿš€

Command
opam list; echo; ulimit -Sv 16000000; timeout 4h opam install -y -v coq-higman-s.8.10.0 coq.8.10.2
Return code
0
Duration
1 m 0 s

Installation size

Total: 633 K

  • 206 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/higman_aux.vo
  • 115 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/higman.vo
  • 93 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/higman_aux.glob
  • 43 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/tree.vo
  • 39 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/list_embeding.vo
  • 33 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/higman.glob
  • 23 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/inductive_wqo.vo
  • 19 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/higman_aux.v
  • 18 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/list_embeding.glob
  • 14 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/tree.glob
  • 10 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/higman.v
  • 7 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/inductive_wqo.glob
  • 5 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/list_embeding.v
  • 5 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/tree.v
  • 2 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/HigmanS/inductive_wqo.v

Uninstall ๐Ÿงน

Command
opam remove -y coq-higman-s.8.10.0
Return code
0
Missing removes
none
Wrong removes
none