# 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.15.0 Formal proof management system
dune 3.1.1 Fast, portable, and opinionated build system
ocaml 4.11.2 The OCaml compiler (virtual package)
ocaml-base-compiler 4.11.2 Official release 4.11.2
ocaml-config 1 OCaml Switch Configuration
ocamlfind 1.9.3 A library manager for OCaml
zarith 1.12 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:Computer Science/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"
}
trueDry install with the current Coq version:
opam install -y --show-action coq-comp-dec-modal.1.0 coq.8.15.0[NOTE] Package coq is already installed (current version is 8.15.0).
The following dependencies couldn't be met:
- coq-comp-dec-modal -> coq (< 8.14~ & = dev) -> ocaml < 4.10
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:
opam remove -y coq; opam install -y --show-action --unlock-base coq-comp-dec-modal.1.0truetrueNo files were installed.
true