* (2019-07-15 10:52:38 UTC)*

# Packages matching: installed # Name # Installed # Synopsis base-bigarray base base-num base Num library distributed with the OCaml compiler base-threads base base-unix base camlp5 7.06.10-g84ce6cc4 Preprocessor-pretty-printer of OCaml conf-m4 1 Virtual package relying on m4 coq 8.6.1 Formal proof management system. num 0 The Num library for arbitrary-precision integer and rational arithmetic 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 ocamlfind 1.8.0 A library manager for OCaml # opam file: opam-version: "2.0" maintainer: "Hugo.Herbelin@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.7" & < "8.8~"} ] tags: [ "keyword: Hoare logic" "keyword: imperative program" "keyword: weakest precondition" "keyword: reflection" "category: Mathematics/Logic/See also" "category: Computer Science/Semantics and Compilation/Semantics" "date: 2007" ] authors: [ "Sylvain Boulmé <Sylvain.Boulme@imag.fr> [http://www-verimag.imag.fr/~boulme]" ] 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: """ http://www-verimag.imag.fr/~boulme/HOARE_LOGIC_TUTORIAL/ 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.7.0.tar.gz" checksum: "md5=8ba859070a0cf7578f6e50b70994aa9e" }

- Command
`true`

- Return code
- 0

Dry install with the current Coq version:

- Command
`opam install -y --show-action coq-hoare-tut.8.7.0 coq.8.6.1`

- Return code
- 5120
- Output
[NOTE] Package coq is already installed (current version is 8.6.1). The following dependencies couldn't be met: - coq-hoare-tut -> coq >= 8.7 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-hoare-tut.8.7.0`

- Return code
- 0

- Command
`true`

- Return code
- 0
- Duration
- 0 s

- Command
`true`

- Return code
- 0
- Duration
- 0 s

No files were installed.

- Command
`true`

- Return code
- 0
- Missing removes
- none
- Wrong removes
- none