# 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: "matej.kosik@inria.fr" homepage: "https://github.com/coq-contribs/hoare-tut" license: "GNU LGPL" build: [make "-j%{jobs}%"] install: [make "install"] remove: ["rm" "-R" "%{lib}%/coq/user-contrib/HoareTut"] depends: [ "ocaml" "coq" {>= "8.5" & < "8.6~"} ] tags: [ "keyword:Hoare logic" "keyword:imperative program" "keyword:weakest precondition" "keyword:reflection" "category:Computer Science/Semantics and Compilation/Semantics" "date:2007" ] authors: [ "Sylvain Boulmé <Sylvain.Boulme@imag.fr>" ] bug-reports: "https://github.com/coq-contribs/hoare-tut/issues" dev-repo: "git+https://github.com/coq-contribs/hoare-tut.git" synopsis: "A Tutorial on Reflecting in Coq the generation of Hoare proof obligations" description: """ This work is both an introduction to Hoare logic and a demo illustrating Coq nice features. It formalizes the generation of PO (proof obligations) in a Hoare logic for a very basic imperative programming language. It proves the soundness and the completeness of the PO generation both in partial and total correctness. At last, it examplifies on a very simple example (a GCD computation) how the PO generation can simplify concrete proofs. Coq is indeed able to compute PO on concrete programs: we say here that the generation of proof obligations is reflected in Coq. Technically, the PO generation is here performed through Dijkstra's weakest-precondition calculus.""" flags: light-uninstall url { src: "https://github.com/coq-contribs/hoare-tut/archive/v8.5.0.tar.gz" checksum: "md5=de2ae9bce949f357c214f486a71aa685" }
true
Dry install with the current Coq version:
opam install -y --show-action coq-hoare-tut.8.5.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-hoare-tut < 8.6.0 -> coq < 8.6~ -> 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-hoare-tut < 8.6.0 -> coq < 8.6~ -> ocaml < 4.02.0 -> ocaml-base-compiler = 3.07+1 * Missing dependency: - coq-hoare-tut < 8.6.0 -> coq < 8.6~ -> ocaml < 4.02.0 -> ocaml-variants >= 3.11.1 -> 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-hoare-tut.8.5.0
true
true
No files were installed.
true