« Up

tlc 20180316 Not compatible 👼

📅 (2021-12-16 03:29:46 UTC)

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                 3           Virtual package relying on a GMP lib system installation
coq                      dev         Formal proof management system
dune                     2.9.1       Fast, portable, and opinionated build system
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
ocaml-secondary-compiler 4.08.1-1    OCaml 4.08.1 Secondary Switch Compiler
ocamlfind                1.9.1       A library manager for OCaml
ocamlfind-secondary      1.9.1       Adds support for ocaml-secondary-compiler to ocamlfind
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"]
]
remove: [
  [make "uninstall"]
]
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/20180316.tar.gz"
  checksum: "md5=f42a1d9e6b34192fc131c9ac85cad4f6"
}

Lint

Command
true
Return code
0

Dry install 🏜️

Dry install with the current Coq version:

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

Command
opam remove -y coq; opam install -y --show-action --unlock-base coq-tlc.20180316
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