« Up

tlc 20171206 Not compatible 👼

Context

# Packages matching: installed
# Name                # Installed # Synopsis
base-bigarray         base
base-threads          base
base-unix             base
conf-findutils        1           Virtual package relying on findutils
conf-gmp              4           Virtual package relying on a GMP lib system installation
coq                   8.13.0      Formal proof management system
num                   1.4         The legacy Num library for arbitrary-precision integer and rational arithmetic
ocaml                 4.12.1      The OCaml compiler (virtual package)
ocaml-base-compiler   4.12.1      Official release 4.12.1
ocaml-config          2           OCaml Switch Configuration
ocaml-options-vanilla 1           Ensure that OCaml is compiled with no special options enabled
ocamlfind             1.9.5       A library manager for OCaml
zarith                1.12        Implements arithmetic and logical operations over arbitrary-precision integers
# opam file:
opam-version: "2.0"
maintainer: "francois.pottier@inria.fr"
authors: [
  "Arthur Charguéraud <arthur.chargueraud@inria.fr>"
]
homepage: "https://gitlab.inria.fr/charguer/tlc"
dev-repo: "git+https://gitlab.inria.fr/charguer/tlc.git"
bug-reports: "tlc-users@lists.gforge.inria.fr"
license: "CeCILL-B"
build: [
  [make "-j%{jobs}%"]
]
install: [
  [make "install"]
]
depends: [
  "ocaml"
  "coq" {>= "8.6" & < "8.10~"}
]
synopsis: "A general-purpose alternative to Coq's standard library"
description: """
TLC relies on the axioms of functional extensionality, propositional
extensionality, and indefinite description (also known as Hilbert's epsilon
operator). The consequences of these axioms include the law of the excluded
middle as well as proof irrelevance. Accepting these axioms often makes life
significantly simpler.
TLC takes advantage of Coq's type class mechanism. In particular, this allows
for common operators and lemma names for all container data structures and all
order relations.
TLC includes the optimal fixed point combinator, which allows
arbitrarily-complex recursive and co-recursive definitions.
TLC provides a collection of tactics that enhance the default tactics provided
by Coq. These tactics help construct more concise and more robust proof
scripts."""
url {
  src: "https://github.com/charguer/tlc/archive/refs/tags/20171206.tar.gz"
  checksum: "md5=ae684eebe7035e5b03bd2ca9fb64ee8a"
}

Lint

Command
true
Return code
0

Dry install 🏜️

Dry install with the current Coq version:

Command
opam install -y --show-action coq-tlc.20171206 coq.8.13.0
Return code
5120
Output
[NOTE] Package coq is already installed (current version is 8.13.0).
The following dependencies couldn't be met:
  - coq-tlc -> coq < 8.10~ -> ocaml < 4.10
      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:

Command
opam remove -y coq; opam install -y --show-action --unlock-base coq-tlc.20171206
Return code
0

Install dependencies

Command
true
Return code
0
Duration
0 s

Install 🚀

Command
true
Return code
0
Duration
0 s

Installation size

No files were installed.

Uninstall 🧹

Command
true
Return code
0
Missing removes
none
Wrong removes
none