« Up

pautomata 8.6.0 Not compatible 👼

📅 (2022-05-14 08:21:45 UTC)

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                   dev         Formal proof management system
dune                  3.1.1       Fast, portable, and opinionated build system
ocaml                 4.12.1      The OCaml compiler (virtual package)
ocaml-base-compiler   4.12.1      Official release 4.12.1
ocaml-config          2           OCaml Switch Configuration
ocaml-options-vanilla 1           Ensure that OCaml is compiled with no special options enabled
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: "Hugo.Herbelin@inria.fr"
homepage: "https://github.com/coq-contribs/pautomata"
license: "LGPL 2.1"
build: [make "-j%{jobs}%"]
install: [make "install"]
remove: ["rm" "-R" "%{lib}%/coq/user-contrib/PAutomata"]
depends: [
  "ocaml"
  "coq" {>= "8.6" & < "8.7~"}
]
tags: [ "keyword: p-automata" "keyword: ABR" "keyword: PGM" "keyword: time" "category: Computer Science/Concurrent Systems and Protocols/Theory of concurrent systems" ]
authors: [ "Emmanuel Freund & Christine Paulin" ]
bug-reports: "https://github.com/coq-contribs/pautomata/issues"
dev-repo: "git+https://github.com/coq-contribs/pautomata.git"
synopsis: "Parameterized automata"
description: """
This contribution is a modelisation in Coq of the p-automata
designed in the CALIFE project (http://www.loria.fr/calife).
It contains an axiomatisation of time,
the definition of a p-automaton, the definition of binary and
arbitrary synchronisation of a family of p-automaton, the semantics of
a p-automaton as a labelled transition system. The description of the ABR
algorithm as a p-automaton is also given.
This work is reported in : P. Castéran, E. Freund, C. Paulin and
D. Rouillard ``Bibliothèques Coq et Isabelle-HOL pour les systèmes de
transitions et les p-automates''"""
flags: light-uninstall
url {
  src: "https://github.com/coq-contribs/pautomata/archive/v8.6.0.tar.gz"
  checksum: "md5=0dd51240e2dbff81617de0d68e40d59b"
}

Lint

Command
true
Return code
0

Dry install 🏜️

Dry install with the current Coq version:

Command
opam install -y --show-action coq-pautomata.8.6.0 coq.dev
Return code
5120
Output
[NOTE] Package coq is already installed (current version is dev).
The following dependencies couldn't be met:
  - coq-pautomata -> coq < 8.7~ -> ocaml < 4.06.0
      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-pautomata.8.6.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