« Up

founify 8.7.0 1 m 0 s 🏆

Context

# Packages matching: installed
# Name              # Installed # Synopsis
base-bigarray       base
base-threads        base
base-unix           base
camlp5              7.14        Preprocessor-pretty-printer of OCaml
conf-findutils      1           Virtual package relying on findutils
conf-perl           2           Virtual package relying on perl
coq                 8.7.0       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/founify"
license: "Unknown"
build: [make "-j%{jobs}%"]
install: [make "install"]
remove: ["rm" "-R" "%{lib}%/coq/user-contrib/FOUnify"]
depends: [
  "ocaml"
  "coq" {>= "8.7" & < "8.8~"}
]
tags: [ "keyword: First-order Unification" "keyword: Robinson" "category: Computer Science/Decision Procedures and Certified Algorithms/Correctness proofs of algorithms" "category: Miscellaneous/Extracted Programs/Type checking unification and normalization" ]
authors: [ "Jocelyne Rouyer" ]
bug-reports: "https://github.com/coq-contribs/founify/issues"
dev-repo: "git+https://github.com/coq-contribs/founify.git"
synopsis: "Correctness and extraction of the unification algorithm"
description: """
A notion of terms based on symbols without fixed arities is defined
and an extended unification problem is proved solvable on these terms.
An algorithm, close from Robinson algorithm, can be extracted from the
proof."""
flags: light-uninstall
url {
  src: "https://github.com/coq-contribs/founify/archive/v8.7.0.tar.gz"
  checksum: "md5=9603288fc943f869999b73fb04f34604"
}

Lint

Command: true
Return code: 0

Dry install 🏜️

Dry install with the current Coq version:

Command: opam install -y --show-action coq-founify.8.7.0 coq.8.7.0
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-founify.8.7.0 coq.8.7.0
Return code: 0
Duration: 1 m 0 s

Install 🚀

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

Installation size

Total: 721 K

192 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/term_unif.glob
149 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/term_unif.vo
78 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/term_unif.v
67 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/nat_term_eq_quasiterm.vo
49 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/nat_term_eq_quasiterm.glob
42 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/is_in_quasiterm_term_subst.vo
35 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/listv_is_in_lv.vo
31 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/nat_complements.vo
18 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/is_in_quasiterm_term_subst.glob
17 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/nat_term_eq_quasiterm.v
11 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/nat_complements.glob
10 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/listv_is_in_lv.glob
8 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/is_in_quasiterm_term_subst.v
7 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/nat_complements.v
6 K ../ocaml-base-compiler.4.08.1/lib/coq/user-contrib/FOUnify/listv_is_in_lv.v

Uninstall 🧹

Command: opam remove -y coq-founify.8.7.0
Return code: 0
Missing removes: none
Wrong removes: none