# Packages matching: installed # Name # Installed # Synopsis base-bigarray base base-domains base base-nnp base Naked pointers prohibited in the OCaml heap base-threads base base-unix base conf-gmp 4 Virtual package relying on a GMP lib system installation coq 8.17.0 The Coq Proof Assistant coq-core 8.17.0 The Coq Proof Assistant -- Core Binaries and Tools coq-stdlib 8.17.0 The Coq Proof Assistant -- Standard Library coqide-server 8.17.0 The Coq Proof Assistant, XML protocol server dune 3.12.2 Fast, portable, and opinionated build system ocaml 5.1.1 The OCaml compiler (virtual package) ocaml-base-compiler 5.1.1 Official release 5.1.1 ocaml-config 3 OCaml Switch Configuration ocaml-options-vanilla 1 Ensure that OCaml is compiled with no special options enabled ocamlfind 1.9.6 A library manager for OCaml zarith 1.13 Implements arithmetic and logical operations over arbitrary-precision integers # opam file: opam-version: "2.0" maintainer: "christian.doczkal@inria.fr" homepage: "https://github.com/coq-community/comp-dec-modal" dev-repo: "git+https://github.com/coq-community/comp-dec-modal.git" bug-reports: "https://github.com/coq-community/comp-dec-modal/issues" doc: "https://coq-community.github.io/comp-dec-modal/" license: "CECILL-B" synopsis: "Constructive proofs of soundness and completeness for K, K*, CTL, PDL, and PDL with converse" description: """ This project presents machine-checked constructive proofs of soundness, completeness, decidability, and the small-model property for the logics K, K*, CTL, and PDL (with and without converse). For all considered logics, we prove soundness and completeness of their respective Hilbert-style axiomatization. For K, K*, and CTL, we also prove soundness and completeness for Gentzen systems (i.e., sequent calculi). For each logic, the central construction is a pruning-based algorithm computing for a given formula either a satisfying model of bounded size or a proof of its negation. The completeness and decidability results then follow with soundness from the existence of said algorithm. """ build: [make "-j%{jobs}%" ] install: [make "install"] depends: [ "coq" {(>= "8.10" & < "8.14~") | (= "dev")} "coq-mathcomp-ssreflect" {(>= "1.9" & < "1.13~") | (= "dev")} ] tags: [ "category:Mathematics/Logic/Modal logic" "keyword:modal logic" "keyword:completeness" "keyword:decidability" "keyword:Hilbert system" "keyword:computation tree logic" "keyword:propositional dynamic logic" "logpath:CompDecModal" "date:2020-09-35" ] authors: [ "Christian Doczkal" ] url { src: "https://github.com/coq-community/comp-dec-modal/archive/v1.0.tar.gz" checksum: "sha512=b9f0db9672d05e0fce859e3f4d4040275d30f7a6846a262767161283889f7bec5c078508a90a1ab6be87809c2431493f74a670f7d5789c5760a1028a1998854f" }
true
Dry install with the current Coq version:
opam install -y --show-action coq-comp-dec-modal.1.0 coq.8.17.0
[NOTE] Package coq is already installed (current version is 8.17.0). [ERROR] Package conflict! * No agreement on the version of ocaml: - (invariant) -> ocaml-base-compiler >= 5.1.1 -> ocaml = 5.1.1 - coq-comp-dec-modal < 1.1 -> coq (< 8.14~ | >= dev) -> ocaml < 4.02.0 You can temporarily relax the switch invariant with `--update-invariant' * No agreement on the version of ocaml-base-compiler: - (invariant) -> ocaml-base-compiler >= 5.1.1 - coq-comp-dec-modal < 1.1 -> coq (< 8.14~ | >= dev) -> ocaml < 4.02.0 -> ocaml-base-compiler = 3.07+1 * Incompatible packages: - (invariant) -> ocaml-base-compiler >= 5.1.1 -> base-nnp - coq-comp-dec-modal < 1.1 -> coq (< 8.14~ | >= dev) * Missing dependency: - coq-comp-dec-modal < 1.1 -> coq (< 8.14~ | >= dev) -> ocaml < 4.02.0 -> ocaml-variants >= 3.11.2 -> ocaml-beta unmet availability conditions: 'enable-ocaml-beta-repository' 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-comp-dec-modal.1.0
true
true
No files were installed.
true