# 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.1 The Coq Proof Assistant
coq-core 8.17.1 The Coq Proof Assistant -- Core Binaries and Tools
coq-stdlib 8.17.1 The Coq Proof Assistant -- Standard Library
coqide-server 8.17.1 The Coq Proof Assistant, XML protocol server
dune 3.12.2 Fast, portable, and opinionated build system
ocaml 5.0.0 The OCaml compiler (virtual package)
ocaml-base-compiler 5.0.0 Official release 5.0.0
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: "Hugo.Herbelin@inria.fr"
homepage: "https://github.com/coq-contribs/quicksort-complexity"
license: "BSD"
build: [make "-j%{jobs}%"]
install: [make "install"]
remove: ["rm" "-R" "%{lib}%/coq/user-contrib/QuicksortComplexity"]
depends: [
"ocaml"
"coq" {>= "8.10" & < "8.11~"}
]
tags: [
"keyword: quicksort"
"keyword: complexity"
"keyword: average-case"
"category: Computer Science/Decision Procedures and Certified Algorithms/Correctness proofs of algorithms"
"date: 2010-06"
]
authors: [
"Eelis"
]
bug-reports: "https://github.com/coq-contribs/quicksort-complexity/issues"
dev-repo: "git+https://github.com/coq-contribs/quicksort-complexity.git"
synopsis: "Proofs of Quicksort's worst- and average-case complexity"
description: """
The development contains:
- a set of monads and monad transformers for measuring a (possibly nondeterministic) algorithm's use of designated operations;
- monadically expressed deterministic and nondeterministic implementations of Quicksort;
- proofs of these implementations' worst- and average case complexity.
Most of the development is documented in the TYPES 2008 paper "A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq", available at the homepage."""
flags: light-uninstall
url {
src: "https://github.com/coq-contribs/quicksort-complexity/archive/v8.10.0.tar.gz"
checksum: "md5=c3b2ccbc5f13d56f46e99b51fef90a04"
}
trueDry install with the current Coq version:
opam install -y --show-action coq-quicksort-complexity.8.10.0 coq.8.17.1[NOTE] Package coq is already installed (current version is 8.17.1).
[ERROR] Package conflict!
* No agreement on the version of ocaml:
- (invariant) -> ocaml-base-compiler = 5.0.0 -> ocaml = 5.0.0
- coq-quicksort-complexity >= 8.10.0 -> coq < 8.11~ -> 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.0.0
- coq-quicksort-complexity >= 8.10.0 -> coq < 8.11~ -> ocaml < 4.02.0 -> ocaml-base-compiler < 3.07+1
* Missing dependency:
- coq-quicksort-complexity >= 8.10.0 -> coq < 8.11~ -> ocaml < 4.02.0 -> ocaml-variants >= 3.09.2 -> 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-quicksort-complexity.8.10.0truetrueNo files were installed.
true