ยซ Up

comp-dec-modal 1.0 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.16.1      Formal proof management system
dune                  3.12.1      Fast, portable, and opinionated build system
ocaml                 4.13.1      The OCaml compiler (virtual package)
ocaml-base-compiler   4.13.1      Official release 4.13.1
ocaml-config          2           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"
}

Lint

Command
true
Return code
0

Dry install ๐Ÿœ๏ธ

Dry install with the current Coq version:

Command
opam install -y --show-action coq-comp-dec-modal.1.0 coq.8.16.1
Return code
5120
Output
[NOTE] Package coq is already installed (current version is 8.16.1).
The following dependencies couldn't be met:
  - coq-comp-dec-modal -> coq-mathcomp-ssreflect (< 1.13~ & = dev) -> coq < 8.15~ -> ocaml < 4.12
      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-comp-dec-modal.1.0
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