# 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 dev The Coq Proof Assistant
coq-core dev The Coq Proof Assistant -- Core Binaries and Tools
coq-stdlib dev The Coq Proof Assistant -- Standard Library
coqide-server dev The Coq Proof Assistant, XML protocol server
dune 3.13.0 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:
# This file was generated from `meta.yml`, please do not edit manually.
# Follow the instructions on https://github.com/coq-community/templates to regenerate.
opam-version: "2.0"
maintainer: "erik.martin-dorel@irit.fr"
homepage: "https://github.com/pPomCo/belgames"
dev-repo: "git+https://github.com/pPomCo/belgames.git"
bug-reports: "https://github.com/pPomCo/belgames/issues"
license: "MIT"
synopsis: "BelGames: A Formal Theory of Games of Incomplete Information Based on Belief Functions in the Coq Proof Assistant"
description: """
We extend Bayesian games to the theory of belief functions. We
obtain a more expressive class of games we refer to as BelGames. It
makes it possible to better capture human behaviors with respect to
lack of information.
Next, we prove an extended version of the so-called
Howson--Rosenthal's theorem, showing that BelGames can be turned
into games of complete information, i.e., without any uncertainty."""
build: [make "-j%{jobs}%"]
install: [make "install"]
depends: [
"coq" {(>= "8.14" & < "8.17~")}
"coq-mathcomp-algebra" {(>= "1.13" & < "1.16~")}
]
tags: [
"keyword:games of incomplete information"
"keyword:belief functions theory"
"category:Computer Science/Decision Procedures and Certified Algorithms/Correctness proofs of algorithms"
"logpath:BelGames"
"date:2022-09-22"
]
authors: [
"Pierre Pomeret-Coquot"
"Erik Martin-Dorel"
"Hélène Fargier"
]
url {
src: "https://github.com/pPomCo/belgames/archive/refs/tags/1.0.0.tar.gz"
checksum: "sha512=5dc6cc1f8812213c7519ff192f0eaf76b9920f7b10835668a2bc35d15917bb9db52668f0fda80c19ce58dc8cfa0dfe1701d1079457a47f077661d1edce5889d6"
}
trueDry install with the current Coq version:
opam install -y --show-action coq-belgames.1.0.0 coq.dev[NOTE] Package coq is already installed (current version is dev).
[ERROR] Package conflict!
* No agreement on the version of coq:
- coq >= dev
- coq-belgames < 1.1.0 -> coq < 8.17~
* No agreement on the version of ocaml:
- (invariant) -> ocaml-base-compiler >= 5.1.1 -> ocaml = 5.1.1
- coq-belgames < 1.1.0 -> coq < 8.17~ -> ocaml < 4.05.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-belgames < 1.1.0 -> coq < 8.17~ -> ocaml < 4.05.0 -> ocaml-base-compiler < 3.07+1
* Incompatible packages:
- (invariant) -> ocaml-base-compiler >= 5.1.1 -> base-nnp
- coq-belgames < 1.1.0 -> coq < 8.17~
* Missing dependency:
- coq-belgames < 1.1.0 -> coq < 8.17~ -> ocaml < 4.05.0 -> ocaml-variants -> 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-belgames.1.0.0truetrueNo files were installed.
true