« Up

hoare-tut 8.5.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.14.0      Formal proof management system
dune                     3.2.0       Fast, portable, and opinionated build system
ocaml                    4.06.1      The OCaml compiler (virtual package)
ocaml-base-compiler      4.06.1      Official 4.06.1 release
ocaml-config             1           OCaml Switch Configuration
ocaml-secondary-compiler 4.08.1-1    OCaml 4.08.1 Secondary Switch Compiler
ocamlfind                1.9.1       A library manager for OCaml
ocamlfind-secondary      1.9.1       Adds support for ocaml-secondary-compiler to ocamlfind
zarith                   1.12        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"
}

Lint

Command
true
Return code
0

Dry install 🏜️

Dry install with the current Coq version:

Command
opam install -y --show-action coq-hoare-tut.8.5.0 coq.8.14.0
Return code
5120
Output
[NOTE] Package coq is already installed (current version is 8.14.0).
The following dependencies couldn't be met:
  - coq-hoare-tut -> coq < 8.6~ -> ocaml < 4.06.0
      base of this switch (use `--unlock-base' to force)
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.5.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